13383 search results - page 286 / 2677 » Abstractions from proofs |
197
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
178
click to vote
TYPES
2000
Springer
15 years 10 months ago
2000
Springer
We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is a set of axioms for the constructive real numbers as used in the FTA (Fundamenta...
180
click to vote
ANSS
1991
IEEE
15 years 10 months ago
1991
IEEE
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...
205
Voted
AISC
2010
Springer
15 years 10 months ago
2010
Springer
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
157
click to vote
ESOP
2010
Springer
15 years 10 months ago
2010
Springer
Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser inter...