Abstract interpretation over non-deterministic finite tree automata for set-based analysis of logic programs

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

Volumn 2257, Issue , 2002, Pages 243-261

  Gallagher, John P ^a   Puebla, Germán ^b  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; AUTOMATA THEORY; COMPUTER CIRCUITS; FORESTRY; LOGIC PROGRAMMING; MODEL CHECKING; PROGRAM COMPILERS; PROGRAM DEBUGGING;

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; FINITE TREE AUTOMATON; INDEPENDENT ANALYSIS; PROGRAM ANALYSIS; REGULAR TREE GRAMMARS; SET-BASED ANALYSIS; VERIFICATION AND PLANNING;

ABSTRACTING;

EID: 84947241479     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45587-6_16     Document Type: Conference Paper

References (36)

1. A. Aiken. Set constraints: Results, applications, and future directions. In A. Borning, editor, Principles and Practice of Constraint Programming (PPCP 1994), volume 874 of Springer-Verlag Lecture Notes in Computer Science, pages 326-335. Springer Verlag, 1994.
2. A. Aiken and E. L. Wimmers. Solving systems of set constraints (extended abstract). In IEEE Symposium on Logic in Computer Science (LICS 1992), pages 329-340, 1992.
3. F. Bourdoncle. Efficient chaotic iteration strategies with widenings. In Formal Methods in Programming and their Applications, volume 735 of Springer-Verlag Lecture Notes in Computer Science, pages 123-141, 1993.
4. M. Bruynooghe, H. Vandecasteele, D. A. de Waal, and M. Denecker. Detecting unsolvable queries for definite logic programs. Journal of Functional and Logic Programming, Special Issue 2, 1999.
5. F. Bueno, D. Cabeza, M. Carro, M. Hermenegildo, P. López-García, and G. Puebla. The Ciao prolog system. reference manual. Technical Report CLIP3/97.1, School of Computer Science, Technical University of Madrid (UPM), August 1997. Available from http://www.clip.dia.fi.upm.es/.
6. F. Bueno, M. G. de la Banda, and M. Hermenegildo. Effectiveness of Abstract Interpretation in Automatic Parallelization: A Case Study in Logic Programming. ACM Transactions on Programming Languages and Systems, 21(2):189-238, March 1999.
7. W. Charatonik and A. Podelski. Directional type inference for logic programs. In G. Levi, editor, Proceedings of the International Symposium on Static Analysis (SAS’98), Pisa, September 14-16, 1998, volume 1503 of Springer LNCS, pages 278-294. Springer-Verlag, 1998.
8. W. Charatonik and A. Podelski. Set-based analysis of reactive infinite-state systems. In B. Steffen, editor, Proc. of TACAS’98, Tools and Algorithms for Construction and Analysis of Systems, 4th International Conference, TACAS’98, volume 1384 of Springer-Verlag Lecture Notes in Computer Science, 1998.
9. W. Charatonik, A. Podelski, and J.-M. Talbot. Paths vs. trees in set-based program analysis. In T. Reps, editor, Proceedings of POPL’00: Principles of Programming Languages, pages 330-338. ACM, ACM Press, January 2000.
10. M. Codish. Efficient goal directed bottom-up evaluation of logic programs. Journal of Logic Programming, 38(3):355-370, 1999.
11. M. Codish and B. Demoen. Analysing logic programs using “Prop”-ositional logic programs and a magic wand. In D. Miller, editor, Proceedings of the 1993 International Symposium on Logic Programming, Vancouver. MIT Press, 1993.
12. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. http://www.grappa.univ-lille3.fr/tata, 1999.
13. P. Cousot and R. Cousot. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In Proceedings of the Seventh ACM Conference on Functional Programming Languages and Computer Architecture, pages 170-181, La Jolla, California, 25-28 June 1995. ACM Press, New York, NY
14. D. deWaal and J. Gallagher. The applicability of logic program analysis and transformation to theorem proving. In Proceedings of the 12th International Conference on Automated Deduction (CADE-12), Nancy, 1994.
15. S. Debray and R. Ramakrishnan. Abstract Interpretation of Logic Programs Using Magic Transformations. Journal of Logic Programming, 18:149-176, 1994.
16. T. Frühwirth, E. Shapiro, M. Vardi, and E. Yardeni. Logic programs as types for logic programs. In Proceedings of the IEEE Symposium on Logic in Computer Science, Amsterdam, July 1991
17. J. Gallagher. A bottom-up analysis toolkit. In Proceedings of the Workshop on Analysis of Logic Languages (WAILL); Eilat, Israel; (also Technical Report CSTR-95-016, Department of Computer Science, University of Bristol, July 1995), June 1995.
18. J. Gallagher, D. Boulanger, and H. Sağlam. Practical model-based static analysis for definite logic programs. In J. W. Lloyd, editor, Proc. of International Logic Programming Symposium, pages 351-365, 1995.
19. J. Gallagher and D. de Waal. Fast and precise regular approximation of logic programs. In P. Van Hentenryck, editor, Proceedings of the International Conference on Logic Programming (ICLP’94), Santa Margherita Ligure, Italy. MI T Press, 1994.
20. J. P. Gallagher and J. C. Peralta. Using regular approximations for generalisation during partial evaluation. In Proceedings of the 2000 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM’2000), Boston, Mass., (ed. J. Lawall), pages 44-51. ACM Press, January 2000
21. N. Heintze. Practical aspects of set based analysis. In K. Apt, editor, Proceedings of the Joint International Symposium and Conference on Logic Programming, pages 765-769. MIT Press, 1992.
22. N. Heintze and J. Jaffar. A Finite Presentation Theorem for Approximating Logic Programs. In Proceedings of the 17th Annual ACM Symposium on Principles of Programming Languages, San Francisco, pages 197–209. ACM Press, 1990.
23. M. Hermenegildo, G. Puebla, K. Marriott, and P. Stuckey. Incremental Analysis of Constraint Logic Programs. ACM Transactions on Programming Languages and Systems, 22(2):187–223, March 2000.
24. M. V. Hermenegildo, F. Bueno, G. Puebla, and P. López. Program analysis, debugging, and optimization using the Ciao system preprocessor. In D. De Schreye, editor, Proceedings of ICLP 1999: International Conference on Logic Programming, Las Cruces, New Mexico, USA, pages 52–66. MIT Press, 1999.
25. G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. Journal of Logic Programming, 13(2-3):205–258, July 1992.
26. N. Jones. Flow analysis of lazy higher order functional programs. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages. Ellis- Horwood, 1987.
27. N. D. Jones and S. S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Conference Record of the Ninth Symposium on Principles of Programming Languages, pages 66–74. ACM Press, 1982.
28. D. Kozen. Set constraints and logic programming. Information and Computation, 143(1):2–25, 1998.
29. J. Lloyd. Foundations of Logic Programming: 2nd Edition. Springer-Verlag, 1987.
30. P. Mildner. Type Domains for Abstract Interpretation: A Critical Study. PhD thesis, Department of Computer Science, Uppsala University, 1999.
31. K. Muthukumar and M. Hermenegildo. Compile-time Derivation of Variable Dependency Using Abstract Interpretation. Journal of Logic Programming, 13(2 and 3):315–347, July 1992.
32. A. Podelski, W. Charatonik, and M. Müller. Set-based failure analysis for logic programs and concurrent constraint programs. In S. D. Swierstra, editor, Programming Languages and Systems, 8th European Symposium on Programming, ESOP’99, volume 1576 of LNCS, pages 177–192. Springer-Verlag, 1999.
33. J. C. Reynolds. Automatic construction of data set definitions. In J. Morrell, editor, Information Processing 68, pages 456–461. North-Holland, 1969.
34. P. Van Hentenryck, A. Cortesi, and B. Le Charlier. Type analysis of prolog using type graphs. Journal of Logic Programming, 22(3):179–210, 1994.
35. P. Van Roy and A. M. Despain. High-performance logic programming with the Aquarius Prolog compiler. IEEE Computer, 25(1):54–68, 1992.
36. J. Wunderwald. Memoing evaluation by source-to-source transformation. In M. Proietti, editor, Logic Program Synthesis and Transformation (LOPSTR’95), volume 1048 of Springer-Verlag Lecture Notes in Computer Science, pages 17–32, 1995.