9783540609476: Deductive Program Design: 152

Sinossi

Advanced research on the description of distributed systems and on design calculi for software and hardware is presented in this volume. Distinguished researchers give an overview of the latest state of the art.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Contenuti

On Traditions in Marktoberdorf (Banquet Speech).- 0. Examples of Proof Design.- Fibonacci and the Greatest Common Divisor (EWD1077).- The Balance and the Coins (EWD1083).- Bulterman’s Theorem on Shortest Trees (EWD1131).- A Prime is in at Most 1 Way the Sum of 2 Squares (EWD1155a).- A Bagatelle on Euclid’s Algorithm (EWD1158).- On Two Equations that Have the Same Extreme Solution (EWD1168).- An Alternative of the ETAC to EWD1163 (EWD1169).- The Argument about the Arithmetic Mean and the Geometric Mean, Heuristics Included (EWD1171).- 1. Mathematical Models of Programming.- Interaction Categories and the Foundations of Typed Concurrent Programming.- Mathematical Models for Computing Science.- 2. Techniques of Program Derivation.- The Algebra of Programming.- Data Refinement and the Transform.- 3. Logic of Concurrency.- On TLA as a Logic.- Specification and Refinement of a Buffer of Length One.- Model Checking.- Notes on Proof Outline Logic.- 4. Method of Hardware Design.- Proof and Design.- A Program Transformation Approach to Asynchronous VLSI Design.

Product Description

Book by None

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.