Denotational semantics: a methodology for language development
Denotational semantics: a methodology for language development
OLD resolution with tabulation
Proceedings on Third international conference on logic programming
An application of abstract interpretation of logic programs: occur check reduction
Proc. of the European symposium on programming on ESOP 86
Abstract interpretation of declarative languages
Abstract interpretation of declarative languages
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Strictness analysis and denotational abstract interpretation
Information and Computation
Denotational and operational semantics for Prolog
Journal of Logic Programming
Efficient dataflow analysis of logic programs
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Two-level semantics and abstract interpretation
Theoretical Computer Science
A practical framework for the abstract interpretation of logic programs
Journal of Logic Programming
On derived dependencies and connected databases
Journal of Logic Programming
Analysis of constraint logic programs
Proceedings of the 1990 North American conference on Logic programming
A characterization of non-floundering logic programs
Proceedings of the 1990 North American conference on Logic programming
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Abstract interpretation and application to logic programs
Journal of Logic Programming
Bottom-up dataflow analysis of normal logic programs
Journal of Logic Programming
Deriving descriptions of possible values of program variables by means of abstract interpretation
Journal of Logic Programming
Static analysis of logic programs for independent and parallelism
Journal of Logic Programming
Global flow analysis as a practical compilation tool
Journal of Logic Programming
Frameworks for abstract interpretation
Acta Informatica
Groundness analysis for Prolog: implementation and evaluation of domain prop
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Abstract interpretation based on OLDT resolution
Journal of Logic Programming
Abstract interpretation based on Alexander templates
Journal of Logic Programming
The 3 R's of optimizing constraint logic programs: refinement, removal and reordering
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Precise and efficient groundness analysis for logic programs
ACM Letters on Programming Languages and Systems (LOPLAS)
Analysing logic programs using “prop”-ositional logic programs and a magic wand
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
Data flow analysis of applicative programs using minimal function graphs
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Flow Analysis of Computer Programs
Flow Analysis of Computer Programs
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Flow Analysis of Lambda Expressions (Preliminary Version)
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Calculating properties of programs by valuations on specific models
Proceedings of ACM conference on Proving assertions about programs
Source-level transforms for multiple specialization of horn clauses (extended abstract)
Source-level transforms for multiple specialization of horn clauses (extended abstract)
Global optimization of logic programs (analysis, transformation, compilation)
Global optimization of logic programs (analysis, transformation, compilation)
Automatic, transparent parallelization of logic programs at compile time
Automatic, transparent parallelization of logic programs at compile time
Precise and efficient groundness analysis for logic programs
ACM Letters on Programming Languages and Systems (LOPLAS)
Analyzing logic programs with dynamic scheduling
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the complexity of dataflow analysis of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementation of multiple specialization in logic programs
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Clock analysis of synchronous dataflow programs
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Abstract Interpretation for Termination Analysis in Functional Active Databases
Journal of Intelligent Information Systems - Special issue on functional approach to intelligent information systems
Sharing and groundness dependencies in logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Making abstract interpretations complete
Journal of the ACM (JACM)
Incremental analysis of constraint logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A precise type analysis of logic programs
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Path dependent analysis of logic programs
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Logical optimality of groundness analysis
Theoretical Computer Science
Using Static Analysis to Compile Non-sequential Functional Logic Programs
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
Parameterizing a Groundness Analysis of Logic Programs
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
An Abstract Interpretation Framework for Termination Analysis of Active Rules
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Optimising Active Database Rules by Partial Evaluation and Abstract Interpretation
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Precise goal-independent abstract interpretation of constraint logic programs
Theoretical Computer Science
The essence of computation
Path Dependent Analysis of Logic Programs
Higher-Order and Symbolic Computation
Making abstract domains condensing
ACM Transactions on Computational Logic (TOCL)
Abstraction carrying code and resource-awareness
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Abstract interpretation for constraint handling rules
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Type inference for datalog and its application to query optimisation
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the algebraic structure of declarative programming languages
Theoretical Computer Science
Optimality in goal-dependent analysis of sharing
Theory and Practice of Logic Programming
Type inference for datalog with complex type hierarchies
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A general framework for variable aliasing: towards optimal operators for sharing properties
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Playing logic programs with the alpha-beta algorithm
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Random: r-based analyzer for numerical domains
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Hi-index | 0.00 |
Logic-programming languages are based on a principle of separation “logic” and “control.”. This means that they can be given simple model-theoretic semantics without regard to any particular execution mechanism (or proof procedure, viewing execution as theorem proving). Although the separation is desirable from a semantical point of view, it makes sound, efficient implementation of logic-programming languages difficult. The lack of “control information” in programs calls for complex data-flow analysis techniques to guide execution. Since data-flow analysis furthermore finds extensive use in error-finding and transformation tools, there is a need for a simple and powerful theory of data-flow analysis of logic programs.This paper offers such a theory, based on F. Nielson's extension of P. Cousot and R. Cousot's abstract interpretation. We present a denotational definition of the semantics of definite logic programs. This definition is of interest in its own right because of its compactness. Stepwise we develop the definition into a generic data-flow analysis that encompasses a large class of data-flow analyses based on the SLD execution model. We exemplify one instance of the definition by developing a provably correct groundness analysis to predict how variables may be bound to ground terms during execution. We also discuss implementation issues and related work.