1199 search results - page 33 / 240 » Parameterized Proof Complexity |
SIAMCOMP
2008
13 years 8 months ago
2008
We give constructions of probabilistically checkable proofs (PCPs) of length n
CASSIS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Abstract interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctn...
LOGCOM
2010
13 years 7 months ago
2010
The logic of proofs (LP) was proposed as Gödel’s missed link between Intuitionistic and S4-proofs, but so far the tableau-based methods proposed for LPhave not explored this cl...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
The excessive complexity of both machine architectures and applications have made it difficult for compilers to statically model and predict application behavior. This observatio...
DKE
2007
13 years 8 months ago
2007
We introduce parameterized pattern queries as a new paradigm to extend traditional pattern expressions over sequence databases. A parameterized pattern is essentially a string mad...