Static Analysis

Model Checking Analyzing Fair Parametric Extended Automata . . . . . . . . . . . . . . . . . . . . . . . . 335 Ahmed Bouajjani, Aurore Collomb-Annichini, Yassine Lakhnech, Mihaela Sighireanu Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 356 Roberto Giacobazzi, Elisa Quintarelli

[1]  Kim Marriott,et al.  Precise and efficient groundness analysis for logic programs , 1993, LOPL.

[2]  Lawrence J. Henschen,et al.  What Is Automated Theorem Proving? , 1985, J. Autom. Reason..

[3]  Wolfgang Thomas,et al.  Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics , 1990 .

[4]  Agostino Cortesi,et al.  Complementation in abstract interpretation , 1997, TOPL.

[5]  Leon Sterling,et al.  The Art of Prolog , 1987, IEEE Expert.

[6]  Agostino Cortesi,et al.  Optimal Groundness Analysis Using Propositional Logic , 1996, J. Log. Program..

[7]  Michael Codish,et al.  Type Dependencies for Logic Programs Using ACI-Unification , 1996, ISTCS.

[8]  Chris Mellish,et al.  Abstract Interpretation of Prolog Programs , 1986, ICLP.

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

[10]  Ulf Nilsson,et al.  Towards a Framework for the Abstract Interpretation of Logic Programs , 1988, PLILP.

[11]  Pascal Van Hentenryck,et al.  Evaluation of the Domain Prop , 1995, J. Log. Program..

[12]  Chris Mellish,et al.  Some Global Optimizations for a Prolog Compiler , 1985, J. Log. Program..

[13]  Maurice Bruynooghe,et al.  A Practical Framework for the Abstract Interpretation of Logic Programs , 1991, J. Log. Program..

[14]  Patrick Cousot,et al.  Abstract Interpretation and Application to Logic Programs , 1992, J. Log. Program..

[15]  Michael Codish,et al.  Worst-Case Groundness Analysis Using Positive Boolean Functions , 1999, J. Log. Program..

[16]  Agostino Cortesi,et al.  Comparison of Abstract Interpretations , 1992, ICALP.

[17]  Kim Marriott,et al.  Two Classes of Boolean Functions for Dependency Analysis , 1998, Sci. Comput. Program..

[18]  Philip W. Dart.  On Derived Dependencies and Connected Databases , 1991, J. Log. Program..

[19]  Dean Jacobs,et al.  Static Analysis of Logic Programs for Independent And-Parallelism , 1992, J. Log. Program..

[20]  Roberto Giacobazzi,et al.  Intuitionistic Implication in Abstract Interpretation , 1997, PLILP.

[21]  Harald Søndergaard.  Immediate Fixpoints and Their Use in Groundness Analysis , 1996, FSTTCS.

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

[23]  Bart Demoen,et al.  Analysing Logic Programs Using 'Prop'-ositional Logic Programs and a Magic Wand , 1993, ILPS.

[24]  Manuel V. Hermenegildo,et al.  Compile-Time Derivation of Variable Dependency Using Abstract Interpretation , 1992, J. Log. Program..

[25]  Andy King,et al.  Widening Positive Boolean functions forGoal-dependent , 1998 .

[26]  Kim Marriott,et al.  Bottom-Up Dataflow Analysis of Normal Logic Programs , 1992, J. Log. Program..

[27]  Harald Søndergaard,et al.  An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction , 1986, ESOP.

[28]  Michael Codish,et al.  Derivation and Safety of an Abstract Unification Algorithm for Groundness and Aliasing Analysis , 1991, ICLP.

[29]  Lunjin Lu,et al.  Polymorphic Type Analysis in Logic Programs by Abstract Intepretation , 1998, J. Log. Program..

[30]  Francesca Scozzari.  Logical Optimality of Groundness Analysis , 1997, SAS.

[31]  Tadashi Kanamori.  Abstract Interpretation Based on Alexander Templates , 1993, J. Log. Program..

[32]  Donald Nute,et al.  Prolog Programming in Depth , 1988 .

[33]  Agostino Cortesi,et al.  Abstract Interpretation of Logic Programs: An Abstract Domain for Groundness, Sharing, Freeness and Compoundness Analysis , 1991, PEPM.

[34]  Richard A. O'Keefe.  Finite Fixed-Point Problems , 1987, ICLP.

[35]  Lunjin Lu,et al.  Abstract Interpretation, Bug Detection and Bug Diagnosis in Normal Logic Programs , 1994 .

[36]  Dean Jacobs,et al.  Accurate and Efficient Approximation of Variable Aliasing in Logic Programs , 1989, NACLP.

[37]  Roberto Bagnara,et al.  Factorizing Equivalent Variable Pairs in ROBDD-Based Implementations of Pos , 1998, AMAST.

[38]  Kim Marriott,et al.  Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation , 1994, SAS.

[39]  Bart Demoen,et al.  Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop , 1994, SAS.

[40]  Michael Codish,et al.  The Boolean Logic of Set Sharing Analysis , 1998, PLILP/ALP.

[41]  Kim Marriott,et al.  Denotational abstract interpretation of logic programs , 1994, TOPL.