A cost-effective estimation of uncaught exceptions in Standard ML programs

Theoretical Computer Science

Volumn 277, Issue 1-2, 2002, Pages 185-217

  Yi, Kwangkeun ^a   Ryu, Sukyoung ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; COST EFFECTIVENESS; GRAPH THEORY; MATHEMATICAL MODELS; PROGRAM COMPILERS;

COMPILATION TIME;

COMPUTER PROGRAMMING;

EID: 0037188226     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00317-0     Document Type: Conference Paper

References (20)

1. Constraint-based program analysis
2. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
3. Compositional and inductive semantic definitions in fixpoint, equational, constraint, closure-condition, rule-based and game-theoretic form
4. Making set-constraint program analyses scale
5. Linear-time subtransitive control flow analysis
6. Flow-directed inlining
7. Type-directed flow analysis for typed intermediate languages
8. A theory of type polymorphism in programming
9. Safety analysis versus type inference
10. Partitioning dataflow analyses using types
11. Separate abstract interpretation for control-flow analysis
12. Type inference for polymorphic references
13. Compile-time detection of uncaught exceptions for Standard ML programs