Abstracting Call-Stacks for Interprocedural Verification of Imperative Programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2003

Abstracting Call-Stacks for Interprocedural Verification of Imperative Programs

Abstract

We address in this paper the verification of imperative programs with recursion. Our approach consists in using abstract interpretation to relate the standard semantics of imperative programs to an abstract semantics, by the mean of a Galois connection, and then to resort to intraprocedural techniques, which can be applied on the abstract semantics. This approach allows the reuse of classical intraprocedural techniques with few modifications, generalises existing approaches to interprocedural analysis and offers additional flexibility, as it keeps substantial information on the call-stack of the analysed program.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-4904.pdf (1.38 Mo) Télécharger le fichier

Dates and versions

inria-00071678 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071678 , version 1

Cite

Bertrand Jeannet, Wendelin Serwe. Abstracting Call-Stacks for Interprocedural Verification of Imperative Programs. [Research Report] RR-4904, INRIA. 2003. ⟨inria-00071678⟩
67 View
367 Download

Share

Gmail Facebook X LinkedIn More