A Methodology for Granularity Based Control of Parallelism in Logic Programs (1996)

by Garc'ia M. Hermenegildo , S. K. Debray
Venue:Journal of Symbolic Computation, Special Issue on Parallel Symbolic Computation
Citations:61 - 35 self

Documents Related by Co-Citation

11073 Computers and Intractability: A Guide to the Theory of NP-Completeness – M R Garey, D S Johnson - 1979
64 Strict And Non-Strict Independent And-Parallelism In Logic Programs: Correctness, Efficiency, And Compile-Time Conditions – Manuel V. Hermenegildo, Francesca Rossi - 1993
118 Non-Failure Analysis for Logic Programs – Saumya Debray, Pedro López-García, Manuel Hermenegildo - 1997
63 Task Granularity Analysis in Logic Programs – Saumya K. Debray, Nai-wei Lin, Manuel Hermenegildo - 1990
72 The &-Prolog System: Exploiting Independent AndParallelism – M HERMENEGILDO, K GREENE - 1991
52 Lower Bound Cost Estimation for Logic Programs – Saumya Debray, P. López García, Manuel Hermenegildo, Garc'ia Manuel Hermenegildo, Nai-wei Lin - 1997
1919 Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fix-points – P Cousot, R Cousot - 1977
490 An abstract Prolog instruction set – D Warren - 1983
118 Compile-time Derivation of Variable Dependency Using Abstract Interpretation – K. Muthukumar, M. Hermenegildo - 1992