Calculating sized types

Higher-Order and Symbolic Computation

Volumn 14, Issue 2-3, 2001, Pages 261-300

  Chin, Wei Ngan ^a   Khoo, Siau Cheng ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Presburger formulae; Program analysis and optimization; Type inference

Indexed keywords

ARRAY BOUNDS CHECKING; OMEGA CALCULATOR; PRESBURGER FORMULAE; PROGRAM ANALYSIS; PROGRAM OPTIMIZATION; TERMINATION ANALYSIS; TYPE INFERENCE;

ALGORITHMS; CALCULATIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE SELECTION AND EVALUATION; CONSTRAINT THEORY; DIGITAL ARITHMETIC; OPTIMIZATION; RECURSIVE FUNCTIONS; SEMANTICS;

PROGRAM DIAGNOSTICS;

EID: 0035466058     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1012996816178     Document Type: Article

References (30)

1. Inferring argument size relationships with CLP(R)
2. Typed norms
3. Inference of inequality constraints in logic programs
4. A bounds inference method for vector-based memoisation
5. Deriving pre-conditions for array bound check elimination
6. Programs for mechanical program verification
7. Automatic discovery of linear restraints among variables of a program
8. Termination of logic programs: The never-ending story
9. BTA algorithms to ensure termination of off-line partial evaluation
10. About synchronous programming and abstract interpretation
11. Verification of real-time systems using linear relation analysis
12. Type inference with polymorphic recursion
13. Finiteness analysis
14. Proving the correctness of reactive systems using sized types
15. Dynamic partitioning in analyses of numerical properties
16. The omega library version 1.1.0 interface guide
17. Transitive closure of infinite graphs and its applications
18. Lower-bound time-complexity analysis of logic programs
19. Parametric polymorphic type inference in constraint form
20. Type inference with constrained types
21. Termination proofs for logic programs
22. The omega test: A fast practical integer programming algorithm for dependence analysis
23. Termination detection in logic programs using argument sizes (extended abstract)
24. Termination analysis of Mercury
25. Efficient tests for top-down termination of logical rules
26. Eliminating array bound checking through dependent types
27. Dependent types in practical programming