Verification of meta-interpreters

Journal of Logic and Computation

Volumn 7, Issue 2, 1997, Pages 267-303

  Pedreschi, Dino ^a   Ruggieri, Salvatore ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Logic programming; Meta programming; Vanilla; Verification of logic programs

Indexed keywords

EID: 0042675691     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/7.2.267     Document Type: Article

References (31)

1. K. R. Apt and R. Bol. Logic programming and negation: a survey. Journal of Logic Programming, 19-20, 9-71, 1994.
2. K. R. Apt and D. Pedreschi. Modular termination proofs for logic and pure Prolog programs. In Advances in Logic Programming Theory, G. Levi, ed. pp. 183-229. Oxford University Press, 1994.
3. K. R. Apt. Logic programming. In Handbook of Theoretical Computer Science, Vol. B, J. van Leeuwen, ed. pp. 493-574. Elsevier, 1990.
4. K. R. Apt. Program Verification and Prolog. In Specification and Validation Methods for Programming Languages and Systems, E. Börger, ed. Oxford University Press, 1994.
5. K. R. Apt, M. Gabbrielli and D. Pedreschi. A closer look at declarative interpretations. Technical Report CS-R9470, Centre for Mathematics and Computer Science, Amsterdam, 1994. To appear in Journal of Logic Programming.
6. K. R. Apt and E. Marchiori. Reasoning about Prolog programs: from modes through types to assertions. Formal Aspects of Computing, 6A, 743-764, 1994.
7. K. R. Apt and D. Pedreschi. Studies in Pure Prolog: Termination. In Symposium on Computational Logic, J. W. Lloyd, ed. pp. 150-176. Springer-Verlag, Berlin, 1990.
8. K. R. Apt and F. Turini, eds. Meta-logics and Logic Programming. The MIT Press, 1995.
9. M. Bezem. Characterizing termination of logic programs with level mappings. In Proceedings of the North American Conference on Logic Programming, E. L. Lusk and R. A. Overbeek, eds. pp. 69-80. The MIT Press, 1989.
10. A. Bossi and N. Cocco. Verifying Correctness of Logic Programs. In TAPSOFT '89, J. Diaz and F. Orejas, eds. pp. 96-110. Vol. 352 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1989.
11. A. Bossi, N. Cocco and M. Fabris. Norms on terms and their use in proving universal termination of a logic program. Theoretical Computer Science, 124, 297-328, 1994.
12. K. A. Bowen and R. A. Kowalski. Amalgamating language and metalanguage in logic programming. In Logic Programming, K. L. Clark and S. A. Tarnlund, eds. pp. 153-173. Academic Press, 1982.
13. A. Brogi, P. Mancarella, D. Pedreschi and F. Turini. Hierarchies through basic metalevel operators. In Proceedings of the Second Workshop on Meta-programming in Logic, M. Bruynooghe, ed. pp. 381-396, 1990.
14. A. Brogi, P. Mancarella, D. Pedreschi and F. Turini. Meta for modularising logic programming. In Metaprogramming in Logic, A. Pettorossi, ed. pp. 105-119. Vol. 649 of Lecture Notes in Computer Science, Springer-Verlag, 1992.
15. A. Brogi, P. Mancarella, D. Pedreschi and F. Turini. Modular logic programming. ACM Transactions on Programming Languages and Systems, 16, 1361-1398, 1994.
16. A. Brogi and F. Turini. Semantics of meta-logic in an algebra of programs. In Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, S. Abramsky, ed. 1994.
17. A. Brogi and F. Turini. Meta-logic for program composition: semantic issues. In Meta-logics and Logic Programming, K. R. Apt and F. Turini, eds. pp. 83-110. The MIT Press, 1995.
18. K. L. Clark. Predicate logic as a computational formalism. Technical Report DOC 79/59, Imperial College, Department of Computing, 1979.
19. S. Costantini and G. A. Lanzarone. A metalogic programming approach: Language, semantics and applications. Journal of Experimental and Theoretical Computer Science, 6, 239-287, 1994.
20. P. M. Hill and J. W. Lloyd. Analysis of metaprograms. In Metaprogramming in Logic Programming, H. D. Abramson and M. H. Rogers, eds. pp. 23-52. The MIT Press, 1989.
21. Y. Jiang. Ambivalent logic as the semantic basis of metalogic programming: I. In Proceedings of the International Conference on Logic Programming, P. Van Hentenryck, ed. pp. 387-401. The MIT Press, 1994.
22. M. Kalsbeek. Correctness of the Vanilla meta-interpreter and ambivalent syntax. In Meta-logics and Logic Programming, K. R. Apt and F. Turini, eds. pp. 3-26. The MIT Press, 1995.
23. M. Kalsbeek. Personal communication. 1995.
24. M. Kalsbeek and Y. Jiang. A vademecum of ambivalent logic. In Meta-logics and Logic Programming, K. R. Apt and F. Turini, eds. pp. 27-56. The MIT Press, 1995.
25. J. W. Lloyd. Foundations of Logic Programming, 2nd edn. Springer-Verlag, Berlin, 1987.
26. B. Martens and D. De Schreye. Why untyped non-ground meta-programming is not (much of) a problem. Journal of Logic Programming, 22, 47-99, 1995.
27. D. Pedreschi and S. Ruggieri. Termination is language-independent. In Proceedings of the GULP-PRODE'94 Joint Conference on Declarative Programming. M. Alpuente et al., eds. Università Politecnica de Valencia, Valencia, 1994.
28. D. Pedreschi and S. Ruggieri. Verification of logic programs. Technical report, Dipartimento di Informatica, Università di Pisa, 1996 (to appear).
29. S. Ruggieri. Metodi formali per lo sviluppo di programmi logici. Master's thesis, Dipartimento di Informatica, Università di Pisa, 1994. Tesi di Laurea, in Italian.
30. J. Shoenfield. Mathematical Logic. Addison Wesdley, Reading, 1967.
31. L. Sterling and E. Shapiro. The Art of Prolog. The MIT Press, 1986.