Show simple item record

dc.contributor.authorJeannet, Bertranden_US
dc.contributor.authorLoginov, Alexeyen_US
dc.contributor.authorReps, Thomasen_US
dc.contributor.authorSagiv, Moolyen_US
dc.date.accessioned2012-03-15T17:18:13Z
dc.date.available2012-03-15T17:18:13Z
dc.date.created2004en_US
dc.date.issued2004en_US
dc.identifier.citationTR1505en_US
dc.identifier.urihttp://digital.library.wisc.edu/1793/60398
dc.description.abstractThis 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.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleA Relational Approach to Interprocedural Shape Analysisen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • CS Technical Reports
    Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record