On the complexity of set-based analysis
- 1 August 1997
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 32 (8) , 150-163
- https://doi.org/10.1145/258948.258963
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Constrained types and their expressivenessACM Transactions on Programming Languages and Systems, 1996
- A type system equivalent to flow analysisPublished by Association for Computing Machinery (ACM) ,1995
- Type analysis of Prolog using type graphsPublished by Association for Computing Machinery (ACM) ,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
- Type inclusion constraints and type inferencePublished by Association for Computing Machinery (ACM) ,1993
- Subtyping recursive typesPublished by Association for Computing Machinery (ACM) ,1991
- A finite presentation theorem for approximating logic programsPublished by Association for Computing Machinery (ACM) ,1990
- Declaration-free type checkingPublished by Association for Computing Machinery (ACM) ,1985
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977