Polymorphic Time Systems for Estimating Program Complexity (1991)

by Vincent Dornic , Pierre Jouvelot , David K. Gifford
Venue:IN JTASPEFL'91
Citations:22 - 6 self

Documents Related by Co-Citation

46 Static dependent costs for estimating execution time – Brian Reistad, David K. Gifford - 1994
51 ACE: an automatic complexity evaluator РD Le M̩tayer
77 Automatic complexity analysis – M Rosendahl - 1989
85 Mechanical program analysis – B Wegbreit - 1975
31 Calculi for Time Analysis of Functional Programs – David Sands - 1990
27 A compositional approach to time analysis of first order lazy functional programs – B Bjemer, A Holmstrom - 1989
47 Complexity Analysis for a Lazy Higher-Order Language – David Sands - 1990
84 A Type System for Bounded Space and Functional in-Place Update – Martin Hofmann - 2000
35 Strictness Analysis Aids Time Analysis – Philip Wadler - 1988
116 Resource Bound Certification – Karl Crary, Stephanie Weirich - 2000
13 Mechanical analysis of program complexity – D LeM'etayer - 1985
25 Separate Abstract Interpretation for Control-Flow Analysis – Yan Mei Tang, Pierre Jouvelot - 1994
1290 A Structural Approach to Operational Semantics – G. D. Plotkin - 1981
120 Proving the correctness of reactive systems using sized types – John Hughes, Lars Pareto, Amr Sabry - 1996
10 Polymorphic Type, Region and E ect Inference – J Talpin, P Jouvelot - 1992
92 Operational Semantics and Polymorphic Type Inference – Mads Tofte - 1988
57 Automatic Average-Case Analysis Of Algorithms – Philippe Flajolet, E De Recherche, Et En Automatique, Domaine De Voluceau, Bruno Salvy, Bruno Salvy, Paul Zimmermann, Paul Zimmermann - 1991
108 Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories – K Mehlhorn, U Vishkin - 1989
7 Using Futures to Exploit Parallelism – S L Gray - 1986