On the Complexity Analysis of Static Analyses
- 1 October 1999
- book chapter
- Published by Springer Nature
- p. 312-329
- https://doi.org/10.1007/3-540-48294-6_21
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Breaking through then3 barrier: Faster object type inferenceTheory and Practice of Object Systems, 1999
- Partial online cycle elimination in inclusion constraint graphsPublished by Association for Computing Machinery (ACM) ,1998
- Efficient Inference of Object TypesInformation and Computation, 1995
- Efficient inference of partial typesJournal of Computer and System Sciences, 1994
- Set-based analysis of ML programsPublished by Association for Computing Machinery (ACM) ,1994
- Soft typing with conditional typesPublished by Association for Computing Machinery (ACM) ,1994
- Efficient analyses for realistic off-line partial evaluationJournal of Functional Programming, 1993
- Automatic recognition of tractability in inference relationsJournal of the ACM, 1993
- Bottom-up beats top-down for datalogPublished by Association for Computing Machinery (ACM) ,1989
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984