"Optimal" Collecting Semantics for Analysis in a Hierarchy of Logic Program Semantics

No abstract is available for this paper.

• Publication year

  1996

• Venue

  Symposium on Theoretical Aspects of Computer Science

• Publication date

  1996-02-22

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/3-540-60922-9_41
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Reynold and Heyling Models of Logic Programs

  1994cited by this paper
• Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation

  1994cited by this paper
• An Algebraic Theory of Observables

  1994cited by this paper
• A Compositional Semantics for Logic Programs

  1994cited by this paper
• A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs

  1993cited by this paper
• Compositional analysis of modular logic programs

  1993cited by this paper
• A general framework for semantics-based bottom-up abstract interpretation of logic programs

  1993cited by this paper
• Fixpoint Semantics for Partial Computed Answer Substitutions and Call Patterns

  1992cited by this paper
• Oracle Semantics for Prolog

  1992cited by this paper
• Abstract Interpretation and Application to Logic Programs

  1992cited by this paper
• Inductive definitions, semantics and abstract interpretations

  1992cited by this paper
• Static Analysis of Logic Programs for Independent And-Parallelism

  1992cited by this paper
• A Practical Framework for the Abstract Interpretation of Logic Programs

  1991cited by this paper
• Optimal Data Flow Analysis via Observational Equivalence

  1989cited by this paper
• Declarative Modeling of the Operational Behavior of Logic Languages

  1989influential reference
• Bottom-up Abstract Interpretation of Logic Programs

  1988influential reference
• Introduction to Logic Programming

  1988cited by this paper
• Strong Abstract Interpretation Using Power Domains (Extended Abstract)

  1983cited by this paper
• Systematic design of program analysis frameworks

  1979influential reference
• Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

  1977influential reference
• The Semantics of Predicate Logic as a Programming Language

  1976cited by this paper

• C URRICULUM V ITÆ

  2021cites this paper
• On collecting semantics for program analysis

  2020influential citation
• A Taxonomy of Program Analyses

  2018cites this paper
• A Formal Model Of SystemC Components Using Fractal Hypergraphs

  2010cites this paper
• Abstract interpretation of resolution-based semantics

  2009cites this paper
• Functional Compositions of Abstract InterpretationsRoberto

  2007influential citation
• Control code obfuscation by abstract interpretation

  2005cites this paper
• Transforming semantics by abstract interpretation

  2005cites this paper
• The reduced relative power operation

  2003cites this paper
• Abstract interpretation based verification of logic programs

  2003cites this paper
• An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations

  2003cites this paper
• Making abstract domains condensing

  2002cites this paper
• Compositionality in the puzzle of semantics

  2002cites this paper
• A semantics for logic programs based on hereditary harrop formulas

  2002cites this paper
• A Theory of Observables for Logic Programs

  2001cites this paper
• Abstract Interpretation Based Formal Methods and Future Challenges

  2001cites this paper
• Progress on Abstract Interpretation Based Formal Methods and Future Challenges

  2000cites this paper
• Making abstract interpretations complete

  2000cites this paper
• Abstract Domains for Sharing Analysis by Optimal Semantics

  2000cites this paper
• A characterization of symmetric semantics by domain complementation

  2000cites this paper
• The Reduced Relative Power Operation on Abstract Domains

  1999cites this paper
• Analysis of Normal Logic Programs

  1998cites this paper
• Uniform Closures: Order-Theoretically Reconstructing Logic Program Semantics and Abstract Domain Refinements

  1998influential citation
• Building Complete Abstract Interpretations in a Linear Logic-based Setting

  1998cites this paper
• Completeness in Abstract Interpretation: A Domain Perspective

  1997cites this paper
• Complementation in Abstract Interpretation

  1997influential citation
• Complementation in Abstract Interpretation

  1997influential citation
• Properties of the Lattice of Observables in Logic Programming

  1997cites this paper
• Refining and Compressing Abstract Domains

  1997cites this paper
• Analysis of normal CLP programs

  1997cites this paper
• Logical optimality of groundness analysis

  1997cites this paper
• Making Abstract Interpretations CompleteRoberto

  1997cites this paper
• A Hierarchy of Semantics for Normal Constraint Logic Programs

  1996cites this paper
• Complementing Logic Program Semantics

  1996cites this paper
• Completeness in Abstract Interpretation

  1995cites this paper
• Complementation in abstract interpretation

  1995cites this paper
• Generalized Semantics and Abstract Interpretation for Constraint Logic Programs

  1995cites this paper
• Abductive Analysis of Modular Logic Programs

  1994cites this paper