Improved On-the-fly Verification with Testers

We present a new memory efficient algorithm for on-the-fly verification of labelled transition systems (LTSs) with testers. To our knowledge, this is the first thoroughly presented solution for verifying all properties specifiable with testers. The algorithm requires four passes of the state space of the composition of the LTS and the tester.

[1]  Martin Peschke,et al.  Design and Validation of Computer Protocols , 2003 .

[2]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[3]  Gerard J. Holzmann,et al.  On the Verification of Temporal Properties , 1993, PSTV.

[4]  Timo Latvala,et al.  LTL Model Checking for Modular Petri Nets , 2004, ICATPN.

[5]  Jan Arne Telle,et al.  Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning , 1995, SWAT.

[6]  Pierre Wolper,et al.  Memory-efficient algorithms for the verification of temporal properties , 1990, Formal Methods Syst. Des..

[7]  Heikki Tauriainen,et al.  ON TRANSLATING LINEAR TEMPORAL LOGIC INTO ALTERNATING AND NONDETERMINISTIC AUTOMATA , 2003 .

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

[9]  Javier Esparza,et al.  A New Unfolding Approach to LTL Model Checking , 2000, ICALP.

[10]  Joc Sanders,et al.  Software quality - a framework for success in software development and support , 1994 .

[11]  Sari Leppänen,et al.  Compositional Verification of a Third Generation Mobile Communication Protocol , 2000, ICDCS Workshop on Distributed System Validation and Verification.

[12]  Pierre Wolper,et al.  Memory-efficient algorithms for the verification of temporal properties , 1990, Formal Methods Syst. Des..

[13]  Philippe Schnoebelen,et al.  The State Explosion Problem from Trace to Bisimulation Equivalence , 2000, FoSSaCS.

[14]  Timo Latvala,et al.  Coping With Strong Fairness , 2000, Fundam. Informaticae.

[15]  Lambert Spaanenburg,et al.  Embedded Systems Roadmap 2002 , 2002 .

[16]  Chin-Laung Lei,et al.  Modalities for Model Checking: Branching Time Logic Strikes Back , 1987, Sci. Comput. Program..

[17]  Orna Grumberg,et al.  Verification of Temporal Properties , 1993, J. Log. Comput..

[18]  Antti Valmari,et al.  On-the-Fly Verification with Stubborn Sets , 1993, CAV.

[19]  Mihalis Yannakakis,et al.  On nested depth first search , 1996, The Spin Verification System.

[20]  Wojciech Penczek,et al.  Stuttering-Insensitive Automata for On-the-fly Detection of Livelock Properties , 2002, Electron. Notes Theor. Comput. Sci..

[21]  Gerard J. Holzmann,et al.  Design and validation of computer protocols , 1991 .

[22]  David L. Dill,et al.  A New Scheme for Memory-Efficient Probabilistic Verification , 1996, FORTE.

[23]  Bogdan Korel,et al.  The chaining approach for software test data generation , 1996, TSEM.

[24]  David L. Dill,et al.  A New Scheme for Memory-eecient Probabilistic Veriication a New Scheme for Memory-eecient Probabilistic Veriication , 2007 .

[25]  A. Prasad Sistla,et al.  Deciding Full Branching Time Logic , 1985, Inf. Control..

[26]  Michael R. Lowry,et al.  Formal Analysis of a Space-Craft Controller Using SPIN , 2001, IEEE Trans. Software Eng..

[27]  Antti Valmari,et al.  Checking for CFFD-Preorder with Tester Processes , 2000, TACAS.