Computing Abstractions of Infinite State Systems Compositionally and Automatically

We present a method for computing abstractions of infinite state systems compositionally and automatically. Given a concrete system S = S 1 ||... || S n of programs and given an abstraction function a, using our method one can compute an abstract system S a = S 1 a || ... || S n a such that S simulates S a . A distinguishing feature of our method is that it does not produce a single abstract state graph but rather preserves the structure of the concrete system. This feature is a prerequisite to benefit from the techniques developed in the context of model-checking for mitigating the state explosion. Moreover, our method has the advantage that the process of constructing the abstract system does not depend on whether the computation model is synchronous or asynchronous.

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

[2]  Tobias Nipkow,et al.  Combining Model Checking and Deduction for I/O-Automata , 1995, TACAS.

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

[4]  David L. Dill,et al.  Automatic Generation of Invariants in Processor Verification , 1996, FMCAD.

[5]  Pierre Wolper,et al.  Expressing interesting properties of programs in propositional temporal logic , 1986, POPL '86.

[6]  Frits W. Vaandrager,et al.  Proof-Checking a Data Link Protocol , 1994, TYPES.

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

[8]  Keith A. Bartlett,et al.  A note on reliable full-duplex transmission over half-duplex links , 1969, Commun. ACM.

[9]  Robert P. Kurshan,et al.  Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach , 2014 .

[10]  Hergen Pargmann,et al.  Model Checking Using Adaptive State and Data Abstraction , 1994, CAV.

[11]  Susanne Graf,et al.  Characterization of a sequentially consistent memory and verification of a cache memory by abstraction , 1999, Distributed Computing.

[12]  Zohar Manna,et al.  Temporal Verification of Reactive Systems , 1995, Springer New York.

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

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

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

[16]  Natarajan Shankar,et al.  Experiments in Theorem Proving and Model Checking for Protocol Verification , 1996, FME.

[17]  Claire Loiseaux,et al.  A Tool for Symbolic Program Verification and Abstration , 1993, CAV.

[18]  Jürgen Dingel,et al.  Model Checking for Infinite State Systems Using Data Abstraction, Assumption-Commitment Style reasoning and Theorem Proving , 1995, CAV.

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

[20]  Zohar Manna,et al.  Completing the Temporal Picture , 1989, Theor. Comput. Sci..

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

[22]  Orna Grumberg,et al.  Generation of Reduced Models for Checking Fragments of CTL , 1993, CAV.

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

[24]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

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

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

[27]  Orna Grumberg,et al.  Abstract interpretation of reactive systems , 1997, TOPL.