Conference ProceedingsOPEN ACCESS

Modular static program analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2304 159-179
DOI: 10.1007/3-540-45937-5_13
126Citations
Citations of this article
47Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The purpose of this paper is to present four basic methods for compositional separate modular static analysis of programs by abstract interpretation: - simplification-based separate analysis; - worst-case separate analysis; - separate analysis with (user-provided) interfaces; - symbolic relational separate analysis; as well as a fifth category which is essentially obtained by composition of the above separate local analyses together with global analysis methods.

Cite

CITATION STYLE

APA

Cousot, P., & Cousot, R. (2002). Modular static program analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2304, pp. 159–179). Springer Verlag. https://doi.org/10.1007/3-540-45937-5_13

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