Abstract. We propose a new formalism for reasoning about dynamic memory heaps, using monotonic abstraction and symbolic backward reach-ability analysis. We represent the heaps as graphs, and introduce an or-dering on these graphs. This enables us to represent the violation of a given safety property as the reachability of a finitely representable set of bad graphs. We also describe how to symbolically compute the reachable states in the transition system induced by a program.
Monotonicity in concurrent systems stipulates that, in any global state, system actions remain execu...
This paper shows how to harness existing theorem provers for first-order logic to automatically veri...
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap ...
We propose a new formalism for reasoning about dynamic memory heaps, using monotonic abstraction and...
We investigate the use of monotonic abstraction and backward reachability analysis as means of perfo...
We investigate the use of monotonic abstraction and backward reachability analysis as means of perfo...
We investigate the use of monotonic abstraction and backward reachability analysis as means of perfo...
Shape analysis deals with the synthesis of invariants for programs manipulating heap-allocated data ...
We present a new approach for automatic verification of data-dependent programs manipulating dynamic...
Abstract. Previous shape analysis algorithms use a memory model where the heap is composed of discre...
The paper defines the class of heap monotonic typestates. The monotonicity of such typestates enable...
Shape analysis algorithms conservatively verify imperative programs and algorithms that use destruct...
Abstract. Termination of a heap-manipulating program generally depends on preconditions that express...
AbstractWe define the class of single-parent heap systems, which rely on a singly-linked heap in ord...
Verification of programs requires reasoning about sets of program states. In case of programs manipu...
Monotonicity in concurrent systems stipulates that, in any global state, system actions remain execu...
This paper shows how to harness existing theorem provers for first-order logic to automatically veri...
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap ...
We propose a new formalism for reasoning about dynamic memory heaps, using monotonic abstraction and...
We investigate the use of monotonic abstraction and backward reachability analysis as means of perfo...
We investigate the use of monotonic abstraction and backward reachability analysis as means of perfo...
We investigate the use of monotonic abstraction and backward reachability analysis as means of perfo...
Shape analysis deals with the synthesis of invariants for programs manipulating heap-allocated data ...
We present a new approach for automatic verification of data-dependent programs manipulating dynamic...
Abstract. Previous shape analysis algorithms use a memory model where the heap is composed of discre...
The paper defines the class of heap monotonic typestates. The monotonicity of such typestates enable...
Shape analysis algorithms conservatively verify imperative programs and algorithms that use destruct...
Abstract. Termination of a heap-manipulating program generally depends on preconditions that express...
AbstractWe define the class of single-parent heap systems, which rely on a singly-linked heap in ord...
Verification of programs requires reasoning about sets of program states. In case of programs manipu...
Monotonicity in concurrent systems stipulates that, in any global state, system actions remain execu...
This paper shows how to harness existing theorem provers for first-order logic to automatically veri...
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap ...
Add to ORKG