25 Years of Model Checking - History, Achievements, Perspectives

Model checking technology is among the foremost applications of logic to computer science and computer engineering. The model checking community has achieved many breakthroughs, bridging the gap between theoretical computer science and hardware and software engineering, and it is reaching out to new challenging areas such as system biology and hybrid systems. Model checking is extensively used in the hardware industry and has also been applied to the verification of many types of software. Model checking has been introduced into computer science and electrical engineering curricula at universities worldwide and has become a universal tool for the analysis of systems. This Festschrift volume, published in celebration of the 25th Anniversary of Model Checking, includes a collection of 11 invited papers based on talks at the symposium "25 Years of Model Checking", 25MC, which was part of the 18th International Conference on Computer Aided Verification (CAV 2006), which in turn was part of the Federated Logic Conference (FLoC 2006) held in Seattle, WA, USA, in August 2006. Model checking is currently attracting considerable attention beyond the core technical community, and the ACM Turing Award 2007 was given in recognition of the paradigm-shifting work on this topic initiated a quarter century ago. Here we honor that achievement with the inclusion of facsimile reprints of the visionary papers on model checking by Edmund Clarke and Allen Emerson, and by Jean-Pierre Queille and Joseph Sifakis.

[1]  John Lygeros,et al.  Reachability Analysis for Controlled Discrete Time Stochastic Hybrid Systems , 2006, HSCC.

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

[3]  Sandeep K. Shukla,et al.  A New Heuristic for Bad Cycle Detection Using BDDs , 1997, Formal Methods Syst. Des..

[4]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[5]  L. Arnold.  Stochastic Differential Equations: Theory and Applications , 1992 .

[6]  Kavita Ravi,et al.  Efficient Decision Procedures for Model Checking of Linear Time Logic Properties , 1999, CAV.

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

[8]  Marta Z. Kwiatkowska,et al.  Game-based Abstraction for Markov Decision Processes , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[9]  Mary Sheeran,et al.  Checking Safety Properties Using Induction and a SAT-Solver , 2000, FMCAD.

[10]  R. Bellman.  A Markovian Decision Process , 1957 .

[11]  Håkan L. S. Younes.  Ymer: A Statistical Model Checker , 2005, CAV.

[12]  John Lygeros,et al.  Stochastic hybrid systems: Theory and safety critical applications , 2006 .

[13]  Antti Valmari,et al.  Stubborn sets for reduced state space generation , 1991, Applications and Theory of Petri Nets.

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

[15]  Moshe Y. Vardi,et al.  Symbolic Systems, Explicit Properties: On Hybrid Approaches for LTL Symbolic Model Checking , 2005, CAV.

[16]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[17]  Xenofon D. Koutsoukos,et al.  Modeling and Simulation of Biochemical Processes Using Stochastic Hybrid Systems: The Sugar Cataract Development Process , 2008, HSCC.

[18]  John Lygeros,et al.  Towars a Theory of Stochastic Hybrid Systems , 2000, HSCC.

[19]  Lijun Zhang,et al.  Best Probabilistic Transformers , 2010, VMCAI.

[20]  Somesh Jha,et al.  Model Checking for Security Protocols , 1997 .

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

[22]  Bernd Becker,et al.  Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking , 2009, VMCAI.

[23]  Edmund M. Clarke,et al.  Symbolic Model Checking with Partitioned Transistion Relations , 1991, VLSI.

[24]  Martin Fränzle,et al.  Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems , 2008, HSCC.

[25]  Sriram K. Rajamani,et al.  The SLAM Toolkit , 2001, CAV.

[26]  Kenneth L. McMillan,et al.  Interpolation and SAT-Based Model Checking , 2003, CAV.

[27]  Kenneth L. McMillan,et al.  Applying SAT Methods in Unbounded Symbolic Model Checking , 2002, CAV.

[28]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[29]  S. Shankar Sastry,et al.  Probabilistic reachability for stochastic hybrid systems: theory, computations, and applications , 2007 .

[30]  Joost-Pieter Katoen,et al.  A Markov reward model checker , 2005, Second International Conference on the Quantitative Evaluation of Systems (QEST'05).

[31]  Goran Frehse.  PHAVer: Algorithmic Verification of Hybrid Systems Past HyTech , 2005, HSCC.

[32]  Jeremy Sproston.  Decidable Model Checking of Probabilistic Hybrid Automata , 2000, FTRTFT.

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

[34]  Fausto Giunchiglia,et al.  NUSMV: a new symbolic model checker , 2000, International Journal on Software Tools for Technology Transfer.

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

[36]  Doron A. Peled,et al.  All from One, One for All: on Model Checking Using Representatives , 1993, CAV.