SIGN IN
SIGN UP
A relational approach to interprocedural shape analysis
Full Text:
PDF
Buy this Article
Authors:
Bertrand Jeannet
INRIA
Alexey Loginov
GrammaTech, Inc.
Thomas Reps
University of Wisconsin
Mooly Sagiv
Tel Aviv University
2010 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 63
· Downloads (cumulative): 369
· Citation Count: 4
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS)
TOPLAS Homepage
archive
Volume 32 Issue 2, January 2010
Article No. 5
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1667048.1667050
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
3-valued logic
abstract interpretation
algorithms
assertion checkers
assertions
context-sensitive analysis
data types and structures
destructive updating
dynamic storage management
interprocedural dataflow analysis
invariants
languages
linked representations
pointer analysis
recursion
shape analysis
static analysis
symbolic execution
theory
trees
verification
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