602 search results - page 2 / 121 » Program Calculation in Coq |
TPHOL
2002
IEEE
14 years 15 days ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
MKM
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Formal verification of numerical programs is notoriously difficult. On the one hand, there exist automatic tools specialized in floatingpoint arithmetic, such as Gappa...
ENTCS
2008
13 years 7 months ago
2008
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
ENTCS
2006
13 years 7 months ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
JAR
2008
13 years 7 months ago
2008
This article presents the formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C and compiler intermediate languages. Be...