49 search results - page 2 / 10 » A Structural Proof of the Soundness of Rely guarantee Rules |
POPL
2008
ACM
14 years 5 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
BIRTHDAY
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
RTA
2010
Springer
13 years 8 months ago
2010
Springer
Decreasing diagrams technique (van Oostrom, 1994) is a technique that can be widely applied to prove confluence of rewrite systems. To directly apply the decreasing diagrams techn...
FOAL
2009
ACM
13 years 11 months ago
2009
ACM
We present a programming language model of the ideas behind Functional Adaptive Programming (AP-F) and our Java implementation, DemeterF. Computation in AP-F is encapsulated in se...
SAS
2007
Springer
13 years 11 months ago
2007
Springer
We present a framework for inductive definitions in the logic of bunched implications, BI, and formulate two sequent calculus proof systems for inductive reasoning in this framewo...