Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Pointer Analysis, Conditional Soundness, and Proving the Absence of Errors
| Book Series | Lecture Notes in Computer Science |
| Publisher | Springer Berlin / Heidelberg |
| ISSN | 0302-9743 (Print) 1611-3349 (Online) |
| Volume | Volume 5079/2008 |
| Book | Static Analysis |
| DOI | 10.1007/978-3-540-69166-2 |
| Copyright | 2008 |
| ISBN | 978-3-540-69163-1 |
| DOI | 10.1007/978-3-540-69166-2_5 |
| Pages | 62-77 |
| Subject Collection | Computer Science |
| SpringerLink Date | Monday, July 14, 2008 |
| |
|
Pointer Analysis, Conditional Soundness, and Proving the Absence of Errors
Christopher L. Conway1 , Dennis Dams2 , Kedar S. Namjoshi2 and Clark Barrett1 
| (1) |
Dept. of Computer Science, New York University, |
| (2) |
Bell Laboratories, Alcatel-Lucent, |
Abstract
It is well known that the use of points-to information can substantially improve the accuracy of a static program analysis.
Commonly used algorithms for computing points-to information are known to be sound only for memory-safe programs. Thus, it
appears problematic to utilize points-to information to verify the memory safety property without giving up soundness. We
show that a sound combination is possible, even if the points-to information is computed separately and only conditionally
sound. This result is based on a refined statement of the soundness conditions of points-to analyses and a general mechanism
for composing conditionally sound analyses.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|