315 search results - page 6 / 63 » Reasoning about Assignments in Recursive Data Structures |
201
click to vote
POPL
2010
ACM
16 years 2 months ago
2010
ACM
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
135
click to vote
ESOP
2003
Springer
15 years 10 months ago
2003
Springer
This paper proposes the use of constraint logic programming (CLP) to perform model checking of traditional, imperative programs. We present a semantics-preserving translation from ...
172
Voted
TPHOL
2008
IEEE
15 years 11 months ago
2008
IEEE
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
199
Voted
HLPPP
1991
15 years 9 months ago
1991
Swarm is a computational model which extends the UNITY model in three important ways: (1) UNITY’s fixed set of variables is replaced by an unbounded set of tuples which are add...
142
click to vote
FCT
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...