The Correctness-by-Construction Approach to Programming

The Correctness-by-Construction Approach to Programming
  • eBook:
    The Correctness-by-Construction Approach to Programming
  • Author:
    Derrick G. Kourie, Bruce W. Watson
  • Edition:
    2012 edition
  • Categories:
  • Data:
    April 11, 2012
  • ISBN:
  • ISBN-13:
  • Language:
  • Pages:
    266 pages
  • Format:

Book Description
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.”


Chapter 1. Introduction
Chapter 2. Background
Chapter 3. Simple Examples
Chapter 4. Intermediary Examples
Chapter 5. Procedures and Recursion
Chapter 6. Case Study: Lattice Cover Graph Construction
Chapter 7. Case Study 2: Classifying MADFA Construction Algorithms

Free sample

Add comments
Введите код с картинки:*
Кликните на изображение чтобы обновить код, если он неразборчив
Copyright © 2019