Accurate binding-time analysis for imperative languages: Flow, context, and return sensitivity

DOI10.1016/S0304-3975(00)00048-7MaRDI QIDQ1583347zbMATHWikidataFDO

Authors R. Smith

Publication date 26 October 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

imperative languagesbinding-time analysisPartial evaluation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Binding-time analysis for both static and dynamic expressions
• scientific article; zbMATH DE number 1630104
• Enhanced type inference for binding-time analysis
• scientific article; zbMATH DE number 2084340
• Static semantics, types, and binding time analysis
• Comparing flow-based binding-time analyses
• scientific article; zbMATH DE number 2018578
• A temporal logic approach to binding-time analysis

Cites work

• scientific article; zbMATH DE number 236855 (Why is no real title available?)
• Properties of data flow frameworks: A unified model

Cited in

(6)

• scientific article; zbMATH DE number 1231585 (Why is no real title available?)
• Accurate program analyses for successful specialization of legacy system software
• A portable approach to dynamic optimization in run-time specialization
• Binding-Time Annotations without Binding-Time Analysis
• scientific article; zbMATH DE number 1630104 (Why is no real title available?)
• scientific article; zbMATH DE number 2084340 (Why is no real title available?)

This page was built for publication: Accurate binding-time analysis for imperative languages: Flow, context, and return sensitivity

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