Factorizing equivalent variable pairs in ROBDD-based implementations of Pos

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

Volumn 1548, Issue , 1998, Pages 471-485

  Bagnara, Roberto ^a   Schachte, Peter ^b  

^a UNIVERSITY OF PARMA   (Italy)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; LOGIC PROGRAMMING; SOFTWARE ENGINEERING;

DEPENDENCY INFORMATIONS; GROUNDNESS; HYBRID REPRESENTATIONS; LOGIC PROGRAMS; REDUCED ORDERED BINARY DECISION DIAGRAM; VARIABLE PAIR;

BINARY DECISION DIAGRAMS;

EID: 84958958122     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49253-4_33     Document Type: Conference Paper

References (17)

1. T. Armstrong, K. Marriott, P. Schachte, and H. Søndergaard. Two classes of Boolean functions for dependency analysis. Science of Computer Programming, 31(1):3-45, 1998.
2. R. Bagnara. A reactive implementation of Pos using ROBDDs. In H. Kuchen and S. D. Swierstra, editors, Programming Languages: Implementations, Logics and Programs, Proceedings of the Eighth International Symposium, volume 1140 of Lecture Notes in Computer Science, pages 107-121, Aachen, Germany, 1996. Springer-Verlag, Berlin.
3. R. Bagnara. Data-Flow Analysis for Constraint Logic-Based Languages. PhD thesis, Dipartimento di Informatica, Università di Pisa, Corso Italia 40, I-56125 Pisa, Italy, March 1997. Printed as Report TD-1/97.
4. R. Bagnara and P. Schachte. Efficient implementation of Pos. Technical Re- port 98/5, Department of Computer Science, The University of Melbourne, Australia, 1998.
5. P. Bigot, S. K. Debray, and K. Marriott. Understanding finiteness analysis using abstract interpretation. In K. Apt, editor, Logic Programming: Proceedings of the Joint International Conference and Symposium on Logic Programming, MIT Press Series in Logic Programming, pages 735-749, Washington, USA, 1992. The MIT Press.
6. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
7. R. E. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.
8. A. Cortesi, B. Le Charlier, and P. Van Hentenryck. Conceptual and software support for abstract domain design: Generic structural domain and open product. Technical Report CS-93-13, Brown University, Providence, RI, 1993.
9. A. Cortesi, B. Le Charlier, and P. Van Hentenryck. Combinations of abstract domains for logic programming. In Conference Record of POPL '94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 227-239, Portland, Oregon, 1994.
10. P. W. Dart. Dependency Analysis and Query Interfaces for Deductive Databases. PhD thesis, The University of Melbourne, Department of Computer Science, 1988. Printed as Technical Report 88/35.
11. M. Falaschi, M. Gabbrielli, K. Marriott, and C. Palamidessi. Conuence and concurrent constraint programming. In V. S. Alagar and M. Nivat, editors, Proceedings of the Fourth International Conference on Algebraic Methodology and Software Technology (AMAST'95), volume 936 of Lecture Notes in Computer Science, pages 531-545. Springer-Verlag, Berlin, 1995.
12. N. D. Jones and H. Søndergaard. A semantics-based framework for the abstract interpretation of Prolog. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, chapter 6, pages 123-142. Ellis Horwood Ltd, West Sussex, England, 1987.
13. K. Marriott and H. Søndergaard. Notes for a tutorial on abstract interpretation of logic programs. North American Conference on Logic Programming, Cleveland, Ohio, USA, 1989.
14. C. S. Mellish. Some global optimizations for a Prolog compiler. Journal of Logic Programming, 2(1):43-66, 1985.
15. P. Schachte. Efficient ROBDD operations for program analysis. In K. Ramamohanarao, editor, ACSC'96: Proceedings of the 19th Australasian Computer Science Conference, pages 347-356. Australian Computer Science Communications, 1996.
16. H. Søndergaard. Immediate fixpoints and their use in groundness analysis. In V. Chandru and V. Vinay, editors, Foundations of Software Technology and Theoretical Computer Science, volume 1180 of Lecture Notes in Computer Science, pages 359-370. Springer-Verlag, Berlin, 1996.
17. J. Zobel. Analysis of Logic Programs. PhD thesis, The University of Melbourne, 1990.