632 search results - page 18 / 127 » Combining programming with theorem proving |
POPL
2005
ACM
14 years 8 months ago
2005
ACM
This paper presents a new approach for verifying confidenfor programs, based on abstract interpretation. The framework is formally developed and proved correct in the theorem prov...
ALGORITHMICA
2006
13 years 7 months ago
2006
Abstract. In this paper we prove the optimality and other properties of the -adic nonadjacent form: this expansion has been introduced in order to efficiently compute scalar multip...
CADE
2003
Springer
14 years 8 months ago
2003
Springer
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
JAR
2002
13 years 7 months ago
2002
Abstract. Can theorem proving in mathematical logic be addressed by classical mathematical techniques like the calculus of variations? The answer is surprisingly in the affirmative...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Following the idea developed by I. Simon in his theorem of Ramseyan factorisation forests, we develop a result of ‘deterministic factorisations’. This extra determinism propert...