Suchergebnisse - Tucker, John V.

Program correctness over abstract data types, with error-state semantics

Algebraic specifications of computable and semicomputable datatypes

Top-down design and the algebra of communicating processes

The axiomatic semantics of programs based on Hoare's logic

Hoare's logic for programming languages with two data types

Two theorems about the completeness of Hoare's logic

Computing in algebraic systems

On bounds for the specification of finite data types by means of equations and conditional equations

A natural data type with a finite equational final semantics specification but no effective equational initial semantics specification

On the operational structure of algebraic programming systems

On the refinement of specifications and Hoare's logic

Completeness of the algebraic specification methods for data types

Algebraic specifications of computable and semicomputable data structures

A characterisation of computable data types by means of a finite, equational specification method

Floyd's principle, correctness theories and program equivalence

Algebraic specifications of computable and semicomputable datatypes

Hoare's logic and Peano's arithmetic

Initial and final algebra semantics for data type specifications: two characterisation theorems

Theory of computation and specification over abstract data types, and its applications: [working material for the lectures of John V. Tucker, International Summer School on Logic, Algebra and Computation, Marktoberdorf, Germany, July 25 - Aug. 6, 1989]

Program Correctness over abstract data types, with error-state semantics