Factorizing Equivalent Variable Pairs in ROBDD-Based Implementations of Pos-Reference-Cited by-同舟云学术

Factorizing Equivalent Variable Pairs in ROBDD-Based Implementations of Pos

Published:1998 Issue: Volume: Page:471-485
ISSN:0302-9743
Container-title:Algebraic Methodology and Software Technology
language:
Short-container-title:

Author:

Bagnara Roberto,Schachte Peter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-49253-4_33

Reference17 articles.

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. Lect Notes Comput Sci;R. Bagnara,1996

3. PhD thesis;R. Bagnara,1997

4. R. Bagnara and P. Schachte. Efficient implementation of Pos. Technical Report 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.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Widening ROBDDs with Prime Implicants;Tools and Algorithms for the Construction and Analysis of Systems;2006

2. Finite-tree analysis for constraint logic-based languages;Information and Computation;2004-09

3. Positive Boolean Functions as Multiheaded Clauses;Logic Programming;2001

4. Boolean Functions for Finite-Tree Dependencies;Logic for Programming, Artificial Intelligence, and Reasoning;2001

5. Parameterizing a Groundness Analysis of Logic Programs;Static Analysis;2001