Der Artikel ist weiterhin als ^^OTHERCONDITION^^ verfügbar.

Deductive Program Design

 Buch
Besorgungstitel | Lieferzeit:3-5 Tage I
ISBN-13:
9783540609476
Einband:
Buch
Seiten:
470
Autor:
Manfred Broy
Gewicht:
832 g
Format:
235xx mm
Serie:
Vol.152, NATO ASI Series F: Computer and Systems Sciences
Sprache:
Englisch
Beschreibung:

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.
This volume presents some of the most advanced research in the description of distributed systems and the design calculi of software and of hardware using functional, algebraic, logical, and programming calculi. The deductive treatment of distributed systems is presented in its complete spectrum from formal foundations and functional system specifications to assertion calculi for the verification of system programs. A highlight is the use of model checking techniques for proving properties about finite state automaton systems with extremely large state sets. It is also shown how the formalisms can be used to treat hardware systems, with emphasis on development steps leading from high-level abstractions to concrete representations. An important notion treated is that of refinement concepts in system development.

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.
This volume presents some of the most advanced research in the description of distributed systems and the design calculi of software and of hardware using functional, algebraic, logical, and programming calculi. The deductive treatment of distributed systems is presented in its complete spectrum from formal foundations and functional system specifications to assertion calculi for the verification of system programs. A highlight is the use of model checking techniques for proving properties about finite state automaton systems with extremely large state sets. It is also shown how the formalisms can be used to treat hardware systems, with emphasis on development steps leading from high-level abstractions to concrete representations. An important notion treated is that of refinement concepts in system development.
Weitere Mitwirkende: Manfred Broy
Dr. rer. nat. Manfred Broy studierte Mathematik und Informatik 1971-76 an der Technischen Universität München. Dort 1976-80 wissenschaftlicher Mitarbeiter im Sonderforschungsbereich 49 'Programmiertechnik' der DFG. 1980 Promotion, ab 1980 wisschenschaftlicher Assistent und 1982 Habilitation in Informatik an der TU München. 1983 ordentlicher Professor für Informatik und Gründungsdekan an der Fakultät für Mathematik und Informatik der Universität Passau. Seit 1989 ordentlicher Professor für Informatik an der TU München. 1994 Leibniz-Preis der DFG.
Autor: Manfred Broy
ISBN-13:: 9783540609476
ISBN: 3540609474
Verlag: Springer, Berlin
Gewicht: 832g
Seiten: 470
Sprache: Englisch
Sonstiges: Buch, 235xx mm, IX, 467 pp.