Characterization and automatic identification of type infeasible call chains
- 1 October 2002
- journal article
- Published by Elsevier in Information and Software Technology
- Vol. 44 (13) , 721-732
- https://doi.org/10.1016/s0950-5849(02)00126-x
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A practical framework for demand-driven interprocedural data flow analysisACM Transactions on Programming Languages and Systems, 1997
- Call graph construction in object-oriented languagesPublished by Association for Computing Machinery (ACM) ,1997
- Interprocedural slicing using dependence graphsACM Transactions on Programming Languages and Systems, 1990
- The program dependence graph and its use in optimizationACM Transactions on Programming Languages and Systems, 1987
- Qualified Data Flow ProblemsIEEE Transactions on Software Engineering, 1981