Conference of 9th Workshop on Verification and Evaluation of Computer and Communication Systems, VECoS 2015 ; Conference Date: 10 September 2015 Through 11 September 2015; Conference Code:115655International audienceModel checking is an effective technique for uncovering subtle errors in concurrent systems. Unfortunately, the state space explosion is the main bottleneck in model checking tools. Here we propose a state space reduction technique for model checking concurrent programs written in C. The reduction technique consists in an analysis phase, which defines an approximate agglomeration predicate. This latter states whether a statement can be agglomerated or not. We implement this predicate using a syntactic analysis, as well as a sema...
Concurrent systems are getting more complex with the advent of multi-core processors and the support...
Predicate abstraction and counterexample-guided abstraction refinement (CEGAR) have enabled finite-s...
Model checking is a technique for finding errors in systems and algorithms. The tech nique requires ...
Conference of 9th Workshop on Verification and Evaluation of Computer and Communication Systems, VEC...
There has been considerable progress in the domain of software verification over the last few years....
Abstract. There has been considerable progress in the domain of software verifica-tion over the last...
The state space explosion problem in model checking remains the chief obstacle to the practical veri...
Abstract. There has been considerable progress in the domain of software verification over the last ...
Model checking is an automatic approach for the verification of systems. Explicit states model check...
AbstractThe state space explosion problem in model checking remains the chief obstacle to the practi...
We propose a new method for reducing the interleaving space dur-ing stateless model checking of mult...
Verifying concurrent programs is notoriously hard due to the state explosion problem: (1) the data s...
. In the context of model-checking, state space reduction techniques are often conservative in the s...
Many concurrent systems are required to maintain certain safety and liveness properties. One emergin...
Verification of a concurrent system can be accomplished by model checking the properties on a struct...
Concurrent systems are getting more complex with the advent of multi-core processors and the support...
Predicate abstraction and counterexample-guided abstraction refinement (CEGAR) have enabled finite-s...
Model checking is a technique for finding errors in systems and algorithms. The tech nique requires ...
Conference of 9th Workshop on Verification and Evaluation of Computer and Communication Systems, VEC...
There has been considerable progress in the domain of software verification over the last few years....
Abstract. There has been considerable progress in the domain of software verifica-tion over the last...
The state space explosion problem in model checking remains the chief obstacle to the practical veri...
Abstract. There has been considerable progress in the domain of software verification over the last ...
Model checking is an automatic approach for the verification of systems. Explicit states model check...
AbstractThe state space explosion problem in model checking remains the chief obstacle to the practi...
We propose a new method for reducing the interleaving space dur-ing stateless model checking of mult...
Verifying concurrent programs is notoriously hard due to the state explosion problem: (1) the data s...
. In the context of model-checking, state space reduction techniques are often conservative in the s...
Many concurrent systems are required to maintain certain safety and liveness properties. One emergin...
Verification of a concurrent system can be accomplished by model checking the properties on a struct...
Concurrent systems are getting more complex with the advent of multi-core processors and the support...
Predicate abstraction and counterexample-guided abstraction refinement (CEGAR) have enabled finite-s...
Model checking is a technique for finding errors in systems and algorithms. The tech nique requires ...