3228 search results - page 288 / 646 » Computationally Sound Proofs |
114
Voted
FATES
2003
Springer
15 years 9 months ago
2003
Springer
Most efforts to combine formal methods and software testing go in the direction of exploiting formal methods to solve testing problems, most commonly test case generation. Here we ...
128
Voted
FORMATS
2003
Springer
15 years 9 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
146
click to vote
WOLLIC
2010
Springer
15 years 9 months ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
113
Voted
FOSSACS
2001
Springer
15 years 9 months ago
2001
Springer
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple...
131
click to vote
ASIACRYPT
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Naor and Pinkas introduced metering schemes at Eurocrypt ’98 in order to decide on advertisement fees for web servers. In the schemes, any server should be able to cons...