1410 search results - page 24 / 282 » Proving theorems by reuse |
CADE
2001
Springer
14 years 10 months ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
VSTTE
2005
Springer
14 years 3 months ago
2005
Springer
How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and p...
ECAI
1994
Springer
14 years 2 months ago
1994
Springer
1 We develop a learning component for a theorem prover designed for verifying statements by mathematical induction. If the prover has found a proof, it is analyzed yielding a so-ca...
AISC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Origami (paper folding) has a long tradition in Japan's culture and education. We are developing a computational origami system, based on symbolic computation system...
BIRTHDAY
2006
Springer
14 years 1 months ago
2006
Springer
The COL institution (constructor-based observational logic) has been introduced as a formal framework to specify both generationand observation-oriented properties of software syst...