632 search results - page 63 / 127 » Proving Invariants of Functional Programs |
104
Voted
TACAS
2009
Springer
15 years 7 months ago
2009
Springer
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
110
Voted
CSL
2009
Springer
15 years 7 months ago
2009
Springer
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level language...
95
Voted
FCT
2007
Springer
15 years 6 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...
110
Voted
WDAG
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...
109
Voted
ESOP
2009
Springer
15 years 4 months ago
2009
Springer
Ownership types characterize the topology of objects in the heap, through a characterization of the context to which an object belongs. They have been used to support reasoning, me...