Zum Hauptinhalt springen
Dekorationsartikel gehören nicht zum Leistungsumfang.
A Practical Theory of Programming
Taschenbuch von Eric C. R. Hehner
Sprache: Englisch

46,95 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 2-4 Werktage

Kategorien:
Beschreibung
There are several theories of programming. The first usable theory, often called "Hoare's Logic", is still probably the most widely known. In it, a specification is a pair of predicates: a precondition and postcondition (these and all technical terms will be defined in due course). Another popular and closely related theory by Dijkstra uses the weakest precondition predicate transformer, which is a function from programs and postconditions to preconditions. lones's Vienna Development Method has been used to advantage in some industries; in it, a specification is a pair of predicates (as in Hoare's Logic), but the second predicate is a relation. Temporal Logic is yet another formalism that introduces some special operators and quantifiers to describe some aspects of computation. The theory in this book is simpler than any of those just mentioned. In it, a specification is just a boolean expression. Refinement is just ordinary implication. This theory is also more general than those just mentioned, applying to both terminating and nonterminating computation, to both sequential and parallel computation, to both stand-alone and interactive computation. And it includes time bounds, both for algorithm classification and for tightly constrained real-time applications.
There are several theories of programming. The first usable theory, often called "Hoare's Logic", is still probably the most widely known. In it, a specification is a pair of predicates: a precondition and postcondition (these and all technical terms will be defined in due course). Another popular and closely related theory by Dijkstra uses the weakest precondition predicate transformer, which is a function from programs and postconditions to preconditions. lones's Vienna Development Method has been used to advantage in some industries; in it, a specification is a pair of predicates (as in Hoare's Logic), but the second predicate is a relation. Temporal Logic is yet another formalism that introduces some special operators and quantifiers to describe some aspects of computation. The theory in this book is simpler than any of those just mentioned. In it, a specification is just a boolean expression. Refinement is just ordinary implication. This theory is also more general than those just mentioned, applying to both terminating and nonterminating computation, to both sequential and parallel computation, to both stand-alone and interactive computation. And it includes time bounds, both for algorithm classification and for tightly constrained real-time applications.
Zusammenfassung
This book explores aspects of programming that are amenable to mathematical proof. The author describes a programming theory which is simpler and more comprehensive than the current theories to date. The text will be useful to students in courses on programming methodology or verification at the advanced undergraduate or beginning graduate level, as well as for software engineers in the field.
Inhaltsverzeichnis
1 Basic Theories.- Boolean Theory.- Number Theory.- Character Theory.- 2 Basic Data Structures.- Bunch Theory.- Set Theory.- String Theory.- List Theory.- 3 Function Theory.- Functions.- Quantifiers.- Function Fine Points.- 4 Program Theory.- Specifications.- Program Development.- Time.- Robustness.- Refinement in Place.- 5 Programming Language.- Scope.- Data Structures.- Control Structures.- Time Dependence.- Assertions.- Subprogram.- Alias.- Functional Programming.- 6 Recursive Definition.- Recursive Data Definition.- Recursive Program Definition.- Limits.- 7 Theory Design and Implementation.- Data Theories.- Program Theories.- Specification by Implementation.- 8 Concurrency.- Independent Composition.- Circuit Design.- Found Concurrency.- 9 Communication.- Implementability.- Input and Output.- Recursively Defined Communication.- Input Composition.- Reaction Controller.- Communicating Processes.- Power Series Multiplication.- 10 Exercises.- Basic Theories.- Basic Data Structures.- Function Theory.- Program Theory.- Programming Language.- Recursive Definition.- Theory Design and Implementation.- Concurrency.- Communication.- 11 Reference.- Justifications.- Sources.- Axioms and Laws.- Symbols and Names.- Precedence.
Details
Erscheinungsjahr: 2012
Genre: Importe, Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Reihe: Monographs in Computer Science
Inhalt: x
247 S.
ISBN-13: 9781461264446
ISBN-10: 1461264448
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Hehner, Eric C. R.
Auflage: Softcover reprint of the original 1st ed. 1993
Hersteller: Springer New York
Springer US, New York, N.Y.
Monographs in Computer Science
Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, D-69121 Heidelberg, juergen.hartmann@springer.com
Maße: 254 x 178 x 15 mm
Von/Mit: Eric C. R. Hehner
Erscheinungsdatum: 03.09.2012
Gewicht: 0,496 kg
Artikel-ID: 105651597
Zusammenfassung
This book explores aspects of programming that are amenable to mathematical proof. The author describes a programming theory which is simpler and more comprehensive than the current theories to date. The text will be useful to students in courses on programming methodology or verification at the advanced undergraduate or beginning graduate level, as well as for software engineers in the field.
Inhaltsverzeichnis
1 Basic Theories.- Boolean Theory.- Number Theory.- Character Theory.- 2 Basic Data Structures.- Bunch Theory.- Set Theory.- String Theory.- List Theory.- 3 Function Theory.- Functions.- Quantifiers.- Function Fine Points.- 4 Program Theory.- Specifications.- Program Development.- Time.- Robustness.- Refinement in Place.- 5 Programming Language.- Scope.- Data Structures.- Control Structures.- Time Dependence.- Assertions.- Subprogram.- Alias.- Functional Programming.- 6 Recursive Definition.- Recursive Data Definition.- Recursive Program Definition.- Limits.- 7 Theory Design and Implementation.- Data Theories.- Program Theories.- Specification by Implementation.- 8 Concurrency.- Independent Composition.- Circuit Design.- Found Concurrency.- 9 Communication.- Implementability.- Input and Output.- Recursively Defined Communication.- Input Composition.- Reaction Controller.- Communicating Processes.- Power Series Multiplication.- 10 Exercises.- Basic Theories.- Basic Data Structures.- Function Theory.- Program Theory.- Programming Language.- Recursive Definition.- Theory Design and Implementation.- Concurrency.- Communication.- 11 Reference.- Justifications.- Sources.- Axioms and Laws.- Symbols and Names.- Precedence.
Details
Erscheinungsjahr: 2012
Genre: Importe, Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Reihe: Monographs in Computer Science
Inhalt: x
247 S.
ISBN-13: 9781461264446
ISBN-10: 1461264448
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Hehner, Eric C. R.
Auflage: Softcover reprint of the original 1st ed. 1993
Hersteller: Springer New York
Springer US, New York, N.Y.
Monographs in Computer Science
Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, D-69121 Heidelberg, juergen.hartmann@springer.com
Maße: 254 x 178 x 15 mm
Von/Mit: Eric C. R. Hehner
Erscheinungsdatum: 03.09.2012
Gewicht: 0,496 kg
Artikel-ID: 105651597
Sicherheitshinweis

Ähnliche Produkte

Ähnliche Produkte