FROM SIMULATION TO VERIFICATION ( AND BACK )

Symbolic evaluation is the execution of software and sof ware designs on inputs given as symbolic or explicit con stants along with constraints on these inputs. Efficient sym bolic evaluation is now feasible due to recent advances efficient decision procedures and symbolic model checkin Symbolic evaluation can be applied to partially implemente descriptions and provides wider coverage and greater ass ance than testing and traditional simulation alone. Unlik full formal verification, symbolic evaluation can be used in a partial manner that is more likely to succeed and yie some degree of assurance. Its main advantage is that it be used within a smooth spectrum of analyses ranging fro refutation based on explicit-state simulation to full-blown verification.

[1]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[2]  Harald Ruess,et al.  Lazy Theorem Proving for Bounded Model Checking over Infinite Domains , 2002, CADE.

[3]  Parosh Aziz Abdulla,et al.  Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis , 1999, CAV.

[4]  Zohar Manna,et al.  Temporal verification of reactive systems - safety , 1995 .

[5]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

[6]  L. D. Moura.  Lemmas on Demand for Satisfiability Solvers , 2002 .

[7]  Bruno Dutertre.  Formal analysis of the priority ceiling protocol , 2000, Proceedings 21st IEEE Real-Time Systems Symposium.

[8]  Thomas A. Henzinger,et al.  Reactive Modules , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[9]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[10]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[11]  César Muñoz,et al.  An Overview of SAL , 2000 .

[12]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

[13]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[14]  Natarajan Shankar,et al.  Symbolic Analysis of Transition Systems , 2000, Abstract State Machines.

[15]  Armin Biere,et al.  Bounded Model Checking Using Satisfiability Solving , 2001, Formal Methods Syst. Des..

[16]  Natarajan Shankar,et al.  Abstract and Model Check While You Prove , 1999, CAV.

[17]  Hassen Saïdi,et al.  Construction of Abstract State Graphs with PVS , 1997, CAV.

[18]  Harald Ruess,et al.  Bounded Model Checking and Induction: From Refutation to Verification (Extended Abstract, Category A) , 2003, CAV.

[19]  Gerard J. Holzmann,et al.  Designing executable abstractions , 1998, FMSP '98.

[20]  Matthew Wilding,et al.  Transforming the Theorem Prover into a Digital Design Tool: From Concept Car to Off-Road Vehicle , 1998, CAV.

[21]  J. Strother Moore,et al.  Symbolic Simulation: An ACL2 Approach , 1998, FMCAD.

[22]  Joseph Sifakis,et al.  Property preserving abstractions for the verification of concurrent systems , 1995, Formal Methods Syst. Des..

[23]  Patrice Godefroid,et al.  Symbolic Protocol Verification with Queue BDDs , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[24]  Armando Tacchella,et al.  Benefits of Bounded Model Checking at an Industrial Setting , 2001, CAV.