Sciweavers

861 search results - page 1 / 173
» Polymorphic Time Systems for Estimating Program Complexity
Sort
View
SAS
1991
Springer
13 years 8 months ago
Polymorphic Time Systems for Estimating Program Complexity
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjun...
Vincent Dornic, Pierre Jouvelot, David K. Gifford
PEPM
2009
ACM
14 years 1 months ago
Guided model checking for programs with polymorphism
Exhaustive model checking search techniques are ineffective for error discovery in large and complex multi-threaded software systems. Distance estimate heuristics guide the concre...
Neha Rungta, Eric G. Mercer
RTDB
1996
84views more  RTDB 1996»
13 years 5 months ago
Performance-Polymorphic Execution of Real-Time Queries
We are developing an object-oriented real-time database system that includes a relationally complete query language. Unlike conventional query optimizers, our optimizer estimates ...
Thomas Padron-McCarthy, Tore Risch
ICFP
1998
ACM
13 years 8 months ago
Intensional Polymorphism in Type-Erasure Semantics
Intensional polymorphism, the ability to dispatch to different routines based on types at run time, enables a variety of advanced implementation techniques for polymorphic languag...
Karl Crary, Stephanie Weirich, J. Gregory Morriset...
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 4 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui