A Logical Reconstruction of Reachability

In this paper we discuss reachability analysis for infinite-state systems. Infinite-state systems are formalized using transition systems over a first-order structure. We establish a common ground relating a large class of algorithms by analyzing the connections between the symbolic representation of transition systems and formulas used in various reachability algorithms. Our main results are related to the so-called guarded assignment systems.

[1]  Andreas Podelski.  Model Checking as Constraint Solving , 2000, SAS.

[2]  Ugo Montanari,et al.  International Symposium on Programming , 1982, Lecture Notes in Computer Science.

[3]  Parosh Aziz Abdulla,et al.  Algorithmic Analysis of Programs with Well Quasi-ordered Domains , 2000, Inf. Comput..

[4]  Andrei Voronkov,et al.  Using Canonical Representations of Solutions to Speed Up Infinite-State Model Checking , 2002, CAV.

[5]  Alain Finkel,et al.  On the verification of broadcast protocols , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[6]  Tevfik Bultan,et al.  A Library for Composite Symbolic Representations , 2001, TACAS.

[7]  Amir Pnueli,et al.  Symbolic model checking with rich assertional languages , 2001, Theor. Comput. Sci..

[8]  Richard Gerber,et al.  Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results , 1999, TOPL.

[9]  Z. Manna,et al.  Integrating decision procedures for temporal verification , 1998 .

[10]  Giorgio Delzanno,et al.  Constraint-based deductive model checking , 2001, International Journal on Software Tools for Technology Transfer.

[11]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[12]  C. Rattray,et al.  Specification and Verification of Concurrent Systems , 1990, Workshops in Computing.

[13]  David Scott Warren,et al.  Memoing for logic programs , 1992, CACM.

[14]  Giorgio Delzanno.  Automatic Verification of Parameterized Cache Coherence Protocols , 2000, CAV.

[15]  Gerardo Lafferriere,et al.  Symbolic Reachability Computation for Families of Linear Vector Fields , 2001, J. Symb. Comput..

[16]  Parosh Aziz Abdulla,et al.  Ensuring completeness of symbolic verification methods for infinite-state systems , 2001, Theor. Comput. Sci..

[17]  William Pugh,et al.  Counting solutions to Presburger formulas: how and why , 1994, PLDI '94.

[18]  Manfred Broy,et al.  Proceedings of The 1998 ARO/ONR/NSF/DARPA Monterey Workshop on Engineering Automation for Computer Based Systems Held in Carmel, California on October 23-26, 1998. , 1999 .

[19]  Edmund M. Clarke,et al.  Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..

[20]  Orna Kupferman,et al.  Model Checking of Safety Properties , 1999, Formal Methods Syst. Des..

[21]  Gabriel M. Kuper,et al.  Constraint Query Languages , 1995, J. Comput. Syst. Sci..

[22]  Thomas A. Henzinger,et al.  A Classification of Symbolic Transition Systems , 2000, STACS.

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