632 search results - page 7 / 127 » Combining programming with theorem proving |
ASE
2006
13 years 7 months ago
2006
The structured programming literature provides methods and a wealth of heuristic knowledge for guiding the construction of provably correct imperative programs. We investigate the...
AMAI
2000
Springer
13 years 7 months ago
2000
Springer
This is a prospective on the research in the intersection of mathematics and artificial intelligence that I see as having been the most important over the past 10 years and that I...
CADE
2001
Springer
14 years 8 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...
CADE
2007
Springer
14 years 8 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
ECOOP
1998
Springer
13 years 12 months ago
1998
Springer
This paper presents an imperative object calculus designed to support class-based programming via a combination of extensible objects and encapsulation. This calculus simplifies th...