1410 search results - page 22 / 282 » Proving theorems by reuse |
FSTTCS
2008
Springer
13 years 11 months ago
2008
Springer
ABSTRACT. In many automated methods for proving inductive theorems, finding a suitable generalization of a conjecture is a key for the success of proof attempts. On the other hand...
ASM
2003
ASM
14 years 3 months ago
2003
ASM
r in: Abstract State Machines 2003 — Advances in Theory and Applications, Proc. 10th International Workshop, Taormina, Italy, March 3-7, 2003, eds. Egon Boerger, Angelo Gargantin...
FASE
2000
Springer
14 years 1 months ago
2000
Springer
We present a family of tools for program development and verification, comprising the transformation system TAS and the theorem proving interface IsaWin. Both are based on the theo...
CADE
2006
Springer
14 years 10 months ago
2006
Springer
We describe here a formal proof in the Coq system of the structure theorem for subresultants, which allows to prove formally the correctness of our implementation of the subresulta...
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
Abstract. We address the general problem of automatically proving safety properties of reactive systems within the UNITY model. We take up a relational and set-based approach, and ...