The Correctness-by-Construction Approach to Programming

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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

Author(s): Derrick G. Kourie, Bruce W. Watson (auth.)
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2012

Language: English
Pages: 266
Tags: Software Engineering; Logics and Meanings of Programs; Mathematical Logic and Formal Languages

Front Matter....Pages i-xiii
Introduction....Pages 1-6
Background....Pages 7-54
Simple Examples....Pages 55-93
Intermediary Examples....Pages 95-159
Procedures and Recursion....Pages 161-195
Case Study: Lattice Cover Graph Construction....Pages 197-226
Case Study 2: Classifying MADFA Construction Algorithms....Pages 227-257
Back Matter....Pages 259-264