Abstract. This paper shows how a machine-code Hoare logic is used to lift reasoning from the tedious operational model of a machine language to a manageable level of abstraction without making simplifying assumptions. A Hoare logic is placed on top of a high-fidelity model of the ARM instruction

Abstract. This paper presents a mechanised Hoare-style programming logic framework for assembly level programs. The framework has been designed to fit on top of operational semantics of realistically modelled machine code. Many ad hoc restrictions and features present in real machine-code

, which renders the garbage collector more complex and less trustworthy. We present a formal verifica-tion of the Yuasa incremental garbage collector in Hoare-style logic. The specification and proof of the collector are built on a concrete machine model and cover detailed behaviors of the collector which

. We investigate the completeness of Hoare logic on the propositional level. In particular, the expressiveness requirements of Cook's proof are characterized propositionally. We give a completeness result for propositional Hoare logic (PHL): all relationally valid rules fb1g p1 fc1g

Z is gaining ground in the software development community as a specification language, but there is at present no standard way of relating a Z specification to program code. Hoare logics have been around for about 20 years. They are well understood and widely taught as a method of proving that a

Abstract. We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method uses a form of symbolic execution, a decidable proof theory for symbolic heaps, and extraction of frame

machine (ARM), which has an extremely compact instruction set and imposes no restrictions on the implemented TRSs. Apart from standard conditional term rewriting, associative lists are supported. ARM code is translated to (ANSI) C; the resulting execution speeds are good (on a sun4, an average of 80000

Hoare Logic and the operation decomposition rules of the Vienna Development Method (VDM) with respect to operational semantics. We deal with parameterless recursive procedures and local variables in the context of total correctness. As a case study, we use LEGO to verify the correctness of Quicksort

Abstract. Hoare logic and proof-carrying code are two independent frameworks for reasoning that programs meet their specifications. In this paper, we merge the two approaches by embedding axiomatic specifications in a type system for foundational proof-carrying code. By annotating programs

specification statements to the programming language and use them instead of actual code. Specification statements represent the maximal program satisfying a given Hoare-triple. Sound and (relatively) complete simulation techniques allow for proving data refinement by local arguments. A major challenge