96 search results - page 11 / 20 » On Several Proofs of the Recognizability Theorem |
93
Voted
ENTCS
2006
14 years 9 months ago
2006
We report on an experiment in combining Isabelle with automatic first-order arithmetic provers to increase automation on the verification of distributed protocols. As a case study...
IPL
2007
14 years 9 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
90
Voted
CSL
2008
Springer
14 years 11 months ago
2008
Springer
We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some &...
80
Voted
CORR
2004
Springer
14 years 9 months ago
2004
Springer
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
VMCAI
2004
Springer
15 years 2 months ago
2004
Springer
The method of Invisible Invariants was developed originally in order to verify safety properties of parameterized systems fully automatically. Roughly speaking, the method is based...