2008
DOI: 10.1002/spe.895
|View full text |Cite
|
Sign up to set email alerts
|

Using XBDDs and ZBDDs in points‐to analysis

Abstract: Binary decision diagrams (BDDs) have recently become widely accepted as a space‐efficient method of representing relations in points‐to or reference analyses. When BDDs are used to represent relations, each element of a domain is assigned a bit pattern to represent it, but not every bit pattern represents an element. The circuit design, model checking, and verification communities have achieved significant reductions in BDD sizes using several techniques to reduce the overhead of these don't‐care bit patterns.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…It has a variety of applications. For example, It is used in compiler community for efficient points-to analysis [2,3,4] and it is also used in image processing [5,6].…”
Section: Introductionmentioning
confidence: 99%
“…It has a variety of applications. For example, It is used in compiler community for efficient points-to analysis [2,3,4] and it is also used in image processing [5,6].…”
Section: Introductionmentioning
confidence: 99%
“…Previous works [6], [2], [3], [7], [4], [5], [15] have implemented efficient and compact points-to sets which make the overall analysis more efficient. Points-to sets which are represented based on bit-vectors [7], [3], [8] and points-to sets which are represented and manipulated based on BDD relations are shown to be more efficient [6], [2], [4], [5], [9], [15]. In this paper we utilize bit-vector representaion of points-to sets.…”
Section: Introductionmentioning
confidence: 99%