Sciweavers

290 search results - page 18 / 58
» Theorem Proving Using Lazy Proof Explication
Sort
View

Publication
101views
13 years 3 months ago
On the degree and half-degree principle for symmetric polynomials
In this note we aim to give a new, elementary proof of a statement that was first proved by Timofte (2003) [15]. It says that a symmetric real polynomial F of degree d in n variabl...
Cordian Riener
TAP
2008
Springer
153views Hardware» more  TAP 2008»
14 years 9 months ago
Bounded Relational Analysis of Free Data Types
Abstract. In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of ...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
CORR
2008
Springer
70views Education» more  CORR 2008»
14 years 9 months ago
Every Computably Enumerable Random Real Is Provably Computably Enumerable Random
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
Cristian S. Calude, Nicholas J. Hay
ATVA
2004
Springer
138views Hardware» more  ATVA 2004»
15 years 1 months ago
Providing Automated Verification in HOL Using MDGs
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
Tarek Mhamdi, Sofiène Tahar
GI
2001
Springer
15 years 2 months ago
Formal Analysis of a Self-Stabilizing Algorithm Using Predicate Diagrams
We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized base...
Dominique Cansell, Dominique Méry, Stephan ...