Hélène Collavizza
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Hélène Collavizza has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Michel Rueher
University of Nice Sophia Antipolis / I3SCNRS 2000 route des Lucioles -Les Algorithmes -bât. Euclide B BP 121 -06903 Sophia Antipolis Cedex -France
3 shared publications - Vinh Le
University of Nice, I3S-CNRS, Sophia Antipolis Cedex, France
3 shared publications - Antoine Rollet
University of Bordeaux / LABRICNRS 351 Cours de la Libération - 33405 Talence cedex -France
2 shared publications - Olivier Ponsini
University of Nice Sophia Antipolis / I3SCNRS 2000 route des Lucioles -Les Algorithmes -bât. Euclide B BP 121 -06903 Sophia Antipolis Cedex -France
2 shared publications - Michael J. C. Gordon
University of Cambridge Computer Laboratory, William Gates Building, 15 JJ Thomson Avenue, Cambridge CB3 0FD, UK
1 shared publication - Samuel Devulder1 shared publication
Latest Publications
- 30 August 2012
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 16 (1) , 103-121
Constraint-based BMC: a backjumping strategy
- 30 August 2012
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 16 (1) , 103-121
Constraint-based BMC: a backjumping strategy
- Open Access
Constraint-Based BMC: A Backjumping Strategy
Safety property checking is mandatory in the validation process of critical software. When formal verification tools fail to prove some properties, the automatic generation of counterexamples for a given loop depth is an important issue in practice. We investigate in this paper the capabilities of constraint-based bounded model checking for program verification and counterexample generation on real applications. We introduce DPVS (Dynamic Post-condition Variable driven Strategy), a new backjumping strategy we developed to handle an industrial application from a car manufacturer, the Flasher Manager. This backjumping strategy is used to search a faulty path and to collect the constraints of such a path. The simplified control flow graph (CFG) of the program is explored in a backward way, starting from the post-condition and jumping to the most promising node where the variables of the post-condition are defined. In other words, the constraints are collected by exploring the CFG in a dynamic and non-sequential backward way. The Flasher Manager application has been designed and simulated using the Simulink platform. However, this module is concretely embedded as a C program in a car computer, thus we have to check that the safety properties are preserved on this C code. We report experiments on the Flasher Manager with our constraint-based bounded model checker, and with CBMC, a state-of-the-art bounded model checker. Experiments show that DPVS and CBMC have similar performances on one property of the Flasher Manager; DPVS outperforms CBMC to find a counterexample for two properties; two of the properties of the Flasher Manager remain intractable for CBMC and DPVS.
Open AccessConstraint-Based BMC: A Backjumping Strategy
Safety property checking is mandatory in the validation process of critical software. When formal verification tools fail to prove some properties, the automatic generation of counterexamples for a given loop depth is an important issue in practice. We investigate in this paper the capabilities of constraint-based bounded model checking for program verification and counterexample generation on real applications. We introduce DPVS (Dynamic Post-condition Variable driven Strategy), a new backjumping strategy we developed to handle an industrial application from a car manufacturer, the Flasher Manager. This backjumping strategy is used to search a faulty path and to collect the constraints of such a path. The simplified control flow graph (CFG) of the program is explored in a backward way, starting from the post-condition and jumping to the most promising node where the variables of the post-condition are defined. In other words, the constraints are collected by exploring the CFG in a dynamic and non-sequential backward way. The Flasher Manager application has been designed and simulated using the Simulink platform. However, this module is concretely embedded as a C program in a car computer, thus we have to check that the safety properties are preserved on this C code. We report experiments on the Flasher Manager with our constraint-based bounded model checker, and with CBMC, a state-of-the-art bounded model checker. Experiments show that DPVS and CBMC have similar performances on one property of the Flasher Manager; DPVS outperforms CBMC to find a counterexample for two properties; two of the properties of the Flasher Manager remain intractable for CBMC and DPVS.
- Open Access
A Dynamic Constraint-Based BMC Strategy For Generating Counterexamples
Checking safety properties is mandatory in the validation process of critical software. When formal verification tools fail to prove some properties, the automatic generation of counterexamples for a given loop depth is achievable, and is therefore an important issue in practice. We propose in this paper a dynamic constraint based exploration strategy for software bounded model checking. Constraint solving is integrated with state exploration to prune state space. Experiments on a real industrial Flasher Manager controller show that our system outperforms state of the art bounded model checking tools.
Open AccessA Dynamic Constraint-Based BMC Strategy For Generating Counterexamples
Checking safety properties is mandatory in the validation process of critical software. When formal verification tools fail to prove some properties, the automatic generation of counterexamples for a given loop depth is achievable, and is therefore an important issue in practice. We propose in this paper a dynamic constraint based exploration strategy for software bounded model checking. Constraint solving is integrated with state exploration to prune state space. Experiments on a real industrial Flasher Manager controller show that our system outperforms state of the art bounded model checking tools.