Hehner A Practical Theory of Programming

Erscheinungsjahr 2012
ISBN: 978-1-4419-8596-5
Verlag: Springer US
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 247 Seiten, Web PDF

Reihe: Monographs in Computer Science

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.

Zielgruppe

Professional/practitioner

Autoren/Hrsg.

Hehner, Eric C.R.

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.