Record Details

Bidirectional data flow analysis for type inferencing

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Bidirectional data flow analysis for type inferencing
 
Creator KHEDKER, UDAY P
DHAMDHERE, DM
MYCROFT, ALAN
 
Subject computer programming languages
constraint theory
theorem proving
program compilers
 
Description Tennenbaum's data flow analysis based formulation of type inferencing is termed bidirectional in the “Dragon Book”; however, it fails to qualify as a formal data flow framework and is not amenable to complexity analysis. Further, the types discovered are imprecise. Here, we define a formal data flow framework (based on bidirectional data flow analysis) which discovers more precise type information and is amenable to complexity analysis.
We compare data flow analyses with the more general constraint-based analyses and observe that data flow analyses represent program analyses without unbounded auxiliary store. We show that if unlimited auxiliary store is allowed then no data flow analysis would need more than two passes; if auxiliary store is disallowed then type inferencing requires bidirectional data flow analysis.
 
Publisher Elsevier
 
Date 2009-05-11T00:38:52Z
2011-12-08T07:09:34Z
2011-12-26T13:01:59Z
2011-12-27T05:47:50Z
2009-05-11T00:38:52Z
2011-12-08T07:09:34Z
2011-12-26T13:01:59Z
2011-12-27T05:47:50Z
2003
 
Type Article
 
Identifier Computer Languages, Systems & Structures 29(1-2), 15-44
1477-8424
10.1016/S1477-8424(03)00012-5
http://hdl.handle.net/10054/1341
http://dspace.library.iitb.ac.in/xmlui/handle/10054/1341
 
Language en