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:… Mehr…
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. New Textbooks>Hardcover>Technology>Windows>Programming, Springer New York Core >2 >T<
BarnesandNoble.com
new in stock. Versandkosten:zzgl. Versandkosten. Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
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: … Mehr…
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., Springer<
Springer.com
Nr. 978-0-387-94106-6. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00) Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
17,8 x 1,6 x 25,4 cm, hardcover. 257 p. Gebundene Ausgabe In very good condition. ISBN: 9780387941066 2, [PU:Springer,]
Achtung-Buecher.de
Wissenschaftliches Antiquariat Thomas Haker e.K. Amtsgericht Freiburg, Registernummer: HRA 703494 A, 79771 Klettgau-Erzingen Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
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:… Mehr…
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. New Textbooks>Hardcover>Technology>Windows>Programming, Springer New York Core >2 >T<
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: … Mehr…
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., Springer<
Nr. 978-0-387-94106-6. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00)
17,8 x 1,6 x 25,4 cm, hardcover. 257 p. Gebundene Ausgabe In very good condition. ISBN: 9780387941066 2, [PU:Springer,]
Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Wissenschaftliches Antiquariat Thomas Haker e.K. Amtsgericht Freiburg, Registernummer: HRA 703494 A, 79771 Klettgau-Erzingen
1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.
Understanding programming and programming languages requires knowledge of the underlying theoretical model. This book explores aspects of programming that are amenable to mathematical proof. The author describes a programming theory which is much simpler and more comprehensive than the current theories to date. In the theoretical model, a specification is just a boolean expression and refinement is just an ordinary implication. The author develops a practical and broad method for writing precise specifications and designing programs whose executions probably satisfy the specifications. Beginning with preparatory material in logic, numbers, sets, lists, functions and relations, the book advances further into program theory, the heart of the book. Subsequent chapters may be selected or omitted according to course emphasis. 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. All technical terms are explained and then demonstrated in the book wherever possible. No advanced mathematical knowledge or programming language is assumed. The book contains numerous exercises and worked-out solutions for specific exercises. Transparency masters and solutions for the remaining exercises are available from the author.
Detailangaben zum Buch - A Practical Theory of Programming Eric C.R. Hehner Author
EAN (ISBN-13): 9780387941066 ISBN (ISBN-10): 0387941061 Gebundene Ausgabe Taschenbuch Erscheinungsjahr: 1993 Herausgeber: Springer New York Core >2 >T 260 Seiten Gewicht: 0,688 kg Sprache: eng/Englisch
Buch in der Datenbank seit 2008-04-21T23:13:23+02:00 (Vienna) Detailseite zuletzt geändert am 2024-04-10T14:31:19+02:00 (Vienna) ISBN/EAN: 0387941061
ISBN - alternative Schreibweisen: 0-387-94106-1, 978-0-387-94106-6 Alternative Schreibweisen und verwandte Suchbegriffe: Autor des Buches: eric, hehne, hehn, hehner, dijkstra Titel des Buches: practical programming, practical theory, practical vim, monographs
Daten vom Verlag:
Autor/in: Eric C.R. Hehner Titel: Monographs in Computer Science; A Practical Theory of Programming Verlag: Springer; Springer US 247 Seiten Erscheinungsjahr: 1993-08-06 New York; NY; US Sprache: Englisch 53,49 € (DE) 54,99 € (AT) 59,00 CHF (CH) Available X, 247 p.
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.
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
