Skip to main content
SpringerLink
Log in

A Practical Theory of Programming

  • Book
  • © 1993

Overview

Authors:
  1. Eric C. R. Hehner

    1. Department of Computer Science, University of Toronto, Toronto, Canada

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Monographs in Computer Science (MCS)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (11 chapters)

  1. Front Matter

    Pages i-2
    Download chapter PDF

  2. Basic Theories

    • Eric C. R. Hehner
    Pages 3-13

  3. Basic Data Structures

    • Eric C. R. Hehner
    Pages 14-23

  4. Function Theory

    • Eric C. R. Hehner
    Pages 24-35

  5. Program Theory

    • Eric C. R. Hehner
    Pages 36-69

  6. Programming Language

    • Eric C. R. Hehner
    Pages 70-90

  7. Recursive Definition

    • Eric C. R. Hehner
    Pages 91-101

  8. Theory Design and Implementation

    • Eric C. R. Hehner
    Pages 102-119

  9. Concurrency

    • Eric C. R. Hehner
    Pages 120-130

  10. Communication

    • Eric C. R. Hehner
    Pages 131-148

  11. Exercises

    • Eric C. R. Hehner
    Pages 149-203

  12. Reference

    • Eric C. R. Hehner
    Pages 204-247
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • Department of Computer Science, University of Toronto, Toronto, Canada

    Eric C. R. Hehner

Bibliographic Information

  • Book Title: A Practical Theory of Programming

  • Authors: Eric C. R. Hehner

  • Series Title: Monographs in Computer Science

  • DOI: https://doi.org/10.1007/978-1-4419-8596-5

  • Publisher: Springer New York, NY

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag New York, Inc. 1993

  • Hardcover ISBN: 978-0-387-94106-6Published: 06 August 1993

  • Softcover ISBN: 978-1-4612-6444-6Published: 03 September 2012

  • eBook ISBN: 978-1-4419-8596-5Published: 08 September 2012

  • Series ISSN: 0172-603X

  • Series E-ISSN: 2512-5486

  • Edition Number: 1

  • Number of Pages: X, 247

  • Topics: Software Engineering/Programming and Operating Systems

Publish with us

Policies and ethics

Back to top

Search

Navigation