Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
From MaRDI portal
Publication:5504598
DOI10.1007/978-3-540-78769-3_10zbMath1179.68022OpenAlexW2153534748MaRDI QIDQ5504598
Manuel V. Hermenegildo, Manuel Carro, Amadeo Casas
Publication date: 22 January 2009
Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)
Full work available at URL: http://oa.upm.es/14322/
Related Items
Parallel Logic Programming: A Sequel ⋮ Non-strict independence-based program parallelization using sharing and freeness information ⋮ Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs ⋮ A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
Uses Software
Cites Work
- Unnamed Item
- Parallelizing irregular and pointer-based computations automatically: Perspectives from logic and constraint programming
- Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
- A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems
- 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
- Overview of DASWAM: Exploitation of dependent and-parallelism
- Using Combined Static Analysis and Profiling for Logic Program Execution Time Estimation
- Determinacy Analysis for Logic Programs Using Mode and Type Information
- Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
- A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
