Skip to main content
Book cover

The Correctness-by-Construction Approach to Programming

  • Book
  • © 2012

Overview

  • Step-by-step explanation of how to derive mathematically correct algorithms using small and tractable refinements
  • Detailed illustration of the presented methodology through a set of carefully selected graded examples
  • Practical applicability demonstrated by deriving non-trivial algorithms (e.g. in computational geometry) and algorithm taxonomies (as a basis for toolkit construction)
  • Includes supplementary material: sn.pub/extras

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

Access this book

eBook USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.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 (7 chapters)

Keywords

About this book

The focus of this book is on bridging the gap between two extreme methods for developing software. On the one hand, there are texts and approaches that are so formal that they scare off all but the most dedicated theoretical computer scientists. On the other, there are some who believe that any measure of formality is a waste of time, resulting in software that is developed by following gut feelings and intuitions.

Kourie and Watson advocate an approach known as “correctness-by-construction,” a technique to derive algorithms that relies on formal theory, but that requires such theory to be deployed in a very systematic and pragmatic way.  First they provide the key theoretical background (like first-order predicate logic or refinement laws) that is needed to understand and apply the method. They then detail a series of graded examples ranging from binary search to lattice cover graph construction and finite automata minimization in order to show how it can be applied to increasingly complex algorithmic problems. 

The principal purpose of this book is to change the way software developers approach their task at programming-in-the-small level, with a view to improving code quality. Thus it coheres with both the IEEE’s Guide to the Software Engineering Body of Knowledge (SWEBOK) recommendations, which identifies themes covered in this book as part of the software engineer’s arsenal of tools and methods, and with the goals of the Software Engineering Method and Theory (SEMAT) initiative, which aims to “refound software engineering based on a solid theory.”

Reviews

"This book is a must-read for every computer science student and every computing professional involved in software development. Based on a set of simple but powerful formal rules originally invented by computing pioneers E. W. Dijkstra and C. A. R. Hoare, the authors introduce the reader to the development of elegant and provably correct software. By emphasizing construction with a priori built-in correctness, the book goes one decisive step beyond formal verification. The goal is ambitious but the authors fully deliver. With a minimum of formalistic overhead, they walk the reader through a series of carefully chosen examples and use cases, thereby gradually unleashing the full power of the methodology. The book´s main merit, however, lies in the fact that it convincingly disproves the common belief that formal methods are not practicable in the “real” world." (Jürg Gutknecht, ETH Zurich, Switzerland)

Authors and Affiliations

  • , Department of Computer Science, University of Pretoria, Pretoria, South Africa

    Derrick G. Kourie

  • FASTAR Group, Information Science, Stellenbosch University, Stellenbosch, South Africa

    Bruce W. Watson

About the authors

Derrick G. Kourie is a full professor in the Department of Computer Science at the University of Pretoria in South Africa. He has published extensively on software engineering, algorithm construction and analysis, and formal methods and specification languages. His goal is to combine theory and practice in a way that impacts the efficiency and effectiveness of the software process.

Bruce W. Watson is a full professor in the Department of Information Science at Stellenbosch University, and professor extraordinary at the University of Pretoria and director of the FASTAR (Finite Automata Systems – Theoretical and Applied Research) group, spanning the Netherlands, South Africa, the USA, and Finland. His research and development activities cover programming languages, automata and their applications, algorithms, parallelism, and reconfigurable computing.

Bibliographic Information

Publish with us