Paper Info
Title
Factorizing Equivalent Variable Pairs in ROBDD-Based Implementations of Pos
Abstract
The subject of groundness analysis for (constraint) logic pro- grams has been widely studied, and interesting domains have been pro- posed. Pos has been recognized as the most suitable domain for capturing the kind of dependencies arising in groundness analysis, and Reduced Or- dered Binary Decision Diagrams (ROBDDs) are generally accepted to be the most ecient representation for Pos. Unfortunately, the size of an ROBDDs is, in the worst case, exponential in the number of variables it depends upon. Earlier work (2) has shown that a hybrid representation that separates the denite information from the dependency information is considerably more ecient than keeping the two together. The aim of the present paper is to push this idea further, also separating out certain dependency information, in particular all pairs of variables that are al- ways either both ground or neither ground. We nd that this new hybrid representation is a signicant improvement over previous work.
Year
Venue
Keywords
1998
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
hybrid representation,definite information,factorizing equivalent variable pairs,certain dependency information,groundness analysis,reduced ordered binary decision,interesting domain,new hybrid representation,previous work,robdd-based implementations,dependency information,efficient representation,binary decision diagram
Field
DocType
Volume
Boolean function,Program optimization,Exponential function,Computer science,Abstract interpretation,Algorithm,Binary decision diagram,Implementation,Theoretical computer science,Program analysis,Constraint logic programming
Conference
1548
ISSN
ISBN
Citations 
0302-9743
3-540-65462-3
21
PageRank 
References 
Authors
0.83
10
2
Name
Order
Citations
PageRank
Roberto Bagnara173543.45
Peter Schachte225622.76