SIGN IN
SIGN UP
Flow-insensitive type qualifiers
Full Text:
PDF
Buy this Article
Authors:
Jeffrey S. Foster
University of Maryland, College Park, MD
Robert Johnson
University of California, Berkeley, Stony Brook, NY
John Kodumal
University of California, Berkeley, San Francisco, CA
Alex Aiken
Stanford University, Stanford, CA
2006 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 25
· Downloads (cumulative): 427
· Citation Count: 16
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS)
TOPLAS Homepage
archive
Volume 28 Issue 6, November 2006
Pages 1035-1087
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1186632.1186635
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
const
constraints
design
experimentation
language constructs and features
languages
reliability
requirements/specifications
security
software/program verification
specifying and verifying and reasoning about programs
static analysis
taint
theory
type qualifiers
types
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