VMCAI
2007
Springer
14 years 5 months ago
2007
Springer
Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of ‘good...
VMCAI
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. This paper is concerned with one of the basic problems in abstract interpretation, namely, for a given abstraction and a given set of concrete transformers (that express ...
VMCAI
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Several verification methods involve reasoning about multi-valued systems, in which an atomic proposition is interpreted at a state as a lattice element, rather than a B...
VMCAI
2007
Springer
14 years 5 months ago
2007
Springer
VMCAI
2007
Springer
14 years 5 months ago
2007
Springer
VMCAI
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. This paper presents a novel shape analysis algorithm with local reasoning that is designed to analyze heap structures with structural invariants, such y-linked lists. The...
VMCAI
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
VMCAI
2007
Springer
14 years 5 months ago
2007
Springer
VMCAI
2007
Springer
14 years 5 months ago
2007
Springer
We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of pro...
VMCAI
2007
Springer
14 years 5 months ago
2007
Springer
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...