118 search results - page 7 / 24 » A simple proof of Bazzi's theorem |
134
click to vote
ENTCS
2007
15 years 6 months ago
2007
This paper proposes an extension to theorem proving interfaces for use with proofdirected debugging and other disproof-based applications. The extension is based around tracking a...
134
click to vote
CSR
2009
Springer
16 years 19 days ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
143
click to vote
FMCAD
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We present a simple method for verifying the safety properties of cache coherence protocols with arbitrarily many nodes. Our presentation begins with two examples. The fi...
150
click to vote
FORMATS
2003
Springer
15 years 11 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...
182
click to vote
TYPES
2004
Springer
15 years 11 months ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...