1302 search results - page 37 / 261 » Free-Style Theorem Proving |
MOC
1998
14 years 9 months ago
1998
This paper (1) gives complete details of an algorithm to compute approximate kth roots; (2) uses this in an algorithm that, given an integer n > 1, either writes n as a perfect ...
106
click to vote
FAC
2010
14 years 7 months ago
2010
Framing in the presence of data abstraction is a challenging and important problem in the verification of object-oriented programs [LLM07]. The dynamic frames approach is a promisi...
SAIG
2001
Springer
15 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
15 years 1 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
15 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...