Bidirectional data flow analysis for type inferencing.

DOI10.1016/S1477-8424(03)00012-5MaRDI QIDQ1399007zbMATH OpenOpenAlexWikidataFDO

Authors Uday P. Khedker, Alan Mycroft, Dhananjay M. Dhamdhere

Publication date 7 August 2003

Published in Computer Languages, Systems \& Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1477-8424(03)00012-5

zbMATH Keywords

Bidirectional data flow analysisType inferencing

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• Using locality of flow in dataflow analyses.
• Type systems equivalent to data-flow analyses for imperative languages
• Exact flow analysis
• scientific article; zbMATH DE number 1222409
• scientific article; zbMATH DE number 1130261

Cites work

• scientific article; zbMATH DE number 3485178 (Why is no real title available?)
• scientific article; zbMATH DE number 3592938 (Why is no real title available?)
• scientific article; zbMATH DE number 1237535 (Why is no real title available?)
• A solution to a problem with Morel and Renvoise's “Global optimization by suppression of partial redundancies”
• A theory of type polymorphism in programming
• Dynamic typing in polymorphic languages
• Global optimization by suppression of partial redundancies
• Monoids for Rapid Data Flow Analysis
• Monotone data flow analysis frameworks
• Properties of data flow frameworks: A unified model
• The Principal Type-Scheme of an Object in Combinatory Logic

Cited in

(3)

• Let arguments go first
• Type systems equivalent to data-flow analyses for imperative languages
• scientific article; zbMATH DE number 1130261 (Why is no real title available?)

This page was built for publication: Bidirectional data flow analysis for type inferencing.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399007)