A polymorphic type system for PROLOG.
Artificial Intelligence
Properties of substitutions and unifications
Journal of Symbolic Computation
An abstract machine for restricted AND-parallel execution of logic programs
Proceedings on Third international conference on logic programming
Efficient management of backtracking in AND-parallelism
Proceedings on Third international conference on logic programming
Proceedings of the international conference on Mathematical foundations of programming semantics
Galois connections and computer science applications
Proceedings of a tutorial and workshop on Category theory and computer 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.)
Automatic mode inference for logic programs
Journal of Logic Programming
Specialisation of Prolog and FCP programs using abstract interpretation
New Generation Computing - Special Issue: Selected Papers from the Workshop on Partial Evaluation and Mixed
Polymorphic type inference in Prolog by abstract interpretation
Proceedings of the 6th Conference on Logic programming '87
Foundations of deductive databases and logic programming
Equivalences of logic programs
Foundations of deductive databases and logic programming
Improving the execution speed of compiled prolog with modes, clause selection, and determinism
II and Colloquium on Functional and Logic Programming and Specifications (CFLP) on TAPSOFT '87: Advanced Seminar on Foundations of Innovative Software Development
Efficient dataflow analysis of logic programs
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
Pipeline optimizations in and-parallelism by abstract interpretation
Logic programming
On the semantics of logic programs
Proceedings of the 18th international colloquium on Automata, languages and programming
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
An algebraic framework for abstract interpretation of definite programs
Proceedings of the 1990 North American conference on Logic programming
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Detecting determinate computations by bottom-up abstract interpretation
ESOP'92 Symposium proceedings on 4th European symposium on programming
Bottom-up abstract interpretation of logic programs
Theoretical Computer Science
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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
Improving abstract interpretations by combining domains
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Compositional analysis of modular logic programs
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Experimental evaluation of a generic abstract interpretation algorithm for PROLOG
ACM Transactions on Programming Languages and Systems (TOPLAS)
Improving abstract interpretations by combining domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
A logical model for relational abstract domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Making abstract interpretations complete
Journal of the ACM (JACM)
Path dependent analysis of logic programs
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Indexed Categories and Bottom-Up Semantics of Logic Programs
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Abstract Interpretation Based Formal Methods and Future Challenges
Informatics - 10 Years Back. 10 Years Ahead.
A new framework for declarative programming
Theoretical Computer Science
Meta-circular abstract interpretation in prolog
The essence of computation
Path Dependent Analysis of Logic Programs
Higher-Order and Symbolic Computation
Sequence-based abstract interpretation of Prolog
Theory and Practice of Logic Programming
Making abstract domains condensing
ACM Transactions on Computational Logic (TOCL)
Control Generation by Program Transformation
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
Improving precision of type analysis using non-discriminative union
Theory and Practice of Logic Programming
Inferring non-suspension conditions for logic programs with dynamic scheduling
ACM Transactions on Computational Logic (TOCL)
Test frame updating in CPM testing of Prolog programs
Software Quality Control
On the algebraic structure of declarative programming languages
Theoretical Computer Science
S-semantics for logic programming: A retrospective look
Theoretical Computer Science
A fixed point semantics for logic programs extended with cuts
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
A compact fixpoint semantics for term rewriting systems
Theoretical Computer Science
Theoretical foundations and semantics of logic programming
A 25-year perspective on logic programming
Control Generation by Program Transformation
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
Proofs you can believe in: proving equivalences between Prolog semantics in Coq
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
The theory of abstract interpretation provides a formal framework to develop advanced dataflow analysis tools. The idea is to define a nonstandard semantics which is able to compute, in finite time, an approximated model of the program. In this paper, we define an abstract interpretation framework based on a fixpoint approach to the semantics. This leads to the definition, by means of a suitable set of operators, of an abstract fixpoint characterization of a model associated with the program. Thus, we obtain a specializable abstract framework for bottom-up abstract interpretations of definite logic programs. The specialization of the framework is shown on two examples, namely, gound-dependence analysis and depth-k analysis.