Concepts, Algorithms, and Tools for Model Checking

[1]  Doron A. Peled.  Combining Partial Order Reductions with On-the-fly Model-Checking , 1994, CAV.

[2]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

[3]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract) , 1994, CAV.

[4]  Peter Liggesmeyer,et al.  Qualitätssicherung Software-basierter technischer Systeme – Problembereiche und Lösungsansätze , 1998, Informatik-Spektrum.

[5]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.

[6]  Jan Friso Groote,et al.  Checking Verifications of Protocols and Distributed Systems by Computer , 1998, CONCUR.

[7]  Thomas A. Henzinger,et al.  HYTECH: a model checker for hybrid systems , 1997, International Journal on Software Tools for Technology Transfer.

[8]  Wojciech Penczek,et al.  A partial order approach to branching time logic model checking , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[9]  Chin-Laung Lei,et al.  Modalities for model checking (extended abstract): branching time strikes back , 1985, POPL.

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

[11]  Pierre Wolper,et al.  Reliable Hashing without Collosion Detection , 1993, CAV.

[12]  Edmund M. Clarke,et al.  Verification Tools for Finite-State Concurrent Systems , 1993, REX School/Symposium.

[13]  D. Kozen.  Results on the Propositional µ-Calculus , 1982 .

[14]  Sergio Yovine,et al.  Model Checking Timed Automata , 1996, European Educational Forum: School on Embedded Systems.

[15]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

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

[17]  Ron Koymans,et al.  (Real) Time: A Philosophical Perspective , 1991, REX Workshop.

[18]  C. A. R. Hoare,et al.  An axiomatic basis for computer programming , 1969, CACM.

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

[20]  Javier Esparza.  Model Checking Using Net Unfoldings , 1994, Sci. Comput. Program..

[21]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[22]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[23]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[24]  Thomas A. Henzinger,et al.  It's About Time: Real-Time Logics Reviewed , 1998, CONCUR.

[25]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[26]  Danny Dolev,et al.  An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle , 1982, J. Algorithms.

[27]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

[28]  Amir Pnueli,et al.  The Glory of the Past , 1985, Logic of Programs.

[29]  Kenneth L. McMillan,et al.  The SMV System , 1993 .

[30]  Theo C. Ruys,et al.  The Bounded Retransmission Protocol Must Be on Time! , 1997, TACAS.

[31]  Patrice Godefroid,et al.  Partial-Order Methods for the Verification of Concurrent Systems , 1996, Lecture Notes in Computer Science.

[32]  Yaacov Choueka,et al.  Theories of Automata on omega-Tapes: A Simplified Approach , 1974, J. Comput. Syst. Sci..

[33]  David Notkin,et al.  Model checking large software specifications , 1996, SIGSOFT '96.

[34]  Reinhard Gotzhein,et al.  Temporal Logic and Applications-A Tutorial , 1992, Comput. Networks ISDN Syst..

[35]  Stavros Tripakis,et al.  Extending Promela and Spin for Real Time , 1996, TACAS.

[36]  Gerard J. Holzmann,et al.  An improvement in formal verification , 1994, FORTE.

[37]  Peter G. Harrison,et al.  Probability, Parallelism and the State Space Exploration Problem , 1998, Computer Performance Evaluation.

[38]  Thomas A. Henzinger,et al.  Real-Time Logics: Complexity and Expressiveness , 1993, Inf. Comput..

[39]  C. H. West,et al.  Applications and Limitations of Automated Protocol Validation , 1982, Protocol Specification, Testing and Verification.

[40]  Kim G. Larsen,et al.  Continuous modeling of real-time and hybrid systems: from concepts to tools , 1997, International Journal on Software Tools for Technology Transfer.

[41]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[42]  Edmund M. Clarke,et al.  Expressibility results for linear-time and branching-time logics , 1988, REX Workshop.

[43]  H. Andersen.  An Introduction to Binary Decision Diagrams , 1997 .

[44]  Edmund M. Clarke,et al.  Formal Methods: State of the Art and Future Directions Working Group Members , 1996 .

[45]  Doron A. Peled,et al.  Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator , 1997, Inf. Process. Lett..

[46]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

[47]  Doron A. Peled,et al.  Static Partial Order Reduction , 1998, TACAS.

[48]  A. Prasad Sistla,et al.  The complexity of propositional linear temporal logics , 1982, STOC '82.

[49]  Kenneth L. McMillan,et al.  A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..

[50]  Jr. Sheldon B. Akers,et al.  On a Theory of Boolean Functions , 1959 .

[51]  Pierre Wolper,et al.  Reasoning about infinite computation paths , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

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

[53]  Gerard J. Holzmann,et al.  The Theory and Practice of A Formal Method: NewCoRe , 1994, IFIP Congress.

[54]  Pierre Wolper,et al.  Simple on-the-fly automatic verification of linear temporal logic , 1995, PSTV.

[55]  Somesh Jha,et al.  Verification of the Futurebus+ cache coherence protocol , 1993, Formal Methods Syst. Des..

[56]  Mordechai Ben-Ari,et al.  The Temporal Logic of Branching Time , 1981, POPL.

[57]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[58]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[59]  Gerard J. Holzmann,et al.  State-space caching revisited , 1995, Formal Methods Syst. Des..

[60]  Sergio Yovine,et al.  KRONOS: a verification tool for real-time systems , 1997, International Journal on Software Tools for Technology Transfer.

[61]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[62]  Krzysztof R. Apt,et al.  Limits for Automatic Verification of Finite-State Concurrent Systems , 1986, Inf. Process. Lett..

[63]  Gerard J. Holzmann,et al.  Design and Validation of Protocols: A Tutorial , 1993, Comput. Networks ISDN Syst..

[64]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[65]  Leslie Lamport,et al.  What Good is Temporal Logic? , 1983, IFIP Congress.

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

[67]  Thomas A. Henzinger,et al.  Back to the future: towards a theory of timed regular languages , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[68]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.