Static analysis of logic programs for independent and parallelism

DOI10.1016/0743-1066(92)90034-ZzbMath0776.68026OpenAlexW2001265243MaRDI QIDQ4012712

Anno Langen, Dean Jacobs

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

condensingabstract interpretation of logic programsautomatically extracting independent AND parallelism from PROLOGcompilation of PROLOG clauses into control statements

Mathematics Subject Classification ID

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

Related Items (16)

Pair-independence and freeness analysis through linear refinement. ⋮ The role of linearity in sharing analysis ⋮ Optimality in goal-dependent analysis of Sharing ⋮ The quotient of an abstract interpretation ⋮ Design of abstract domains using first-order logic ⋮ Optimal multibinding unification for sharing and linearity analysis ⋮ Exploiting linearity in sharing analysis of object-oriented programs ⋮ On the interaction between sharing and linearity ⋮ S-semantics for logic programming: a retrospective look ⋮ Non-strict independence-based program parallelization using sharing and freeness information ⋮ Type dependencies for logic programs using ACI-unification ⋮ Negative Ternary Set-Sharing ⋮ PAN: A portable, parallel Prolog: Its design, realisation and performance. ⋮ Set-sharing is redundant for pair-sharing ⋮ A freeness and sharing analysis of logic programs based on a pre-interpretation ⋮ Finite-tree analysis for constraint logic-based languages

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