Scalable context-sensitive flow analysis using instantiation constraints
- 1 May 2000
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 35 (5) , 253-263
- https://doi.org/10.1145/358438.349332
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Interconvertbility of set constraints and context-free language reachabilityACM SIGPLAN Notices, 1997
- Linear-time subtransitive control flow analysisACM SIGPLAN Notices, 1997
- LackwitPublished by Association for Computing Machinery (ACM) ,1997
- Points-to analysis in almost linear timePublished by Association for Computing Machinery (ACM) ,1996
- Efficient context-sensitive pointer analysis for C programsACM SIGPLAN Notices, 1995
- Precise interprocedural dataflow analysis via graph reachabilityPublished by Association for Computing Machinery (ACM) ,1995
- An analysis of ML typabilityJournal of the ACM, 1994
- Type inference with polymorphic recursionACM Transactions on Programming Languages and Systems, 1993
- The Undecidability of the Semi-unification ProblemInformation and Computation, 1993