Conference item icon

Conference item

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

Actions


Access Document


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

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
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
Host title:
Programming Languages and Systems: 23rd European Symposium on Programming, ESOP 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings. Editor: Zhong Shao
Publication date:
2014-01-01
DOI:
ISSN:
0302-9743
Source identifiers:
581047
ISBN:
9783642548338
Keywords:
Pubs id:
pubs:581047
UUID:
uuid:e91ec8d6-31f5-4c98-a4c0-01752c504df3
Local pid:
pubs:581047
Deposit date:
2016-01-03

Terms of use


Views and Downloads






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

TO TOP