Abstract
A goal-independent suspension analysis is presented that infers a class of goals for which a logic program with delays can be executed without suspension. The crucial point is that the analysis does not verify that an (abstract) goal does not lead to suspension but rather it infers abstract) goals which do not lead to suspension.
New address: Universita’ degli Studi di Verona, 37134 Verona, Italy.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
T. Armstrong, K. Marriott, P. Schachte, and H. Søndergaard. Two classes of Boolean functions for dependency analysis. Science of Computer Programming, 31(1):3–45, 1998.
M. Carlsson. Freeze, Indexing, and Other Implementation Issues in the WAM. In International Conference on Logic Programming, pages 40–58. MIT Press, 1987.
M. Codish, M. Falaschi, and K. Marriott. Suspension Analyses for Concurrent Logic Programs. Transactions on Programming Languages and Systems, 16(3):649–686, 1994.
M. Codish, M. Falaschi, K. Marriott, and W. H. Winsborough. A Confluent Semantic Basis for the Analysis of Concurrent Constraint Logic Programs. The Journal of Logic Programming, 30(1):53–81, 1997.
C. Codognet, P. Codognet, and M. Corsini. Abstract Interpretation for Concurrent Logic Languages. In North American Conference on Logic Programming, pages 215–232. MIT Press, 1990.
A. Cortesi, G. Filé, and W. H. Winsborough. Optimal Groundness Analysis Using Propositional Logic. The Journal of Logic Programming, 27(2):137–167, 1996.
P. Dart. On Derived Dependencies and Connected Databases. The Journal of Logic Programming, 11(1–2):163–188, 1991.
S. Debray, D. Gudeman, and P. Bigot. Detection and Optimization of Suspensionfree Logic Programs. Journal of Logic Programming, 29(1–3):171–194, 1992.
M. GarcÃa de la Banda, K. Marriott, and P. J. Stuckey. Efficient Analysis of Logic Programs with Dynamic Scheduling. In International Symposium on Logic Programming, pages 417–431. MIT Press, 1995.
R. Giacobazzi, S. Debray, and G. Levi. Generalized Semantics and Abstract Interpretation for Constraint Logic Programs. The Journal of Logic Programming, 25(3):191–248, 1995.
R. Giacobazzi and F. Scozzari. A Logical Model for Relational Abstract Domains. Transactions on Programming Languages and Systems, 20(5):1067–1109, 1998.
S. Hoarau and F. Mesnard. Inferring and Compiling Termination for Constraint Logic Programs. In Logic-based Program Synthesis and Transformation, volume 1559 of Lecture Notes in Computer Science, pages 240–254. Springer-Verlag, 1999.
A. King and L. Lu. A Backward Analysis for Constraint Logic Programs. Theory and Practice of Logic Programming, 2(4–5):517–547, 2002.
A. King and P. Soper. Schedule Analysis of Concurrent Logic Programs. In Joint International Conference and Symposium on Logic Programming, pages 478–492. MIT Press, 1992.
R. Kowalski. Algorithm = Logic + Control. Communications of the ACM, 22(7):424–436, 1979.
J.-L. Lassez, M. Maher, and K. Marriott. Unification Revisited. In Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, 1988.
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1993.
K. Marriott, M. GarcÃa de la Banda, and M. Hermenegildo. Analyzing Logic Programs with Dynamic Scheduling. In Principles of Programming Languages, pages 240–254. ACM Press, 1994.
F. Mesnard. Inferring Left-terminating Classes of Queries for Constraint Logic Programs by means of Approximations. In Joint International Conference and Symposium on Logic Programming, pages 7–21. MIT Press, 1996.
L. Vielle. Recursive Query Processing: The Power of Logic. Theoretical Computer Science, 69(1):1–53, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Genaim, S., King, A. (2003). Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. In: Degano, P. (eds) Programming Languages and Systems. ESOP 2003. Lecture Notes in Computer Science, vol 2618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36575-3_7
Download citation
DOI: https://doi.org/10.1007/3-540-36575-3_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00886-6
Online ISBN: 978-3-540-36575-4
eBook Packages: Springer Book Archive