A First-order language for expressing aliasing and type properties of logic programs

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

Volumn 1503 LNCS, Issue , 1998, Pages 184-199

  Volpe, Paolo ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

First order logic; Languages of specification; Verification of logic programs

Indexed keywords

APPLICATION PROGRAMS; BOOLEAN ALGEBRA; COMPUTABILITY AND DECIDABILITY; LOGIC PROGRAMMING; PROGRAM DEBUGGING; STATIC ANALYSIS;

ALIASING; FIRST ORDER LOGIC; FIRST ORDER THEORIES; FIRST-ORDER LANGUAGE; GROUND TERMS; LOGIC PROGRAMS; PROOF PROCEDURES;

COMPUTER CIRCUITS;

EID: 84904963539     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49727-7_11     Document Type: Conference Paper

References (19)

1. A. Bossi and N. Cocco. Verifying Correctness of Logic Programs. In J. Diaz and F. Orejas, editors, Proc. TAPSOFT'89, pages 96-110, 1989.
2. J. Boye. Directional Types in Logic Programming. PhD thesis, University of Linköping, Computer Science Department, 1997.
3. J. Boye and J. Maluszynski. Directional Types and the Annotation Method. Journal of Logic Programming, 33(3):179-220, 1997.
4. D. Cantone, E. G. Omodeo, and A. Policriti. The Automation of Syllogistic II. Optimization and Complexity Issues. Journal of Automated Reasoning, 6(2):173-187, 1990.
5. C. C. Chang and H. J. Kreisler. Model Theory. Elsevier Science Publ., 1990. Third edition.
6. K. L. Clark. Predicate logic as a computational formalism. Res. Report DOC 79/59, Imperial College, Dept. of Computing, London, 1979.
7. L. Colussi and E. Marchiori. Proving Correctness of Logic Programs Using Axiomatic Semantics. In Proc. of the Eight International Conference on Logic Programming, pages 629-644. The MIT Press, Cambridge, Mass., 1991.
8. L. Colussi and E. Marchiori. Unification as Predicate Transformer. In Proc. of the Joint International Conference and Symposium on Logic Programming, pages 67-85. The MIT Press, Cambridge, Mass., 1992.
9. A. Cortesi, G. Filè, and W. Winsborough. Prop revisited: Propositional Formula as Abstract Domain for Groundness Analysis. In Proc. Sixth IEEE Symp. on Logic In Computer Science, pages 322-327. IEEE Computer Society Press, 1991.
10. P. Dart and J. Zobel. Efficient run-time type checking of typed logic program. Journal of Logic Programming, 14(1-2):31-70, 1992.
11. P. Dart and J. Zobel. A regular type language for logic programs. In F. Pfenning, editor, Types in logic programming, pages 157-187. The MIT Press, Cambridge, Mass., 1992.
12. P. Deransart. Proof Methods of Declarative Properties of Definite Programs. Theoretical Computer Science, 118(2):99-166, 1993.
13. W. Drabent and J. Maluszynski. Inductive Assertion Method for Logic Programs. Theoretical Computer Science, 59(1):133-155, 1988.
14. D. Jacobs and A. Langen. Accurate and Efficient Approximation of Variable Aliasing in Logic Programs. In E. Lusk and R. Overbeek, editors, Proc. North American Conf. on Logic Programming'89, pages 154-165. The MIT Press, Cambridge, Mass., 1989.
15. G. Kreisel and J. L. Krivine. Elements of Mathematical Logic (Model Theory). North-Holland, Amsterdam, 1967.
16. G. Levi and P. Volpe. Derivation of Proof Methods by Abstract Interpretation. (Submitted). Available at http://www.di.unipi.it/volpep/papers. html, 1998.
17. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 1987. Second edition.
18. E. Marchiori. A Logic for Variable Aliasing in Logic Programs. In G. Levi and M. Rodriguez-Artalejo, editors, Proceedings of the 4th International Conference on Algebraic and Logic Programming (ALP'94), number 850 in LNCS, pages 287-304. Springer Verlag, 1994.
19. E. Marchiori. Design of Abstract Domains using First-order Logic. In M. Hanus and M. Rodriguez-Artalejo, editors, Proceedings of the 5th International Conference on Algebraic and Logic Programming (ALP'96), number 1139 in LNCS, pages 209-223. Springer Verlag, 1996.