𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bidirectional data flow analysis for type inferencing

✍ Scribed by Uday P. Khedker; Dhananjay M. Dhamdhere; Alan Mycroft

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
456 KB
Volume
29
Category
Article
ISSN
1477-8424

No coin nor oath required. For personal study only.

✦ Synopsis

Tennenbaum's data ow analysis based formulation of type inferencing is termed bidirectional in the "Dragon Book"; however, it fails to qualify as a formal data ow framework and is not amenable to complexity analysis. Further, the types discovered are imprecise. Here, we deΓΏne a formal data ow framework (based on bidirectional data ow analysis) which discovers more precise type information and is amenable to complexity analysis.

We compare data ow analyses with the more general constraint-based analyses and observe that data ow analyses represent program analyses without unbounded auxiliary store. We show that if unlimited auxiliary store is allowed then no data ow analysis would need more than two passes; if auxiliary store is disallowed then type inferencing requires bidirectional data ow analysis.

πŸ“œ SIMILAR VOLUMES

Path-sensitive alias analysis for data f
Path-sensitive alias analysis for data flow testing
✍ Delia I. S. Marx; Phyllis G. Frankl πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 173 KB

This paper describes a new approach to performing data flow testing in the presence of aliasing, and a tool based on this method. The technique is based on the observation that, under certain reasonable assumptions, one can statically determine which variables are aliased whenever control reaches a

Logarithmic timebase for stopped-flow da
Logarithmic timebase for stopped-flow data acquisition and analysis
✍ Adrian R. Walmsley; Clive R. Bagshaw πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 662 KB

A method for capturing stopped-flow and other rapid reaction records in logarithmic time, using a microcomputer, is described. Apart from the ability to record processes over several decades in time in a single exper-0003.

COD β€” A dynamic data flow analysis syste
COD β€” A dynamic data flow analysis system for Cobol
✍ T.Y. Chen; H. Kao; M.S. Luk; W.C. Ying πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 596 KB

This paper presents a description of an automated data flow analysis system for Cobol programs -COD. It detects all data flow anomalies as well as certain kinds of errors and has been found to be a very helpful tool for testing and developing Cobol programs.