Control-flow analysis of higher-order languages of taming lambda
Control-flow analysis of higher-order languages of taming lambda
A unified treatment of flow analysis in higher-order languages
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Points-to analysis in almost linear time
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Componential set-based analysis
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
On the complexity of set-based analysis
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Fast and accurate flow-insensitive points-to analysis
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Infinitary control flow analysis: a collecting semantics for closure analysis
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From polyvariant flow information to intersection and union types
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Principles of Program Analysis
Principles of Program Analysis
The Java Language Specification
The Java Language Specification
Program Flow Analysis: Theory and Application
Program Flow Analysis: Theory and Application
The Cartesian Product Algorithm: Simple and Precise Type Inference Of Parametric Polymorphism
ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming
A Semantic Approach to Secure Information Flow
MPC '98 Proceedings of the Mathematics of Program Construction
Effective interprocedural optimization of object-oriented languages
Effective interprocedural optimization of object-oriented languages
| Hi-index | 0.00 |
We define a generic control-flow sensitive static analysis, Static Reduction Analysis (SRA), for an untyped object-oriented language featuring side-effects and exceptions. While its aims and range of applications closely relate to Control Flow Analysis (CFA), SRA exhibits a distinguishing feature: it only deals with abstract syntax tree (AST) nodes and does not involve approximations of environments nor stores.