Enhancing Test Coverage by Back-tracing Model-checker Counterexamples

Electronic Notes in Theoretical Computer Science

Volumn 116, Issue SPEC.ISS., 2005, Pages 199-211

  Fantechi, A ^a   Gnesi, S ^b   Maggiore, A ^c  

^a UNIVERSITY OF FLORENCE   (Italy)

^b ISTI CNR   (Italy)

^c AltraVerifica Ltd   (United Kingdom)

Author keywords

Component based system; Compositionality; Coverability analysis; Modular; Testing

Indexed keywords

AUTOMATION; COMPUTER SIMULATION; ENCODING (SYMBOLS); LOGIC DESIGN; SYNCHRONIZATION; TESTING;

COMPONENT-BASED SYSTEM; COMPOSITIONALITY; COVERABILITY; MODULAR;

COMPUTER SYSTEMS PROGRAMMING;

EID: 15744390071     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.02.077     Document Type: Conference Paper

References (15)

1. A. Bouali, S. Gnesi, and S. Larosa The integration project for the JACK environment Bulletin of the EATCS 54 October 1994 207 223
2. M.C. Browne, and E.M. Clarke O. Grumberg: Characterizing Finite Kripke Structures in Propositional Temporal Logic Theoretical Computer Science 59 1,2 1988 115 131
3. E.M. Clarke, E.A. Emerson, and A.P. Sistla Automatic Verification of Finite State Concurrent Systems using Temporal Logic Specifications ACM Transaction on Programming Languages and Systems 8 2 1986 244 263
4. E. Clarke, O. Grumberg, K. McMillan, X. Zhao, Efficient generation of counterexamples and witnesses in symbolic model checking, 32nd design Automation Conference, DAC'95
5. E.M. Clarke, S. Jha, Y. Lu, H. Veith. Tree-like Counterexamples in Model Checking. 17th IEEE Symposium on Logic in Computer Science (LICS'2002), pp. 19-29
6. F. Copty, A. Irron, O. Weissberg, N. Kropp, and G. Kamhi Efficient Debugging in a Formal Verification Environment CHARME'01 LNCS 2144 2001 Springer-Verlag 275 292
7. R. De Nicola, and F.W. Vaandrager Actions versus State Based Logics for Transition Systems Proc. Ecole de Printemps on Semantics of Concurrency Lecture Notes in Computer Science vol. 469 1990 Springer Berlin 407 419
8. A. Fantechi, S. Gnesi, G. Ristori. Counterexample and Witness automata ISTI Technical Report, 2004
9. A. Fantechi, S. Gnesi, G. Ristori. Modelling Transition Systems within an Action Based Logic. IEI Technical Report, 1996
10. M. Glusman, G. Kamhi, S. Mador-Heim, R. Fraer, and M. Vardi Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation TACAS 2003 LNCS 2619 2003 Springer Verlag 176 191
11. A. Gurfinkel, and M. Chechik Proof-Like Counter-Examples TACAS 2003 LNCS 2619 2003 Springer Verlag 160 175
12. R. Milner Communication and Concurrency 1989 Prentice-Hall International Englewood Cliffs
13. G. Ratzaby, S. Ur, and Y. Wolfsthal Coverability Analysis Using Symbolic Model Checking CHARME 2001 LNCS 2144 2001 Springer-Verlag
14. V. Roy, R. De Simone. AUTO and Autograph, in Proceedings of the Workshop on Computer Aided Verification, LNCS 531, 65-75, 1990
15. B. Steffen, Characteristic Formulae, Proceedings 16th ICALP, Lecture Notes in Computer Science, vol. 372, pp.723-732, 1989