A calculus of logical relations for over- and underapproximating static analyses
- 28 September 2006
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 64 (1) , 29-53
- https://doi.org/10.1016/j.scico.2006.03.008
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Making abstract interpretations completeJournal of the ACM, 2000
- Abstract interpretation of reactive systemsACM Transactions on Programming Languages and Systems, 1997
- The mixed powerdomainTheoretical Computer Science, 1992
- Abstract Interpretation FrameworksJournal of Logic and Computation, 1992
- Domain theory in logical form*Annals of Pure and Applied Logic, 1991
- Abstract Interpretation, Logical Relations, and Kan ExtensionsJournal of Logic and Computation, 1990
- A semantics for complex objects and approximate queriesPublished by Association for Computing Machinery (ACM) ,1988
- Strictness analysis for higher-order functionsScience of Computer Programming, 1986
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985
- Pair algebra and its application to automata theoryInformation and Control, 1964