Sciweavers

989 search results - page 144 / 198
» Pebbling and Proofs of Work
Sort
View
ECOOP
2010
Springer
13 years 11 months ago
Verifying Executable Object-Oriented Specifications with Separation Logic
Specifications of Object-Oriented programs conventionally employ Boolean expressions of the programming language for assertions. Programming errors can be discovered by checking at...
Stephan van Staden, Cristiano Calcagno, Bertrand M...
APPROX
2008
Springer
90views Algorithms» more  APPROX 2008»
13 years 10 months ago
Tensor Products of Weakly Smooth Codes Are Robust
: We continue the study of robustly testable tensor codes and expand the class of base codes that can be used as a starting point for the construction of locally testable codes via...
Eli Ben-Sasson, Michael Viderman
BIRTHDAY
2008
Springer
13 years 10 months ago
From Domain to Requirements
This is a discursive paper. That is, it shows some formulas (but only as examples so that the reader may be convinced that there is, perhaps, some substance to our claims), no theo...
Dines Bjørner
CEC
2008
IEEE
13 years 10 months ago
Directed trees: A powerful representation for sorting and ordering problems
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
Benjamin Doerr, Edda Happ
ECLIPSE
2005
ACM
13 years 10 months ago
Instant IDEs: supporting new languages in the CDT
While Eclipse has greatly simplified the task of creating integrated development environments, creating a full-featured IDE can still take years. Fortunately, for a large categor...
Jeffrey Overbey, Craig Rasmussen