Constrained regular approximation of logic programs

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

Volumn 1463, Issue , 1998, Pages 282-299

  Sağlam, Hüseyin ^a   Gallagher, John P ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Convex polyhedra; Linear constraints; Regular approximation

Indexed keywords

COMPUTER CIRCUITS; FORMAL LOGIC; GEOMETRY;

ANALYSIS TECHNIQUES; ARITHMETIC CONSTRAINTS; CONSTRAINT SOLVING; CONVEX POLYHEDRONS; LINEAR CONSTRAINTS; LOGIC PROGRAMS; REGULAR APPROXIMATION; TYPE ANALYSIS;

LOGIC PROGRAMMING;

EID: 84947938813     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49674-2_15     Document Type: Conference Paper

References (21)

1. th International Workshop on Logic Program Synthesis and Transformation (LOPSTR-96); Sweden. Springer-Verlag, 1996.
2. P. Cousot and R. Cousot. Comparing the Galois connection and widening/narrowing approaches to abstract interpretation. In Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming, PLILP’92, Leuven, Belgium, volume 631 of Incs, pages 269-295. Springer-Verlag, 1992.
3. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Proceedings of the 5th Annual ACM Symposium on Principles of Programming Languages, pages 84-96, 1978.
4. B. De Backer and H. Beringer. A CLP language handling disjunctions of linear constraints. In Proceedings of the International Conference on Logic Programming (ICLP’93), pages 550-563. MIT Press, 1993.
5. J. Gallagher, D. Boulanger, and H. Săglam. Practical model-based static analysis for definite logic programs. In J. W. Lloyd, editor, Proc. of International Logic Programming Symposium, pages 351-365. MIT Press, 1995.
6. J. Gallagher and D. A. 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, pages 599-613. MIT Press, 1994.
7. N. Halbwachs, Y. E. Proy, and P. Raymond. Verification of linear hybrid systems by means of convex approximations. In Proceedings of the First Symposium on Static Analysis, volume 864 of lncs, pages 223-237. Springer-Verlag, September 1994.
8. 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.
9. G. Janssens, M. Bruynooghe, and V. Englebert. Abstracting numerical values in CLP(H, N). Technical Report CW189, K.U. Leuven, Belgium, 1994.
10. th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages; Charleston, South Carolina, pages 334-344, January 1993.
11. P. Mishra. Towards a theory of types in prolog. In Proceedings of the IEEE International Symposium on Logic Programming, 1984.
12. G. Plotkin. A note on inductive generalisation. In B. Meltzer and D. Michie, editors, Machine Intelligence, Vol. 5. Edinburgh University Press, 1974.
13. J. C. Reynolds. Transformational systems and the algebraic structure of atomic formulas. In B. Meltzer and D. Michie, editors, Machine Intelligence, Vol. 5. Edinburgh University Press, 1974.
14. H. Săglam. Static analysis of logic programs by abstract compilation into CLP. In Proceedings of the Eighth European Summer School on Logic, Language and Information, ESSLLI’96 Student Session. Czech Technical University, Prague, Czech Republic, 1996.
15. H. Săglam and J. Gallagher. Approximating logic programs using types and regular descriptions. Technical Report CSTR-94-19, University of Bristol, Department of Computer Science, 1994.
16. H. Săglam and J. Gallagher. Approximating constraint logic programs using polymorphic types and regular descriptions. In Proceedings of the 7th International Symposium on Programming Languages, Implementations, Logics and Programs, PLILP’95 (poster abstract), Utrecht, Holland; (full version is Technical Report CSTR-95-016, Department of Computer Science, University of Bristol), 1995.
17. H. Săglam and J. Gallagher. Proving properties of terms using abstract compilation into CLP. In Proceedings of JICSLP’96 post conference Workshop on Meta Programming and Metareasoning in Logic, META '96. Uppsala University, Uppsala, Sweden, 1996.
18. H. Săglam and J. Gallagher. Static analysis of logic programs using CLP as a meta-language. Technical Report CSTR-96-003, University of Bristol, Department of Computer Science, 1996.
19. A. van Gelder. Deriving constraints among argument sizes in logic programs. In Principles of Database Systems; Nashville, Tennessee, pages 47-60, 1990.
20. K. Verschaetse and D. De Schreye. Derivation of linear size relations by abstract interpretation. In Proceedings of the fth International Symposium on Programming Language Implementation and Logic Programming, PLILP’92, Leuven, Belgium, volume 631 of lncs, pages 296-310. Springer-Verlag, 1992.
21. E. Yardeni and E.Y. Shapiro. A type system for logic programs. Journal of Logic Programming, 10(2):125-154, 1990.