10715 search results - page 25 / 2143 » From Tests to Proofs |
CC
2008
Springer
13 years 8 months ago
2008
Springer
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a natural confluence of higher-order hereditary Harrop formulas (HH formulas), Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programmi...
AC
2000
Springer
13 years 7 months ago
2000
Springer
Abstract. In the late 80's Blum, Luby, Rubinfeld, Kannan et al. pioneered the theory of self
JLP
2008
13 years 7 months ago
2008
We explore the power of relational semantics and equational reasoning in the style of Kleene algebra for analyzing programs with mutable, statically scoped local variables. We prov...
GI
2007
Springer
14 years 2 months ago
2007
Springer
: In addition to the growing complexity of software systems, test effort takes increasing amounts of time and correspondingly more money. Testing costs may be reduced without compr...