Control-flow analysis of higher-order languages of taming lambda
Control-flow analysis of higher-order languages of taming lambda
Abstract interpretation and application to logic programs
Journal of Logic Programming
Set based program analysis
Safety analysis versus type inference
Information and Computation
Storage use analysis and its applications
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Linear-time subtransitive control flow analysis
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Infinitary control flow analysis: a collecting semantics for closure analysis
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A practical and flexible flow analysis for higher-order languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Componential set-based analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Principles of Program Analysis
Principles of Program Analysis
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A proof method for the corectness of modularized OCFA
Information Processing Letters
Definitional Interpreters for Higher-Order Programming Languages
Higher-Order and Symbolic Computation
Abstract Interpretation of Algebraic Polynomial Systems (Extended Abstract)
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Modular Static Program Analysis
CC '02 Proceedings of the 11th International Conference on Compiler Construction
Proceedings of the 7th International Conference on Computer Aided Verification
Flexible and practical flow analysis for higher-order programming languages
Flexible and practical flow analysis for higher-order programming languages
Modular control-flow analysis with rank 2 intersection types
Mathematical Structures in Computer Science
Relating models of backtracking
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Modular set-based analysis from contracts
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type-sensitive control-flow analysis
Proceedings of the 2006 workshop on ML
A Calculational Approach to Control-Flow Analysis by Abstract Interpretation
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Abstract interpreters for free
SAS'10 Proceedings of the 17th international conference on Static analysis
Flow-sensitive type recovery in linear-log time
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Control-flow analysis of function calls and returns by abstract interpretation
Information and Computation
Control-flow analysis of functional programs
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Shivers's escape technique enables one to analyse the control flow of higher-order program fragments. It is widely used, but its soundness has never been proven. In this paper, we present the first soundness proof for the technique. Our proof is structured as a composition of Galois connections and thus rests on the foundations of abstract interpretation.