SIGN IN
SIGN UP
Finite differencing of logical formulas for static analysis
Full Text:
PDF
Buy this Article
see
source materials
below for
more options
Authors:
Thomas Reps
University of Wisconsin and GrammaTech, Inc.
Mooly Sagiv
Tel Aviv University, Israel
Alexey Loginov
GrammaTech, Inc.
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS)
TOPLAS Homepage
archive
Volume 32 Issue 6, August 2010
Article No. 24
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1749608.1749613
2010 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 9
· Downloads (12 Months): 60
· Downloads (cumulative): 335
· Citation Count: 2
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
assertions
data types and structures
dynamic storage management
finite differencing
formal methods
graphs and networks
invariants
languages
linked representations
materialized view
mechanical verification
program analysis
records
shape analysis
static analysis
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