Sciweavers

136 search results - page 7 / 28
» Proving Properties of Lazy Functional Programs with Sparkle
Sort
View
ECCC
2011
185views ECommerce» more  ECCC 2011»
13 years 5 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef
ICLP
2010
Springer
13 years 8 months ago
A Framework for Verification and Debugging of Resource Usage Properties: Resource Usage Verification
We present a framework for (static) verification of general resource usage program properties. The framework extends the criteria of correctness as the conformance of a program to ...
Pedro López-García, Luthfi Darmawan,...
MOR
2010
91views more  MOR 2010»
13 years 9 months ago
On the One-Dimensional Optimal Switching Problem
We explicitly solve the optimal switching problem for one-dimensional diffusions by directly employing the dynamic programming principle and the excessive characterization of the ...
Erhan Bayraktar, Masahiko Egami
ENTCS
2000
80views more  ENTCS 2000»
13 years 10 months ago
Behavioral and Coinductive Rewriting
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including noti...
Joseph A. Goguen, Kai Lin, Grigore Rosu
FPCA
1995
14 years 2 months ago
Once Upon a Type
A number of useful optimisations are enabled if we can determine when a value is accessed at most once. We extend the Hindley-Milner type system with uses, yielding a typeinferenc...
David N. Turner, Philip Wadler, Christian Mossin