“Optimal” collecting semantics for analysis in a hierarchy of logic program semantics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1046, Issue , 1996, Pages 503-514

  Giacobazzi, Roberto ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER CIRCUITS; LOGIC PROGRAMMING; MODEL CHECKING;

ABSTRACT INTERPRETATIONS; ABSTRACT MODELS; ABSTRACT SEMANTICS; EXPRESSIVE POWER; LOGIC PROGRAM SEMANTICS; LOGIC PROGRAMS;

SEMANTICS;

EID: 84947937423     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60922-9_41     Document Type: Conference Paper

References (23)

1. K. R. Apt. Introduction to logic programming. In J. van Leeuwen, ed., Handbook of Theoretical Computer Science, vol. B, pp. 495-574. Elsevier, 1990.
2. T. Armstrong, K. Marriott, P. Schachte, and H. Søndergaard. Boolean functions for dependency analysis: algebraic properties and efficient representation. In B. Le Char-lier, ed., Proc. SAS'04, LNCS 864, pp. 266-280, 1994.
3. R. Barbuti, M. Codish, R. Giacobazzi, and M. Maher. Oracle semantics for PROLOG. In Proc. ALP'92, LNCS 632, pp. 100-114, 1992. To appear in Inf. & Comp.
4. R. Barbuti, R. Giacobazzi, and G. Levi. A general framework for semantics-based bottom-up abstract interpretation of logic programs. TOPLAS, 15(1):133-181, 1993.
5. A. Bossi, M. Gabbrielli, G. Levi, and M. C. Meo. A compositional semantics for logic programs. TCS, 122(1-2):3-47, 1994.
6. A. Batarekh and V. S. Subrahmanian. Topological model set deformations. Funda-menta Informaticas, 12:357-400, 1989.
7. M. Bruynooghe. A practical framework for the abstract interpretation of logic programs. Journal of Logic Programming, 10:91-124, 1991.
8. M. Codish, D. Dams, and E. Yardeni. Bottom-up abstract interpretation of logic programs. TCS, 124(1):93-126, 1994.
9. M. Codish, S. Debray, and R. Giacobazzi. Compositional analysis of modular logic programs. In ACM POPL '93, pp. 451-464, 1993.
10. M. Comini and G. Levi. An algebraic theory of observables. In M. Bruynooghe, ed., Proc. ILPS'94, pp. 172-186, The MIT Press, 1994.
11. P. & R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In ACM POPL'77, pp. 238-252, 1977.
12. P. & R. Cousot. Systematic design of program analysis frameworks. In ACM POPL '79 pp. 269-282, 1979.
13. P. & R. Cousot. Abstract interpretation and applications to logic programs. Journal of Logic Programming, 13(2-3):103-179, 1992.
14. P. & R. Cousot. Inductive definitions, semantics and abstract interpretation. In ACM POPL '92, pp. 83-94, 1992.
15. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative modeling of the operational behavior of logic languages. TCS, 69(3):289-318, 1989.
16. M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. A model-theoretic reconstruction of the operational semantics of logic programs. Inf. & Comp., 102(1):86-113, 1993.
17. M. Gabbrielli and M. C. Meo. Fixpoint semantics for partial computed answer substitutions and call patterns. In Proc. ALP'92, LNCS 632, pp. 84-99, 1992.
18. D. Jacobs and A. Langen. Static analysis of logic programs for independent AND parallelism. Journal of Logic Programming, 13(2-3):291-314, 1992.
19. N. D. Jones and H. Søndergaard. A semantics-based framework for the abstract interpretation of Prolog. In S. Abramsky and C. Hankin, eds., Abstract Interpretation of Declarative Languages, pp. 123-142. Ellis Horwood Ltd, 1987.
20. R. Kemp and G. Ringwood. Reynolds and Heyting models of logic programs. Technical report, Dept, of Computer Science, Queen Mary and Westfield College, 1991.
21. A. Mycroft and F. Nielson. Strong abstract interpretation using power domains. In J. Diaz, ed., Proc. ICALP'83, LNCS 154, pp. 536-547. 1983.
22. B. Steffen. Optimal data flow analysis via observational equivalence. In Proc. MFCS'89, LNCS 379, pp. 492-502, 1989.
23. M. H. van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. JACM, 23(4):733-742, 1976.