1410 search results - page 126 / 282 » Proving theorems by reuse |
176
click to vote
JAR
2006
15 years 6 months ago
2006
We describe an approach to verifying bit-level pipelined machine models using a combination of deductive reasoning and decision procedures. While theorem proving systems such as AC...
147
click to vote
JUCS
2006
15 years 5 months ago
2006
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
165
click to vote
MLQ
2010
15 years 4 months ago
2010
: It is well known that, in a topological space, the open sets can be characterized using filter convergence. In ZF (Zermelo-Fraenkel set theory without the Axiom of Choice), we c...
242
click to vote
IFM
2010
Springer
15 years 3 months ago
2010
Springer
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
179
click to vote
LICS
2010
IEEE
15 years 3 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...