An Overview of SAL

To become practical for assurance, automated formal methods must be made more scalable, automatic, and cost-effective. Such an increase in scope, scale, automation, and utility can be derived from an emphasis on a systematic separation of concerns during verification. SAL (Symbolic Analysis Laboratory) attempts to address these issues. It is a framework for combining different tools to calculate properties of concurrent systems. The heart of SAL is a language, developed in collaboration with Stanford, Berkeley, and Verimag for specifying concurrent systems in a compositional way. Our instantiation of the SAL framework augments PVS with tools for abstraction, invariant generation, program analysis (such as slicing), theorem proving, and model checking to separate concerns as well as calculate properties (i.e., perform, symbolic analysis) of concurrent systems. We. describe the motivation, the language, the tools, their integration in SAL/PAS, and some preliminary experience of their use.

[1]  Marius Bozga,et al.  IF: An Intermediate Representation and Validation Environment for Timed Asynchronous Systems , 1999, World Congress on Formal Methods.

[2]  François Bourdoncle,et al.  Efficient chaotic iteration strategies with widenings , 1993, Formal Methods in Programming and Their Applications.

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

[4]  Yassine Lakhnech,et al.  InVeST: A Tool for the Verification of Invariants , 1998, CAV.

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

[6]  Dennis Dams,et al.  Abstract interpretation and partition refinement for model checking , 1996 .

[7]  Orna Grumberg,et al.  Abstract Interpretation of Reactive Systems: Abstractions Preserving 'I1CTL *. 3CTL * and CTL * , 1994 .

[8]  Thierry Jéron,et al.  Using On-The-Fly Verification Techniques for the Generation of test Suites , 1996, CAV.

[9]  César A. Muñoz,et al.  Structural Embeddings: Mechanization with Method , 1999, World Congress on Formal Methods.

[10]  Joseph Sifakis,et al.  Property Preserving Simulations , 1992, CAV.

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

[12]  Zohar Manna,et al.  Automatic Generation of Invariants and Intermediate Assertions , 1997, Theor. Comput. Sci..

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

[14]  Yassine Lakhnech,et al.  Automatic Generation of Invariants , 1999, Formal Methods Syst. Des..

[15]  Hassen Saïdi,et al.  Powerful Techniques for the Automatic Generation of Invariants , 1996, CAV.

[16]  Alain Kerbrat,et al.  Protocol verification with the ALDÉBARAN toolset , 1997, International Journal on Software Tools for Technology Transfer.

[17]  Edmund M. Clarke,et al.  Model checking and abstraction , 1994, TOPL.

[18]  Orna Grumberg,et al.  Abstract interpretation of reactive systems : abstractions preserving .. , 1994 .

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

[20]  Natarajan,et al.  Slicing SAL , 1999 .

[21]  Conrado Daws,et al.  Verifying ET-LOTOS programmes with KRONOS , 1994, FORTE.

[22]  Victor Carreño,et al.  Analyzing Mode Confusion via Model Checking , 1999, SPIN.

[23]  H. Saidi,et al.  Modular and incremental analysis of concurrent software systems , 1999, 14th IEEE International Conference on Automated Software Engineering.

[24]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[25]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[26]  Matthew B. Dwyer,et al.  Slicing Software for Model Construction , 2000, High. Order Symb. Comput..

[27]  Yassine Lakhnech,et al.  Computing Abstractions of Infinite State Systems Compositionally and Automatically , 1998, CAV.

[28]  Natarajan Shankar,et al.  Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS , 1995, IEEE Trans. Software Eng..

[29]  Stephan Merz,et al.  Model Checking , 2000 .

[30]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[31]  A. Prasad Sistla,et al.  Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach , 1983, POPL '83.