A reactive implementation of Pos using ROBDDs

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

Volumn 1140, Issue , 1996, Pages 107-121

  Bagnara, Roberto ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL LINGUISTICS; LOGIC PROGRAMMING;

ALIASING; EFFICIENT DETECTION; GROUNDNESS; LOGIC PROGRAMS; NO REFERENCES; POSITIVE EXPERIENCES; REDUCED ORDERED BINARY DECISION DIAGRAM; SYMBOLIC REPRESENTATION;

BINARY DECISION DIAGRAMS;

EID: 84957632566     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61756-6_80     Document Type: Conference Paper

References (19)

1. T. Armstrong, K. Marriott, P. Schachte, and H. Sondergaard. Two classes of boolean functions for dependency analysis. Technical Report 94/211, Dept. Computer Science, Monash University, Melbourne, 1994.
2. R. Bagnara. On the detection of implicit and redundant numeric constraints in CLP programs. In M. Alpuente, R. Baxbuti, and I. Ramos, editors, Proceedings of the "1994 Joint Conference on Declarative Programming (GULP-PRODE '94)", pages 312-326, Peñíscola, Spain, September 1994.
3. R. Bagnara. A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages. Technical Report TR-96-10, Dipartimento di Informatica, Università di Pisa, 1996. To appear on a special issue of "Science of Computer Programming".
4. R. Bagnara, R. Giacobazzi, and G. Levi. An application of constraint propagation to data-flow analysis. In Proceedings of "The Ninth Conference on Artificial Intelligence for Applications", pages 270-276, Orlando, Florida, March 1993. IEEE Computer Society Press, Los Alamitos, CA.
5. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
6. R. E. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.
7. A. Cortesi, G. File, and W. Winsborough. Prop revisited: Propositional formula as abstract domain for groundness analysis. In Proc. Sixth IEEE Symp. on Logic In Computer Science, pages 322-327. IEEE Computer Society Press, 1991.
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, January 1994.
10. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Proc. Sixth ACM Symp. Principles of Programming Languages, pages 269-282, 1979.
11. P. Cousot and R. Cousot. Abstract interpretation and applications to logic programs. Journal of Logic Programming, 13(2 & 3):103-179, 1992.
12. S. K. Debray. Static Inference of Modes and Data Dependencies in Logic Programs. ACM Transactions on Programming Languages and Systems (TOPLAS), ll(3):418-450, 1989.
13. D. Jacobs and A. Langen. Accurate and efficient approximation of variable aliasing in logic programs. In E. Lusk and R. Overbeek, editors, Proc. North American Conf. on Logic Programming'89, pages 154-165. The MIT Press, Cambridge, Mass., 1989.
14. J. Jaffar, S. Michaylov, P. Stuckey, and R. Yap. The CLP(72.) language and system. ACM Transactions on Programming Languages and Systems, 14(3):339-395, 1992.
15. 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, pages 123-142. Ellis Horwood Ltd, 1987.
16. B. Le Charlier and P. Van Hentenryck. Groundness analysis for Prolog: Implementation and evaluation of the domain prop. In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 99-110. ACM Press, 1993.
17. C. Mellish. Some global optimizations for a Prolog compiler. Journal of Logic Programming, 2:43-66, 1985.
18. V. A. Saraswat. Concurrent Constraint Programming. MIT Press Cambridge, Mass., 1993.
19. P. Van Hentenryck, A. Cortesi, and B. Le Charlier. Evaluation of the domain PROP. Journal of Logic Programming, 23(3):237-278, June 1995. Extended version of [16].