Sciweavers

35 search results - page 1 / 7
» Practical Tactics for Separation Logic
Sort
View
TPHOL
2009
IEEE
13 years 11 months ago
Practical Tactics for Separation Logic
Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctne...
Andrew McCreight
TPHOL
2008
IEEE
13 years 11 months ago
Lightweight Separation
Abstract. Lightweight separation is a novel approach to automatic reasoning about memory updates in pointer programs. It replaces the spatial formulae of separation logic, which co...
Holger Gast
POPL
2010
ACM
14 years 2 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
POPL
2008
ACM
14 years 5 months ago
Enhancing modular OO verification with separation logic
Conventional specifications for object-oriented (OO) programs must adhere to behavioral subtyping in support of class inheritance and method overriding. However, this requirement ...
Wei-Ngan Chin, Cristina David, Huu Hai Nguyen, She...
PLDI
2011
ACM
12 years 7 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...