Static analysis of logic programs for independent and parallelism

DOI10.1016/0743-1066(92)90034-ZMaRDI QIDQ4012712zbMATH OpenOpenAlexFDO

Authors Dean Jacobs, Anno Langen

Publication date 27 September 1992

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(92)90034-z

zbMATH Keywords

abstract interpretation of logic programsautomatically extracting independent AND parallelism from PROLOGcompilation of PROLOG clauses into control statementscondensing

Mathematics Subject Classification ID

Logic programming (68N17) Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism
• Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions
• scientific article; zbMATH DE number 4178750
• A practical framework for theabstract interpretation of logic programs
• Independent and-parallelization of logic programs using static slicing

Cited in

(35)

• S-semantics for logic programming: a retrospective look
• Non-strict independence-based program parallelization using sharing and freeness information
• AND parallelism and nondeterminism in logic programs
• The quotient of an abstract interpretation
• An abstract interpretation framework for optimizing dynamic modular logic languages
• Type dependencies for logic programs using ACI-unification
• Set-sharing is redundant for pair-sharing
• PAN: A portable, parallel Prolog: Its design, realisation and performance.
• Pair-independence and freeness analysis through linear refinement.
• Design of abstract domains using first-order logic
• scientific article; zbMATH DE number 1678390 (Why is no real title available?)
• Independent and-parallelization of logic programs using static slicing
• Independence in dynamically scheduled logic languages
• Optimality in goal-dependent analysis of Sharing
• scientific article; zbMATH DE number 4178742 (Why is no real title available?)
• On the interaction between sharing and linearity
• Compile-time derivation of variable dependency using abstract interpretation
• Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism
• Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions
• Exploiting goal independence in the analysis of logic programs
• scientific article; zbMATH DE number 2079674 (Why is no real title available?)
• Some results on the complexity of exploiting data dependency in parallel logic programs
• Annotation of logic programs for independent AND-parallelism by partial evaluation
• Abstract multiple specialization and its application to program parallelization
• A freeness and sharing analysis of logic programs based on a pre-interpretation
• The role of linearity in sharing analysis
• A general framework for static cost analysis of parallel logic programs
• Abstract conjunctive partial deduction for the analysis and compilation of coroutines
• Making abstract domains condensing
• Optimal multibinding unification for sharing and linearity analysis
• Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
• Negative Ternary Set-Sharing
• A practical framework for theabstract interpretation of logic programs
• Exploiting linearity in sharing analysis of object-oriented programs
• Finite-tree analysis for constraint logic-based languages

This page was built for publication: Static analysis of logic programs for independent and parallelism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012712)