Abstract interpretation using typed decision graphs

Science of Computer Programming

Volumn 31, Issue 1, 1998, Pages 91-112

  Mauborgne, Laurent ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Abstract interpretation; BDD; Higher order; Strictness; Widening

Indexed keywords

BOOLEAN FUNCTIONS; DECISION THEORY; GRAPH THEORY; MATHEMATICAL OPERATORS;

ABSTRACT INTERPRETATION; BINARY DECISION DIAGRAMS (BDD); STRICTNESS ANALYSIS; TYPED DECISION GRAPHS (TDG);

COMPUTER PROGRAMMING;

EID: 0032068873     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(96)00042-1     Document Type: Article

References (24)

1. S.B. Akers, Binary decision diagrams, IEEE Trans. Comput., 1978.
2. G. Baraki, Abstract interpretation of polymorphic higher-order functions, Ph.D. Thesis, Computing Science Research Report of the University of Glasgow, 1993.
3. J.P. Billon, Perfect normal forms for discrete programs, Technical Report 87039, BULL, 1987.
4. A.R. Brayton, B. Lin, H.J. Touati, Don't care minimization of multi-level sequential logic network, Proc. ICCAD'90, 1990.
5. R.E. Bryant, Graph based algorithms for Boolean function manipulation, IEEE Trans. Comput. C-35 (1986) 677-691.
6. R.E. Bryant, Symbolic Boolean manipulation with ordered binary-decision diagrams, ACM Comput. Surveys 24 (1992) 293-318.
7. G.L. Burn, C. Hankin, S. Abramsky, Strictness analysis for higher-order functions, Science of Computer Programming 7 (3) (1986) 249-278.
8. M-M. Corsini, M. Musumbu, A. Rauzy, B. Le Charlier, Efficient bottom-up abstract interpretation of logic programs by means of constraint solving, PLILP '93, 1993.
9. P. Cousot, R. Cousot, Static determination of dynamic properties of recursive procedures, IFIP Conf. on Formal Description of Programming Concepts, St-Adrews, N. B., Canada, 1977, pp. 237-277.
10. P. Cousot, R. Cousot, Constructive version of Tarski's fixed point theorems, Pacific J. Math. (1979).
11. P. Cousot, R. Cousot, Abstract interpretation framework, J. Logic Comput. 2 (4) (1992) 511-547.
12. P. Cousot, R. Cousot, Galois connection based abstract interpretations for strictness analysis, Proc. Internat. Conf. on Formal Methods in Programming and their Applications, Lecture Notes in Computer Science, vol. 735, Springer, Berlin, 1993, pp. 98-127.
13. A. Ferguson, J. Hughes, Fast abstract interpretation using sequential algorithms, Proc. WSA'93 (1993) 45-59.
14. P. Hudak, J. Young, Higher order strictness analysis in untyped lambda calculus, ACM Principles Programming Languages (1986) 97-109.
15. B. Le Charlier and P. Van Hentenryck, Groundness analysis for prolog: Implementation and evaluation of the domain Prop., Proc. PEPM'93, 1993.
16. J.C. Madre, C. Berthet, O. Coudert, New ideas in symbolic manipulation of finite state machines, Proc. ICCAD'90, 1990.
17. J.C. Madre, J.P. Billon, Proving circuit correctness using formal comparison between expected and extracted behavior, Proc. 25th DAC, 1988.
18. A. Mycroft, The theory and practice of transforming call-by-need into call-by-value, Proc. 4th Internat. Symp. on Programming, Lecture Notes in Computer Science, vol. 83, Springer, Berlin, 1980, pp. 270-280.
19. C. Ratel, Définition et réalisation d'un outil de vérification formelle de programmes LUSTRE, Thèse de l'Université de Grenoble 1, Chapter 11, 1992.
20. J. Schwable, K.L. McMillan, Formal verification of the encore gigamax cache, Internat. Symp. on Shared Memory Multiprocessor, 1991.
21. C.E. Shannon, A symbolic analysis of relay and switching circuits, Trans. AIEE 57 (1938) 305-316.
22. D. Taubner, E. Enders, T. Filkorn, Generating BDDs for symbolic model checking in CCS, Proc. CAV'91, 1991, pp. 203-213.
23. H.J. Touati, H. Savoj, R.K. Brayton, Extracting local don't care for network optimization, Proc. ICCAD'91, 1991.
24. P. Van Hentenryck, A. Cortesi, B. Le Charlier, Evaluation of Prop., J. Logic Programming (1995) 237-278.