Sciweavers

173 search results - page 4 / 35
» Towards Mechanized Program Verification with Separation Logi...
Sort
View
POPL
2010
ACM
15 years 7 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...
DAC
2003
ACM
15 years 10 months ago
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
Sanjit A. Seshia, Shuvendu K. Lahiri, Randal E. Br...
ESOP
2006
Springer
15 years 1 months ago
ILC: A Foundation for Automated Reasoning About Pointer Programs
This paper presents a new program logic designed for facilitating automated reasoning about pointer programs. The program logic is directly inspired by previous work by O'Hea...
Limin Jia, David Walker
ECOOP
2010
Springer
15 years 1 months ago
Verifying Executable Object-Oriented Specifications with Separation Logic
Specifications of Object-Oriented programs conventionally employ Boolean expressions of the programming language for assertions. Programming errors can be discovered by checking at...
Stephan van Staden, Cristiano Calcagno, Bertrand M...
CADE
2008
Springer
15 years 10 months ago
Towards SMT Model Checking of Array-Based Systems
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...