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

DOI10.1016/S0304-3975(00)00048-7zbMath0951.68058WikidataQ127846314 ScholiaQ127846314MaRDI QIDQ1583347

R. Smith

Publication date: 26 October 2000

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

zbMATH Keywords

Partial evaluationimperative languagesbinding-time analysis

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

A portable approach to dynamic optimization in run-time specialization ⋮ Accurate program analyses for successful specialization of legacy system software

Cites Work

• Properties of data flow frameworks: A unified model
• Unnamed Item

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