Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |
Download paper Adobe portable document format (pdf)
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.
This paper addresses the verification of properties of imperative programs with recursive procedure calls, heap-allocated storage, and destructive updating of pointer-valued fields-i.e., interprocedural shape analysis. It presents a way to apply some previously known approaches to interprocedural dataflow analysis-which in past work have been applied only to a much less rich setting-so that they can be applied to programs that use heap-allocated storage and perform destructive updating.
Bertrand Jeannet
Bertrand.Jeannet@irisa.fr
@InProceedings{jeannet04b,
Author = {Jeannet, B. and Loginov, A. and Reps, T. and Sagiv, M.},
Title = {A Relational Approach to Interprocedural Shape Analysis},
BookTitle = {11th Static Analysis Symposium - SAS 2004. Volume 3148 of LNCS},
Publisher = {Springer-Verlag},
Address = {Verona, Italy},
Month = {August},
Year = {2004}
}
Get EndNote Reference (.ref)