Incremental algorithms for inter-procedural analysis of safety properties

39Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Automaton-based static program analysis has proved to be an effective tool for bug finding. Current tools generally re-analyze a program from scratch in response to a change in the code, which can result in much duplicated effort. We present an inter-procedural algorithm that analyzes incrementally in response to program changes and present experiments for a null-pointer dereference analysis. It shows a substantial speed-up over re-analysis from scratch, with a manageable amount of disk space used to store information between analysis runs. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Conway, C. L., Namjoshi, K. S., Dams, D., & Edwards, S. A. (2005). Incremental algorithms for inter-procedural analysis of safety properties. In Lecture Notes in Computer Science (Vol. 3576, pp. 449–461). Springer Verlag. https://doi.org/10.1007/11513988_45

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free