PARLOG: parallel programming in logic
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Negation and control in Prolog
Negation and control in Prolog
An abstract machine for restricted AND-parallel execution of logic programs
Proceedings on Third international conference on logic programming
OLD resolution with tabulation
Proceedings on Third international conference on logic programming
Abstract interpretation of Prolog programs
Proceedings on Third international conference on logic programming
Parallel execution of logic programs
Parallel execution of logic programs
An application of abstract interpretation of logic programs: occur check reduction
Proc. of the European symposium on programming on ESOP 86
3rd annual symposium on theoretical aspects of computer science on STACS 86
Automatic mode inference for logic programs
Journal of Logic Programming
A piggy-back compiler for Prolog
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Unfold/fold transformations and loop optimization of logic programs
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Specialisation of Prolog and FCP programs using abstract interpretation
New Generation Computing - Special Issue: Selected Papers from the Workshop on Partial Evaluation and Mixed
A type system for logic programs
Concurrent Prolog: collected papers
Parallel logic programming techniques
Parallel logic programming techniques
Static inference of modes and data dependencies in logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Functional computations in logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Flow analysis of dynamic logic programs
Journal of Logic Programming
Journal of Logic Programming
Pipeline optimizations in and-parallelism by abstract interpretation
Logic programming
A finite presentation theorem for approximating logic programs
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstract interpretation for concurrent logic languages
Proceedings of the 1990 North American conference on Logic programming
A simple code improvement scheme for Prolog
Journal of Logic Programming
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A precise inter-procedural data flow algorithm
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Compilation of Logic Programs for Restricted And-Parallelism
ESOP '88 Proceedings of the 2nd European Symposium on Programming
Automatic, transparent parallelization of logic programs at compile time
Automatic, transparent parallelization of logic programs at compile time
Live-structure dataflow analysis for Prolog
ACM Transactions on Programming Languages and Systems (TOPLAS)
Combinations of abstract domains for logic programming
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)
Global analysis of constraint logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel Logic Programming for Problem Solving
International Journal of Parallel Programming
| Hi-index | 0.02 |
A framework for efficient dataflow analyses of logic programs is investigated. A number of problems arise in this context: aliasing effects can make analysis computationally expensive for sequential logic programming languages; synchronization issues can complicate the analysis of parallel logic programming languages; and finiteness restrictions to guarantee termination can limit the expressive power of such analyses. Our main result is to give a simple characterization of a family of flow analyses where these issues can be ignored without compromising soundness. This results in algorithms that are simple to verify and implement, and efficient in execution. Based on this approach, we describe an efficient algorithm for flow analysis of sequential logic programs, extend this approach to handle parallel executions, and finally describe how infinite chains in the analysis domain can be accommodated without compromising termination.