632 search results - page 36 / 127 » Proving Invariants of Functional Programs |
209
Voted
POPL
2006
ACM
16 years 26 days ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
110
click to vote
FOSSACS
2006
Springer
15 years 4 months ago
2006
Springer
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
94
Voted
SAS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
96
Voted
ENTCS
2002
15 years 10 days ago
2002
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
97
Voted
KBSE
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—With the wide support for serialization in objectoriented programming languages, persistent objects have become common place. Retrieving previously “persisted” objec...