Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Using ZBDDs in Points-to Analysis Ondrej Lhotak1
 

Summary: Using ZBDDs in Points-to Analysis
Ondrej Lhot´ak1
, Stephen Curial2
, and Jos´e Nelson Amaral2
1
D. R. Cheriton School of Computer Science, University of Waterloo
2
Department of Computing Science, University of Alberta
Abstract. Binary Decision Diagrams (BDDs) have recently become
widely accepted as a space-efficient method of representing relations in
points-to 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 check-
ing, and verification communities have achieved significant reductions in
BDD sizes using Zero-Suppressed BDDs (ZBDDs) to avoid the overhead
of these don't-care bit patterns. We adapt BDD-based program analyses
to use ZBDDs instead of BDDs. Our experimental evaluation studies the
space requirements of ZBDDs for both context-insensitive and context-
sensitive program analyses and shows that ZBDDs can greatly reduce
the space requirements for expensive context-sensitive points-to analy-

  

Source: Amaral, José Nelson - Department of Computing Science, University of Alberta
Lhotak, Ondrej - School of Computer Science, University of Waterloo

 

Collections: Computer Technologies and Information Sciences