Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CSL
2002
Springer
11 years 6 months ago
Hoare Logics for Recursive Procedures and Unbounded Nondeterminism
This paper presents sound and complete Hoare logics for partial and total correctness of recursive parameterless procedures in the context of unbounded nondeterminism. For total co...
Tobias Nipkow
JUCS
2008
166views more  JUCS 2008»
11 years 6 months ago
ASM Refinement Preserving Invariants
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...
Gerhard Schellhorn
POPL
1995
ACM
11 years 10 months ago
Total Correctness by Local Improvement in Program Transformation
The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington’s unfold-fold me...
David Sands
FM
1999
Springer
104views Formal Methods» more  FM 1999»
11 years 10 months ago
On Excusable and Inexcusable Failures
Abstract. The classical concepts of partial and total correctness identify all types of runtime errors and divergence. We argue that the associated notions of translation correctne...
Markus Müller-Olm, Andreas Wolf
CADE
2007
Springer
12 years 6 months ago
A Termination Checker for Isabelle Hoare Logic
Abstract. Hoare logic is widely used for software specification and verification. Frequently we need to prove the total correctness of a program: to prove that the program not only...
Jia Meng, Lawrence C. Paulson, Gerwin Klein
books