Add to ORKGWe 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 uses a form of symbolic execution, a decidable proof theory for symbolic heaps, and extraction of frame axioms from incomplete proofs. This is a precursor to the use of the logic in automatic specification checking, program analysis, and model checking
An algebraic approach to the design of program construction and verification tools is applied to sep...
Higher order store programs are programs which store, manipulate and invoke code at runtime. Importa...
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable dat...
Abstract. We describe a sound method for automatically proving Hoare triples for loop-free code in S...
This paper considers Reynolds’s separation logic with all logical connectives but without arbitrary ...
Separation logic is a popular specification language for imperative programs where the heap can only...
Abstract. Separation logic is a popular specification language for im-perative programs where the he...
Separation logic (SL) is an extension of Hoare logic to reason about programs with mutable data stru...
We propose a novel approach to proving the termination of heap-manipulating programs, which combines...
We propose a novel approach to proving the termination of heap-manipulating programs, which combines...
We propose a novel approach to proving the termination of heap-manipulating programs, which combines...
We study three aspects of program verification with separation logic:1. Reasoning about quantitative...
Abstract. After some general remarks about program verification, we introduce separation logic, a no...
An important, challenging problem in the verification of imperative programs with shared, mutable st...
Separation logic is an extension of Hoare logic which permits reasoning about low-level imperative p...
An algebraic approach to the design of program construction and verification tools is applied to sep...
Higher order store programs are programs which store, manipulate and invoke code at runtime. Importa...
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable dat...
Abstract. We describe a sound method for automatically proving Hoare triples for loop-free code in S...
This paper considers Reynolds’s separation logic with all logical connectives but without arbitrary ...
Separation logic is a popular specification language for imperative programs where the heap can only...
Abstract. Separation logic is a popular specification language for im-perative programs where the he...
Separation logic (SL) is an extension of Hoare logic to reason about programs with mutable data stru...
We propose a novel approach to proving the termination of heap-manipulating programs, which combines...
We propose a novel approach to proving the termination of heap-manipulating programs, which combines...
We propose a novel approach to proving the termination of heap-manipulating programs, which combines...
We study three aspects of program verification with separation logic:1. Reasoning about quantitative...
Abstract. After some general remarks about program verification, we introduce separation logic, a no...
An important, challenging problem in the verification of imperative programs with shared, mutable st...
Separation logic is an extension of Hoare logic which permits reasoning about low-level imperative p...
An algebraic approach to the design of program construction and verification tools is applied to sep...
Higher order store programs are programs which store, manipulate and invoke code at runtime. Importa...
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable dat...