Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |

Download [help]

Download paper Gziped Postscript (.ps.gz)

Copyright noticeThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

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.

Contact

Bertrand Jeannet
Bertrand.Jeannet@irisa.fr

BibTex Reference

@TechReport{jeannet03b,
   Author = {Jeannet, B. and Serwe, W.},
   Title = {Abstracting Call-Stacks for Interprocedural Verification of Imperative Programs},
   Number = {1543},
   Institution = {IRISA},
   Month = {July},
   Year = {2003}
}

EndNote Reference [help]

Get EndNote Reference (.ref)