Accurate binding-time analysis for imperative languages
- 1 December 1997
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 32 (12), 63-73
- https://doi.org/10.1145/258994.259005
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- A framework for application generator designPublished by Association for Computing Machinery (ACM) ,1997
- A general approach for run-time specialization and its application to CPublished by Association for Computing Machinery (ACM) ,1996
- Optimistic incremental specializationACM SIGOPS Operating Systems Review, 1995
- Semantic foundations of binding-time analysis for imperative programsPublished by Association for Computing Machinery (ACM) ,1995
- The GenVoca model of software-system generatorsIEEE Software, 1994
- Software design for reliability and reusePublished by Association for Computing Machinery (ACM) ,1994
- Polyvariant binding-time analysis for applicative languagesPublished by Association for Computing Machinery (ACM) ,1993
- Incremental partial evaluationPublished by Association for Computing Machinery (ACM) ,1993
- Efficiently computing static single assignment form and the control dependence graphACM Transactions on Programming Languages and Systems, 1991
- A practical interprocedural data flow analysis algorithmCommunications of the ACM, 1978