Conference icon

Conference

A correspondence between two approaches to interprocedural analysis in the presence of join

Abstract:

Many interprocedural static analyses perform a lossy join for reasons of termination or efficiency. We study the relationship between two predominant approaches to interprocedural analysis, the summary- based (or functional) approach and the call-strings (or k-CFA) approach, in the presence of a lossy join. Despite the use of radically different ways to distinguish procedure contexts by these two approaches, we prove that post-processing their results using a form of garbage collecti...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Files:
Publisher copy:
10.1007/978-3-642-54833-8_27

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Engineering and Physical Sciences Research Council More from this funder
Publisher:
Springer Publisher's website
Volume:
Lecture Notes in Computer Science: 8410
Pages:
513-533
Publication date:
2014
DOI:
ISSN:
0302-9743
URN:
uuid:e91ec8d6-31f5-4c98-a4c0-01752c504df3
Source identifiers:
581047
Local pid:
pubs:581047
ISBN:
9783642548338

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP