Determinacy inference for logic programs

Lecture Notes in Computer Science

Volumn 3444, Issue , 2005, Pages 108-123

  Lu, Lunjin ^a   King, Andy ^b  

^a Oakland University   (United States)

^b UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTER SOFTWARE; SOFTWARE ENGINEERING;

DETERMINACY INFERENCE ANALYSIS; LOGIC PROGRAMS; PROGRAM DEVELOPMENT;

LOGIC PROGRAMMING;

EID: 24644435130     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31987-0_9     Document Type: Conference Paper

References (22)

1. 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.
2. F. Benoy and A. King. Inferring Argument Size Relationships with CLP(R). In LOPSTR, volume 1207 of LNCS, pages 204-223. Springer-Ver lag, 1997.
3. C. Braem, B. Le Charlier, S. Modar, and P. Van Hentenryck. Cardinality Analysis of Prolog. In M. Bruynooghe, editor, ISLP, pages 457-471. MIT Press, 1994.
4. M. Bruynooghe, M. Leuschel, and K. Sagonas. A Polyvariant Binding-Time Analysis for Off-line Partial Deduction. In ESOP, volume 1381 of LNCS, pages 27-41. Springer-Ver lag, 2000.
5. S. Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, and R. C. Sekar. Extracting Determinacy in Logic Programs. In ICLP, pages 424-438. MIT Press, 1993.
6. S. K. Debray and N.-W. Lin. Cost Analysis of Logic Programs. ACM Transactions on Programming Languages and Systems, 15(5):826-875, 1993.
7. J. P. Gallagher and L. Lafave. Regular Approximation of Computation Paths in Logic and Functional Languages. In International Seminar on Partial Evaluation, volume 1110 of LNCS, pages 115-136. Springer-Verlag, 1996.
8. S. Genaim and M. Codish. Inferring Termination Conditions for Logic Programs using Backwards Analysis. TPLP, 5(1&2):75-91, 2005.
9. R. Giacobazzi, S. Debray, and G. Levi. Generalized Semantics and Abstract Interpretation for Constraint Logic Programs. JLP, 25(3): 191-248, 1995.
10. R. Giacobazzi and L. Ricci. Detecting Determinate Computation by Bottom-Up Abstract Interpretation. In ESOP, volume 582 of LNCS, pages 167-181. Springer-Verlag, 1992.
11. F. Henderson, Z. Somogyi, and T. Conway. Determinism analysis in the Mercury compiler. In Proceedings of the Australian Computer Science Conference, pages 337-346, 1996.
12. A. King and L. Lu. A Backward Analysis for Constraint Logic Programs. TPLP, 2:517-547, 2002.
13. M. Leuschel, J. Jørgensen, W. Vanhoof, and M. Bruynooghe. Offline Specialisation in Prolog Using a Hand-Written Compiler Generator. TPLP, 4(1):139-191, 2004.
14. P. López-García, F. Bueno, and M. Hermenegildo. Determinacy Analysis for Logic Programs Using Mode and Type information. In Pre-proceedings of LOPSTR, pages 19-29, 2004.
15. L. Lu and A. King. Determinacy Inference for Logic Programs. Technical Report 19-04, Computing Laboratory, University of Kent, CT2 7NF, 2004.
16. F. Mesnard and R. Bagnara. cTI: A constraint-based termination inference tool for ISO-Prolog. TPLP, 5(1&2):243-257, 2005.
17. T. Mogensen. A Semantics-Based Determinacy Analysis for Prolog with Cut. In Ershov Memorial Conference, volume 1181 of LNCS, pages 374-385. Springer-Verlag, 1996.
18. R. A. O'Keefe. The Craft of Prolog. MIT Press, 1990.
19. D. Sahlin. Determinacy Analysis for Full Prolog. In PEPM, pages 23-30, 1991.
20. SIGPLAN Notices 26(9).
21. T. Sato and H. Tamaki. Enumeration of Success Patterns in Logic Programs. Theoretical Computer Science, 34:227-240, 1984.
22. M. H. van Emden and R. A. Kowalski. The Semantics of Predicate Logic as a Programming Language. Journal of the ACM, 23(4):733-742, 1976.