|
108
|
Set-based analysis of ML programs
– N Heintze
- 1994
|
|
267
|
Control-Flow Analysis of Higher-Order Languages
– Olin Shivers
- 1991
|
|
55
|
Closure Analysis in Constraint Form
– Jens Palsberg
- 1995
|
|
1635
|
Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
– P Cousot, R Cousot
- 1977
|
|
180
|
Control Flow Analysis in Scheme
– Olin Shivers
- 1988
|
|
49
|
Effective Flow Analysis for Avoiding Run-Time Checks
– Suresh Jagannathan, Andrew Wright
- 1995
|
|
72
|
Lightweight Closure Conversion
– Paul A. Steckler, Mitchell Wand
- 1996
|
|
1497
|
The Definition of Standard ML
– R Milner, M Tofte, R Harper
- 1990
|
|
595
|
Compiling with Continuations
– Andrew Appel
- 1992
|
|
87
|
The interprocedural analysis and automatic parallelization of Scheme programs
– W L HARRISON
- 1989
|
|
79
|
Abstract interpretation: a semantics-based tool for program analysis
– Neil D Jones, Flemming Nielson
- 1994
|
|
71
|
A Unified Treatment of Flow Analysis in Higher-Order Languages
– Suresh Jagannathan, Stephen Weeks
- 1995
|
|
1182
|
A Structural Approach to Operational Semantics
– G. D. Plotkin
- 1981
|
|
544
|
Systematic design of program analysis frameworks
– Patrick Cousot, Radhia Cousot
- 1979
|
|
66
|
Formal Language, Grammar and Set-Constraint-Based Program Analysis by Abstract Interpretation
– Patrick Cousot, Radhia Cousot
- 1995
|
|
48
|
Analysis and Efficient Implementation of Functional Programs
– Peter Sestoft
- 1991
|
|
45
|
The Semantics of Future and Its Use in Program Optimization
– Cormac Flanagan, Matthias Felleisen
- 1995
|
|
65
|
Space-Efficient Closure Representations
– Zhong Shao, Andrew W. Appel
- 1994
|
|
9
|
Polyvariant binding-time analysis for higher-order, applicative languages
– Charles Consel
- 1993
|
