A survey of various results concerning Hoare's approach to proving partial and total
correctness of programs is presented. Emphasis is placed on the soundness and …

We consider the problem of reconciling a dependently typed functional language with
imperative features such as mutable higher-order state, pointer aliasing, and …

In previous work, we proposed a Hoare Type Theory (HTT) which combines effectful higher-
order functions, dependent types and Hoare Logic specifications into a unified framework …

Publisher Summary This chapter presents a number of ideas that originated an evolution of
programming from arts and crafts to a science. The chapter describes computer arithmetic in …

Hoare logic is bedevilled by complex but coarse side conditions on the use of variables. We
define a logic, free of side conditions, which permits more precise statements of a program's …

The multiple assignment statement is defined in full generality—including assignment to
subscripted variables and record fields—using the “axiomatic” approach of Hoare. Proof …

Building semantic models that account for various kinds of indirect reference has
traditionally been a difficult problem. Indirect reference can appear in many guises, such as …

In this paper, we evaluate performance of a real-world image processing application that
uses a cross-correlation algorithm to compare a given image with a reference one. We …

References are indispensable to computing practice. Unlike deep copying, reference
copying permits constant-time data assignment and parameter passing for all objects …

This paper presents a uniform approach to known and new results on relative completeness
of Hoare-like calculi for languages of ALGOL-like programs with procedures as procedure …