Trace partitioning in abstract interpretation based static analyzers

127Citations
Citations of this article
49Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

When designing a tractable static analysis, one usually needs to approximate the trace semantics. This paper proposes a systematic way of regaining some knowledge about the traces by performing the abstraction over a partition of the set of traces instead of the set itself. This systematic refinement is not only theoretical but tractable: we give automatic procedures to build pertinent partitions of the traces and show the efficiency on an implementation integrated in the ASTRÉE static analyzer, a tool capable of dealing with industrial-size software. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Mauborgne, L., & Rival, X. (2005). Trace partitioning in abstract interpretation based static analyzers. In Lecture Notes in Computer Science (Vol. 3444, pp. 5–20). Springer Verlag. https://doi.org/10.1007/978-3-540-31987-0_2

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