Abstract. A safety property restricts the set of reachable states. In this paper, we introduce a notion of relative safety which states that certain program states are reachable provided certain other states are. A key, but not exclusive, application of this method is in representing symmetry in a program. Here, we show that relative safety generalizes the programs that are presently accommodated by existing methods for symmetry. Finally, we provide a practical algorithm for proving relative safety.
We are interested in automatically proving safety properties of infinite state systems. We present a...
. We consider the problem of verifying correctness properties of a class of programs with states tha...
International audienceVerification of safety properties of concurrent programs with an arbitrary num...
Abstract. Of special interest in formal verification are safety properties, which assert that the sy...
Abstract. We present some extensions of a method for verifying safety properties of infinite state r...
We present some extensions of a method for verifying safety properties of infinite state reactive s...
In this paper we describe a technique to inherit safety properties from abstract programs to their i...
We consider infinite state reactive systems specified by using linear constraints over the integers,...
Abstract. We consider infinite state reactive systems specified by us-ing linear constraints over th...
In this report, we consider two promising methods for alleviating the state space explosion problem ...
Abstract. We consider infinite state reactive systems specified by using linear constraints over the...
While much progress has been made on veri-fication of discrete systems such as computer programs, wo...
Program specialization has been proposed as a means of improving constraint-based analysis of infini...
A new class of infinite-state automata, called safety automata, is introduced. Any safety property c...
We study the safety verification (reachability problem) for concurrent programs with uninterpreted f...
We are interested in automatically proving safety properties of infinite state systems. We present a...
. We consider the problem of verifying correctness properties of a class of programs with states tha...
International audienceVerification of safety properties of concurrent programs with an arbitrary num...
Abstract. Of special interest in formal verification are safety properties, which assert that the sy...
Abstract. We present some extensions of a method for verifying safety properties of infinite state r...
We present some extensions of a method for verifying safety properties of infinite state reactive s...
In this paper we describe a technique to inherit safety properties from abstract programs to their i...
We consider infinite state reactive systems specified by using linear constraints over the integers,...
Abstract. We consider infinite state reactive systems specified by us-ing linear constraints over th...
In this report, we consider two promising methods for alleviating the state space explosion problem ...
Abstract. We consider infinite state reactive systems specified by using linear constraints over the...
While much progress has been made on veri-fication of discrete systems such as computer programs, wo...
Program specialization has been proposed as a means of improving constraint-based analysis of infini...
A new class of infinite-state automata, called safety automata, is introduced. Any safety property c...
We study the safety verification (reachability problem) for concurrent programs with uninterpreted f...
We are interested in automatically proving safety properties of infinite state systems. We present a...
. We consider the problem of verifying correctness properties of a class of programs with states tha...
International audienceVerification of safety properties of concurrent programs with an arbitrary num...