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

DOI10.1016/S0304-3975(00)00048-7zbMATH Open0951.68058WikidataQ127846314 ScholiaQ127846314MaRDI QIDQ1583347FDOQ1583347

Authors: R. Smith 

Publication date: 26 October 2000

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

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

zbMATH Keywords

imperative languagesbinding-time analysisPartial evaluation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Properties of data flow frameworks: A unified model

Cited In (6)

• Title not available (Why is that?)
• Binding-Time Annotations without Binding-Time Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• A portable approach to dynamic optimization in run-time specialization
• Accurate program analyses for successful specialization of legacy system software

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)