Abstraction in Software Model Checking: Principles and Practice (Tutorial Overview and Bibliography)

This paper provides a brief description, including a bibliography, of the SPIN2002 tutorial on abstraction in model checking of software.

[1]  Joost-Pieter Katoen,et al.  A probabilistic extension of UML statecharts: Specification and Verification. , 2002 .

[2]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

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

[4]  Abraham Ginzburg,et al.  Algebraic theory of automata , 1968 .

[5]  Roberto Giacobazzi,et al.  Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking , 2001, SAS.

[6]  S. Anderson,et al.  Secure Synthesis of Code: A Process Improvement Experiment , 1999, World Congress on Formal Methods.

[7]  Radha Jagadeesan,et al.  Modal Transition Systems: A Foundation for Three-Valued Program Analysis , 2001, ESOP.

[8]  Andreas Podelski,et al.  Relative Completeness of Abstraction Refinement for Software Model Checking , 2002, TACAS.

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

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

[11]  Rance Cleaveland,et al.  Abstractions for Preserving All CTL* Formulae , 1994 .

[12]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[13]  Stephen D. Brookes,et al.  Behavioural Equivalence Relations Induced by Programming Logics , 1983, ICALP.

[14]  Karsten Stahl,et al.  Verifying Universal Properties of Parameterized Networks , 2000, FTRTFT.

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

[16]  Sriram K. Rajamani,et al.  Automatically validating temporal safety properties of interfaces , 2001, SPIN '01.

[17]  Rocco De Nicola,et al.  Three Logics for Branching Bisimulation (Extended Abstract) , 1990, LICS 1990.

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

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

[20]  R. J. van Glabbeek,et al.  Comparative Concurrency Semantics and Refinement of Actions , 1996 .

[21]  Amir Pnueli,et al.  Temporal Logic in Specification , 1987, Lecture Notes in Computer Science.

[22]  Kedar S. Namjoshi,et al.  Syntactic Program Transformations for Automatic Abstraction , 2000, CAV.

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

[24]  Robert K. Brayton,et al.  Formula-Dependent Equivalence for Compositional CTL Model Checking , 1994, CAV.

[25]  Marsha Chechik,et al.  Formal modeling in a commercial setting: A case study , 1999, J. Syst. Softw..

[26]  Amir Pnueli,et al.  Verification by Augmented Abstraction: The Automata-Theoretic View , 2001, J. Comput. Syst. Sci..

[27]  Jan van Eijck,et al.  Modal Logic, Transition Systems and Processes , 1993, J. Log. Comput..

[28]  Melvin Fitting,et al.  Many-valued modal logics , 1991, Fundam. Informaticae.

[29]  Matthew B. Dwyer,et al.  Tool-supported program abstraction for finite-state verification , 2001, Proceedings of the 23rd International Conference on Software Engineering. ICSE 2001.

[30]  Ching-tsun Chou.  A Simple Treatment of Property Preservation via Simulation , 1995 .

[31]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[32]  Edmund M. Clarke,et al.  Counterexample-Guided Abstraction Refinement , 2000, CAV.

[33]  Mieke Massink,et al.  Theoretical and Practical Aspects of SPIN Model Checking , 1999, Lecture Notes in Computer Science.

[34]  John E. Hopcroft,et al.  An n log n algorithm for minimizing states in a finite automaton , 1971 .

[35]  Gerard J. Holzmann,et al.  An Automated Verification Method for Distributed Systems Software Based on Model Extraction , 2002, IEEE Trans. Software Eng..

[36]  Nicolas Halbwachs,et al.  Minimal State Graph Generation , 1992, Science of Computer Programming.

[37]  Tomás E. Uribe,et al.  Generating Finite-State Abstractions of Reactive Systems Using Decision Procedures , 1998, CAV.

[38]  Rocco De Nicola,et al.  Extensional equivalences for transition systems , 1987, Acta Informatica.

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

[40]  Henny B. Sipma,et al.  Synthesis of Linear Ranking Functions , 2001, TACAS.

[41]  Constance L. Heitmeyer,et al.  Model Checking Complete Requirements Specifications Using Abstraction , 2004, Automated Software Engineering.

[42]  Melvin Fitting,et al.  Many-valued modal logics II , 1992 .

[43]  Joseph Sifakis,et al.  Safety for Branching Time Semantics , 1991, ICALP.

[44]  Amir Pnueli,et al.  Verifying Liveness by Augmented Abstraction , 1999, CSL.

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

[46]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[47]  Constance L. Heitmeyer,et al.  On the Need for Practical Formal Methods , 1998, FTRTFT.

[48]  Patrice Godefroid,et al.  Model Checking Partial State Spaces with 3-Valued Temporal Logics , 1999, CAV.

[49]  Radha Jagadeesan,et al.  Abstraction-Based Model Checking Using Modal Transition Systems , 2001, CONCUR.

[50]  Vlad Rusu,et al.  On Proving Safety Properties by Integrating Static Analysis, Theorem Proving and Abstraction , 1999, TACAS.

[51]  Yassine Lakhnech,et al.  Incremental Verification by Abstraction , 2001, TACAS.

[52]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[53]  Jan Friso Groote,et al.  An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence , 1990, ICALP.

[54]  Kim G. Larsen,et al.  A modal process logic , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[55]  Karsten Stahl,et al.  Divide, Abstract, and Model-Check , 1999, SPIN.

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

[57]  María-del-Mar Gallardo,et al.  A Framework for Automatic Construction of Abstract Promela Models , 1999, SPIN.

[58]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[59]  Flemming Nielson,et al.  Principles of Program Analysis , 1999, Springer Berlin Heidelberg.

[60]  Rob J. van Glabbeek,et al.  Branching Time and Abstraction in Bisimulation Semantics (Extended Abstract) , 1989, IFIP Congress.

[61]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[62]  Edmund M. Clarke,et al.  Characterizing Finite Kripke Structures in Propositional Temporal Logic , 1988, Theor. Comput. Sci..

[63]  Rocco De Nicola,et al.  Three logics for branching bisimulation , 1995, JACM.

[64]  David L. Dill,et al.  Experience with Predicate Abstraction , 1999, CAV.

[65]  Gerard J. Holzmann,et al.  From code to models , 2001, Proceedings Second International Conference on Application of Concurrency to System Design.

[66]  Klaus Havelund,et al.  Model Checking Programs , 2004, Automated Software Engineering.

[67]  Colin Stirling,et al.  Comparing Linear and Branching Time Temporal Logics , 1987, Temporal Logic in Specification.

[68]  Wojciech Penczek,et al.  Propositional Temporal Logics and Equivalences , 1992, CONCUR.

[69]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[70]  Joachim Weickert,et al.  Scale-Space Theories in Computer Vision , 1999, Lecture Notes in Computer Science.

[71]  Alberto Sangiovanni-Vincentelli,et al.  Equivalences for Fair Kripke Structures , 1994, ICALP.

[72]  Melvin Fitting,et al.  Many-Valued Non-Monotonic Modal Logics , 1992, LFCS.

[73]  Gerard J. Holzmann,et al.  Abstracting C with abC , 2002, CAV.

[74]  Marsha Chechik,et al.  Efficient Multiple-Valued Model-Checking Using Lattice Representations , 2001, CONCUR.

[75]  Joseph Sifakis,et al.  A Modal Characterization of Observational Congruence on Finite Terms of CCS , 1986, Inf. Control..

[76]  Robin Milner,et al.  An Algebraic Definition of Simulation Between Programs , 1971, IJCAI.

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