Intuitionistic implication in abstract interpretation

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

Volumn 1292, Issue , 1997, Pages 175-189

  Giacobazzi, Roberto ^a   Scozzari, Francesca ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Abstract interpretation; Directional types; Domains; Intuitionistic logic; Logic programming; Static analysis

Indexed keywords

ABSTRACTING; COMPUTER CIRCUITS; COMPUTER PROGRAMMING LANGUAGES; LOGIC PROGRAMMING; MAGNETIC DOMAINS; MODEL CHECKING;

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; BASIC OPERATION; DIRECTIONAL TYPES; INTUITIONISTIC LOGIC; LOGIC FORMULAS; PROGRAM ANALYSIS; TYPE INFERENCES;

STATIC ANALYSIS;

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

References (27)

1. st Static Analysis Symp. SAS'94, LNCS 864, pp. 43-60. Springer, 1994.
2. K. R. Apt. Introduction to logic programming. In Handbook of Theoretical Computer Science, Vol. B, pp. 495-574. Elsevier, 1990.
3. T. Armstrong, K. Marriott, P. Schachte, and H. Søndergaard. Boolean functions for dependency analysis: algebraic properties and efficient representation. In Proc. 1st Static Analysis Symp. SAS'94, LNCS 864, pp. 266-280. Springer, 1994.
4. R. Barbuti, R. Giacobazzi, and G. Levi. A general framework for semantics-based bottom-up abstract interpretation of logic programs. ACM TOPLAS, 15(1):133-181, 1993.
5. G. Birkhoff. Lattice theory. In AMS Colloquium Publication, third ed. AMS Press, 1967.
6. F. Bronsard, T.K. Lakshman, and U.S. Reddy. A framework of directionality for proving termination of logic programs. In Proc. 199P Joint Int'I Conf. and Syrup. Logic Prog., pp. 321-335. MIT Press, 1992.
7. M. Bruynooghe. A practical framework for the abstract interpretation of logic programs. J. of Logic Programm. 10:91-124, 1991.
8. M. Codish and B. Demoen. Deriving type dependencies for logic programs using multiple incarnations of Prop. In Proc. 1st Static Analysis Syrup. SAS'94, LNCS 864. Springer, 1994.
9. M. Codish, A. Mulkers, M. Bruynooghe, M. García de la Banda, and M. Hermenegildo. Improving abstract interpretations by combining domains. ACM TOPLAS, 17(1):28-44, 1995.
10. A. Cortesi, G. Filé, R. Giacobazzi, C. Palamidessi, and F. Ranzato. Complementation in abstract interpretation. ACM TOPLAS 19(1):7-47, 1997.
11. th IEEE LICS, pp. 322-327. IEEE Comp. Soc. Press, 1991.
12. st ACM POPL, pp. 227-239. ACM Press, 1994.
13. th ACM POPL, pp. 238-252. ACM Press, 1977.
14. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In 6th ACM POPL, pp. 269-282. ACM Press, 1979.
15. P. Cousot and R. Cousot. Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and per analysis of functional languages). In Proc. 1994 Int'l Conf. on Comp. Lang. ICCL' 94, pp. 95-112. IEEE Comp. Soc. Press, 1994.
16. G. Filé, R. Giacobazzi, and F. Ranzato. A unifying view on abstract domain design. ACM Comp. Surveys, 28(2):333-336, 1996.
17. G. Filé and F. Ranzato. Improving abstract interpretations by systematic lifting to the powerset. In Proe. 1994 Int'l Logic Prog. Symp., pp. 655-669. MIT Press, 1994.
18. R. Giacobazzi and F. Ranzato. Functional dependencies and Moore-set completions of abstract interpretations and semantics. In Proc. 1995 Int'l Logic Prog. Syrup., pp. 321-335. MIT Press, 1995.
19. R. Giacobazzi and F. Ranzato. Compositional optimization of disjunctive abstract interpretations. In Proc. ESOP'96, LNCS 1058, pp. 141-155. Springer, 1996.
20. C. Hankin and D. Le Metayer. Deriving algorithms from type inference systems: Applications to strictness analysis. In 21st ACM POPL, pp. 202-212. ACM Press, 1994.
21. T.P. Jensen. Disjunctive strictness analysis. In 7th IEEE LICS, pp. 174-185. IEEE Comp. Soc. Press, 1992.
22. N. D. Jones and H. Søndergaard. A Semantics-based Framework for the Abstract Interpretation of Prolog. In S. Abramsky and C. Hankin, eds., Abstract Interpretation of Declarative Languages, pp. 123-142. Ellis Horwood Ltd, 1987.
23. N.D. Jones and S.S. Muchnick. Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra. In S. Muchnick and N.D. Jones, eds., Program Flow analysis: Theory and Applications, pp. 380-393. Prentice-Hall, 1981.
24. J. Morgado. Some results on the closure operators of partially ordered sets. Port. Math., 19(2):101-139, 1960.
25. th ICALP, LNCS 154, pp. 536-547. Springer, 1983.
26. th Hung. Comp. Science Conf., pp. 211-225, 1985.
27. th ACM POPL, pp. 246-259. ACM Press, 1993.