145 search results - page 1 / 29 » Symbolic Execution with Separation Logic |
APLAS
2005
ACM
13 years 10 months ago
2005
ACM
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
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...
ECOOP
2010
Springer
13 years 8 months ago
2010
Springer
Specifications of Object-Oriented programs conventionally employ Boolean expressions of the programming language for assertions. Programming errors can be discovered by checking at...
CADE
2008
Springer
14 years 5 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
ISSTA
2010
ACM
13 years 7 months ago
2010
ACM
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...