Set-based analysis for logic programming and tree automata

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

Volumn 1302 LNCS, Issue , 1997, Pages 127-140

  Talbot, J M ^a   Tison, S ^a   Devienne, P ^a  

^a UNIV LILLE   (France)

Author keywords

Logic programming; Set based analysis; Tree automata; Type inference

Indexed keywords

AUTOMATA THEORY; COMPUTER CIRCUITS; FORESTRY; LOGIC PROGRAMMING; SEMANTICS;

ALTERNATING TREE AUTOMATON; COMPUTATIONAL SEMANTICS; EFFICIENT IMPLEMENTATION; PROGRAM PROPERTIES; PROGRAM TRANSFORMATIONS; SET-BASED ANALYSIS; TREE AUTOMATA; TYPE INFERENCES;

STATIC ANALYSIS;

EID: 0042902829     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0032738     Document Type: Conference Paper

References (21)

1. th ACM Principles of Programming Languages Conference, pages 238-252, 1977.
2. Cusot and R. Cousot. Abstract interpretation and application to logic programs. Journal of Logic Programming, 1992.
3. P. Cousot and R. Cousot. Comparing the Galois connection and widenig/narrowing approaches to abstract interpretation. In Proc. PIPL '92. Springer-Verlag, 1992.
4. Cousot and R. Cousot. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In Conference Record of FPCA '95 - Conference on Functional Programming Languages and Computer Architecture, pages 170-181, 1995.
5. Le Charlier and P. Van Hentenryck. Experimental evaluation of a generic abstract interpretation algorithm for Prolog. In Proc. IEEE ICCL 1992, pages 138-146, 1992.
6. Deutsch. An operational model of strictness properties and its abstraction. In Proc. 1991 Glasgow University Functional Programming Workshop, pages 82-99, 1991.
7. th IEEE-LICS, pages 300-309, jun 1991.
8. J. Gallagher and D.A. de Waal. Regular approximations of logic programs and their uses. Technical Report CSTR-92-06, University of Bristol, max 1992.
9. th Int. Conf. on Logic Programming, pages 599-613. MIT-Press, 1994.
10. F. Gécseg and M. Steinby. Tree Automata. Akademiai Kiado, Budapest, 1984.
11. N. Heintze. Practical aspects of set based analysis. In Proceedings of the International Joint Conference and Symposium on Logic Programming, nov 1992.
12. N. Heintze. Set Based Program Analysis. PhD thesis, Carnegie Mellon University, sep 1992.
13. N. Heintze. Set-based analysis of ML programs. In Lisp and Functional Programming, pages 306-317. ACM, 1994.
14. th ACMPOPL, pages 197-209, jan 1990.
15. th IEEE-LICS, pages 318-328, jun 1992.
16. J. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.
17. P. Mishra. Toward a theory of types in prolog. In Proceedings of the l*4 IEEE Symposium on Logic Programming, pages 289-298, jul 1984.
18. Mycroft and R.A. O’Keefe. A polymorphic type system for prolog. Artificial Intelligence, 23:295-307, 1984.
19. th Annual ACM Symposium on the Principles of Programming Languages, pages 7-21, 1985.
20. th Int. Conf. and Symp. on Logic Programming, pages 604-619. MIT-Press, jul 1988.
21. th Int. Conf. on Logic Programming, 1987.