SIGN IN
SIGN UP
Relations as an abstraction for BDD-based program analysis
Full Text:
PDF
Buy this Article
Authors:
Ondřej Lhoták
University of Waterloo, Waterloo, ON, Canada
Laurie Hendren
McGill University, Montreal, QC, Canada
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS)
TOPLAS Homepage
archive
Volume 30 Issue 4, July 2008
Article No. 19
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1377492.1377494
2008 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 53
· Downloads (cumulative): 439
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
binary decision diagrams
boolean formula satisfiability
data types and structures
design
experimentation
java
language design
languages
physical domain assignment
points-to analysis
processors
program analysis
relations
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder