A relational approach to interprocedural shape analysis

Bertrand Jeannet, Alexey Loginov, Thomas Reps, Mooly Sagiv

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

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 harness some previously known approaches to interprocedural dataflow analysis - which in past work have been applied only to much less rich settings - for interprocedural shape analysis.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsRoberto Giacobazzi
PublisherSpringer Verlag
Pages246-264
Number of pages19
ISBN (Print)9783540278641
DOIs
StatePublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3148
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'A relational approach to interprocedural shape analysis'. Together they form a unique fingerprint.

Cite this