National audienceThe limited amount of memory is the major bottleneck in model checkingtools and algorithms based on an explicit states enumeration. Thus,techniques which allow to represent the states efficiently areprecious for these tools. We present in this work a novel approachwhich enables to store the state space in a compact way. Though itbelongs to the family of explicit storage methods, we qualify it assemi-explicit since states may not be explicitly represented in the statespace. Experiments show that very compact representations areobtained, with an acceptable increase of the run time
Abstract. The phrase model checking refers to algorithms for exploring the state space of a transiti...
The phrase model checking refers to algorithms for exploring the state space of a transition system ...
A number of algorithms for computing the simulation preorder on Kripke structures and on labelled tr...
National audienceThe limited amount of memory is the major bottleneck in model checkingtools and alg...
Formal methods have an unprecedented ability to en-dorse the correctness of a system. In spite of th...
Abstract. Behrmann et al. posed the question whether “To Store or Not To Store ” [1] states during r...
Formal methods have an unprecedented ability to endorse the correctness of a system. In spite of tha...
pre-printThe enormous number of states reachable during explicit model checking is the main bottlene...
. In the context of model-checking, state space reduction techniques are often conservative in the s...
International audienceVerification via model-checking is a very demanding activity in terms of compu...
AbstractVerification of imperative programs means reasoning about modifications of a program state. ...
Abstract. We describe a dynamic partitioning scheme usable by model checking techniques that divide ...
We investigate new techniques for reducing the memory requirements of an on-the-fly model checking t...
. State space reduction techniques are often conservative in the sense that the checked property is...
Our goal is to automatically generate heuristics to guide state space search. Our heuristics are def...
Abstract. The phrase model checking refers to algorithms for exploring the state space of a transiti...
The phrase model checking refers to algorithms for exploring the state space of a transition system ...
A number of algorithms for computing the simulation preorder on Kripke structures and on labelled tr...
National audienceThe limited amount of memory is the major bottleneck in model checkingtools and alg...
Formal methods have an unprecedented ability to en-dorse the correctness of a system. In spite of th...
Abstract. Behrmann et al. posed the question whether “To Store or Not To Store ” [1] states during r...
Formal methods have an unprecedented ability to endorse the correctness of a system. In spite of tha...
pre-printThe enormous number of states reachable during explicit model checking is the main bottlene...
. In the context of model-checking, state space reduction techniques are often conservative in the s...
International audienceVerification via model-checking is a very demanding activity in terms of compu...
AbstractVerification of imperative programs means reasoning about modifications of a program state. ...
Abstract. We describe a dynamic partitioning scheme usable by model checking techniques that divide ...
We investigate new techniques for reducing the memory requirements of an on-the-fly model checking t...
. State space reduction techniques are often conservative in the sense that the checked property is...
Our goal is to automatically generate heuristics to guide state space search. Our heuristics are def...
Abstract. The phrase model checking refers to algorithms for exploring the state space of a transiti...
The phrase model checking refers to algorithms for exploring the state space of a transition system ...
A number of algorithms for computing the simulation preorder on Kripke structures and on labelled tr...