A Succinct Approach to Static Analysis and Model Checking

[1]  Flemming Nielson,et al.  Layered fixed point logic , 2012, PPDP.

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

[3]  Flemming Nielson,et al.  Model Checking Is Static Analysis of Modal Logic , 2010, FoSSaCS.

[4]  Jean Rohmer,et al.  The Alexander Method — A technique for the processing of recursive axioms in deductive databases , 1986, New Generation Computing.

[5]  Ondrej Lhoták,et al.  Evaluating the benefits of context-sensitive points-to analysis using a BDD-based implementation , 2008, TSEM.

[6]  Monica S. Lam,et al.  Using Datalog with Binary Decision Diagrams for Program Analysis , 2005, APLAS.

[7]  Manu Sridharan,et al.  Demand-driven points-to analysis for Java , 2005, OOPSLA '05.

[8]  Benjamin Livshits,et al.  Context-sensitive program analysis as database queries , 2005, PODS.

[9]  Monica S. Lam,et al.  Cloning-based context-sensitive pointer alias analysis using binary decision diagrams , 2004, PLDI '04.

[10]  Flemming Nielson,et al.  The Succinct Solver Suite , 2004, TACAS.

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

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

[13]  David A. McAllester.  On the complexity analysis of static analyses , 1999, JACM.

[14]  Roland H. C. Yap,et al.  Making AC-3 an Optimal Algorithm , 2001, IJCAI.

[15]  C. R. Ramakrishnan,et al.  XMC: A Logic-Programming-Based Verification Toolset , 2000, CAV.

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

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

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

[19]  Helmut Seidl,et al.  Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems , 1998, Nord. J. Comput..

[20]  Thomas W. Reps,et al.  Program analysis via graph reachability , 1997, Inf. Softw. Technol..

[21]  C. R. Ramakrishnan,et al.  Efficient Model Checking Using Tabled Resolution , 1997, CAV.

[22]  Richard J. Wallace,et al.  Why AC-3 is Almost Always Better than AC4 for Establishing Arc Consistency in CSPs , 1993, IJCAI.

[23]  Thomas W. Reps,et al.  Demand Interprocedural Program Analysis Using Logic Databases , 1993, Workshop on Programming with Logic Databases , ILPS.

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

[25]  Jeffrey D. Ullman,et al.  Bottom-up beats top-down for datalog , 1989, PODS '89.

[26]  Carlo Zaniolo,et al.  Implementation of Recursive Queries for a Data Language Based on Pure Horn Logic , 1987, ICLP.

[27]  Jeffrey D. Ullman,et al.  Implementation of logical query languages for databases , 1985, TODS.

[28]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[29]  Jack Minker,et al.  Logic and Databases: A Deductive Approach , 1984, CSUR.

[30]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[31]  Gary A. Kildall,et al.  A unified approach to global program optimization , 1973, POPL.

[32]  Edsger W. Dijkstra,et al.  The humble programmer , 1972, CACM.

[33]  G. S. Graham.  A New Solution of Dijkstra ' s Concurrent Programming Problem , 2022 .