Model Checking as Static Analysis

[1]  Flemming Nielson,et al.  Model Checking as Static Analysis: Revisited , 2012, IFM.

[2]  Flemming Nielson,et al.  Fixpoints vs Moore Families , 2012 .

[3]  Flemming Nielson,et al.  Flow Logic for Process Calculi , 2012, CSUR.

[4]  Flemming Nielson,et al.  Explicit Versus Symbolic Algorithms for Solving ALFP Constraints , 2010, Electron. Notes Theor. Comput. Sci..

[5]  Christel Baier,et al.  Principles of model checking , 2008 .

[6]  Edmund M. Clarke,et al.  The Birth of Model Checking , 2008, 25 Years of Model Checking.

[7]  Thomas W. Reps,et al.  Revamping TVLA: Making Parametric Shape Analysis Competitive , 2007, CAV.

[8]  Orna Grumberg,et al.  A game-based framework for CTL counterexamples and 3-valued abstraction-refinement , 2003, TOCL.

[9]  Valentin Goranko,et al.  Logic in Computer Science: Modelling and Reasoning About Systems , 2007, J. Log. Lang. Inf..

[10]  Patrice Godefroid,et al.  Model Checking with Multi-valued Logics , 2004, ICALP.

[11]  Wojciech Penczek,et al.  On Designated Values in Multi-valued CTL* Model Checking , 2004, Fundam. Informaticae.

[12]  Rance Cleaveland,et al.  Tableau-based model checking in the propositional mu-calculus , 1990, Acta Informatica.

[13]  Jeffrey D. Ullman,et al.  Monotone data flow analysis frameworks , 1977, Acta Informatica.

[14]  Roman Manevich,et al.  TVLA: A system for generating abstract interpreters , 2004, IFIP Congress Topical Sessions.

[15]  Radha Jagadeesan,et al.  On the Expressiveness of 3-Valued Models , 2002, VMCAI.

[16]  Flemming Nielson,et al.  A Succinct Solver for ALFP , 2002, Nord. J. Comput..

[17]  Thomas Ball,et al.  Static Program Analysis via 3-Valued Logic , 2002, APPIA-GULP-PRODE.

[18]  Radha Jagadeesan,et al.  Automatic Abstraction Using Generalized Model Checking , 2002, CAV.

[19]  Pierpaolo Degano,et al.  Flow logic for Dolev-Yao secrecy in cryptographic processes , 2002, Future Gener. Comput. Syst..

[20]  Validating "rewalls using #ow logics , 2002 .

[21]  Flemming Nielson,et al.  Flow Logic: A Multi-paradigmatic Approach to Static Analysis , 2002, The Essence of Computation.

[22]  Flemming Nielson,et al.  Data Structures in the Succinct Solver (V1.0) , 2002 .

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

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

[25]  Marsha Chechik,et al.  Model-Checking over Multi-valued Logics , 2001, FME.

[26]  C. R. Ramakrishnan,et al.  A Model Checker for Value-Passing Mu-Calculus Using Logic Programming , 2001, PADL.

[27]  Flemming Nielson,et al.  Security Analysis using Flow Logics , 2000, Bull. EATCS.

[28]  Patrice Godefroid,et al.  Generalized Model Checking: Reasoning about Partial State Spaces , 2000, CONCUR.

[29]  Shmuel Sagiv,et al.  TVLA: A System for Implementing Static Analyses , 2000, SAS.

[30]  A. Podelski.  Model Checking as Constraint Solving , 2000, SAS.

[31]  Thierry Massart,et al.  Infinite State Model Checking by Abstract Interpretation and Program Specialisation , 1999, LOPSTR.

[32]  Reinhard Wilhelm,et al.  Parametric shape analysis via 3-valued logic , 1999, POPL '99.

[33]  David A. Schmidt,et al.  Program Analysis as Model Checking of Abstract Interpretations , 1998, SAS.

[34]  Flemming Nielson,et al.  Flow Logic for Imperative Objects , 1998, MFCS.

[35]  Flemming Nielson,et al.  Flow Logics for Constraint Based Analysis , 1998, CC.

[36]  Andreas Podelski,et al.  Set-Based Analysis of Reactive Infinite-State Systems , 1998, TACAS.

[37]  David A. Schmidt.  Data flow analysis is model checking of abstract interpretations , 1998, POPL '98.

[38]  Flemming Nielson,et al.  Flow Logic and Operational Semantics , 1997, Electron. Notes Theor. Comput. Sci..

[39]  Doron A. Peled,et al.  Combining partial order reductions with on-the-fly model-checking , 1994, Formal Methods Syst. Des..

[40]  Somesh Jha,et al.  Exploiting symmetry in temporal logic model checking , 1993, Formal Methods Syst. Des..

[41]  L. C.NorrisIpDavid,et al.  Better Veri cation Through Symmetry , 1996 .

[42]  Jens Palsberg,et al.  Closure analysis in constraint form , 1995, TOPL.

[43]  Somesh Jha,et al.  An Improved Algorithm for the Evaluation of Fixpoint Expressions , 1994, Theor. Comput. Sci..

[44]  Edmund M. Clarke,et al.  Another Look at LTL Model Checking , 1994, Formal Methods Syst. Des..

[45]  Henrik Reif Andersen,et al.  Model Checking and Boolean Graphs , 1992, Theor. Comput. Sci..

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

[47]  Patrick Cousot,et al.  Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation , 1992, PLILP.

[48]  Rance Cleaveland,et al.  Faster Model Checking for the Modal Mu-Calculus , 1992, CAV.

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

[50]  Rance Cleaveland,et al.  A linear-time model-checking algorithm for the alternation-free modal mu-calculus , 1993, Formal Methods Syst. Des..

[51]  Olin Shivers,et al.  The semantics of Scheme control-flow analysis , 1991, PEPM '91.

[52]  Bernhard Steffen,et al.  Data Flow Analysis as Model Checking , 1990, TACS.

[53]  Rocco De Nicola,et al.  Action versus State based Logics for Transition Systems , 1990, Semantics of Systems of Concurrent Processes.

[54]  Patrice Godefroid,et al.  Using Partial Orders to Improve Automatic Verification Methods , 1990, CAV.

[55]  Antti Valmari,et al.  A stubborn attack on state explosion , 1990, Formal Methods Syst. Des..

[56]  David Walker,et al.  Local Model Checking in the Modal mu-Calculus , 1991, Theor. Comput. Sci..

[57]  Pierre Wolper,et al.  Verifying Properties of Large Sets of Processes with Network Invariants , 1990, Automatic Verification Methods for Finite State Systems.

[58]  Flemming Nielson,et al.  Two-Level Semantics and Abstract Interpretation , 1989, Theor. Comput. Sci..

[59]  Robert P. Kurshan,et al.  A structural induction theorem for processes , 1989, PODC.

[60]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[61]  Olin Shivers,et al.  Control flow analysis in scheme , 1988, PLDI '88.

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

[63]  Chin-Laung Lei,et al.  Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.

[64]  Edmund M. Clarke,et al.  Reasoning about networks with many identical finite-state processes , 1986, PODC '86.

[65]  Amir Pnueli,et al.  In Transition From Global to Modular Temporal Reasoning about Programs , 1989, Logics and Models of Concurrent Systems.

[66]  K. Mani Chandy,et al.  Proofs of Networks of Processes , 1981, IEEE Transactions on Software Engineering.

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

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

[69]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[70]  Edmund M. Clarke,et al.  Characterizing Correctness Properties of Parallel Programs Using Fixpoints , 1980, ICALP.

[71]  Patrick Cousot,et al.  Systematic design of program analysis frameworks , 1979, POPL.

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

[73]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .