Sciweavers

1445 search results - page 125 / 289
» Uniformly Hard Languages
Sort
View
ECOOP
1998
Springer
15 years 8 months ago
Flexible Alias Protection
Aliasing is endemic in object oriented programming. Because an object can be modified via any alias, object oriented programs are hard to understand, maintain, and analyse. Flexibl...
James Noble, Jan Vitek, John Potter
SIGADA
1998
Springer
15 years 8 months ago
Testing Generic Ada Packages with APE
Despite substantial research on methods and tools for testing reusable modules, little help is available for the tester in the eld. Commercial tools for system testing are widely ...
Daniel Hoffman, Jayakrishnan Nair, Paul A. Stroope...
EUROCRYPT
2006
Springer
15 years 7 months ago
Perfect Non-interactive Zero Knowledge for NP
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
Jens Groth, Rafail Ostrovsky, Amit Sahai
137
Voted
PPDP
2000
Springer
15 years 7 months ago
A model for comparing the space usage of lazy evaluators
Identifying the source of space faults in functional programs is hard. The problem is compoundedas space usage can vary enormously from one implementation to another. We use a ter...
Adam Bakewell, Colin Runciman
110
Voted
ECOOP
2008
Springer
15 years 5 months ago
ReCrash: Making Software Failures Reproducible by Preserving Object States
It is very hard to fix a software failure without being able to reproduce it. However, reproducing a failure is often difficult and time-consuming. This paper proposes a novel tech...
Shay Artzi, Sunghun Kim, Michael D. Ernst