1410 search results - page 28 / 282 » Proving theorems by reuse |
JSYML
1998
13 years 9 months ago
1998
We prove the following theorems:
SAIG
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
CADE
1992
Springer
14 years 2 months ago
1992
Springer
Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we repor...
FM
2003
Springer
14 years 3 months ago
2003
Springer
Incomplete, inaccurate, ambiguous, and volatile requirements have plagued the software industry since its inception. The convergence of model-based development and formal methods o...
CADE
2004
Springer
14 years 10 months ago
2004
Springer
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...