| Description |
xxi, 509 pages : illustrations ; 24 cm |
| Series |
Formal approaches to computing and information technology |
|
Formal approaches to computing and information technology.
|
| Contents |
1. The technical background -- 2. On programming -- 3. Algorithm extraction -- 4. Recursion removal -- 5. Quantifications -- 6. Refinement and re-use -- 7. Sorting -- 8. Data refinement -- 9. Sorting revisited -- 10. Failures and fixes -- 11. Further examples -- 12. On interactive software -- App. Transformation digest |
| Summary |
"Central to Formal Methods is the so-called Correctness Theorem, which relates a specification to its correct Implementations. This theorem is the goal of traditional program testing and, more recently, of program verification (in which the theorem must be proved). Proofs are difficult, though, even with the use of powerful theorem-provers. This new, updated volume explains and illustrates an alternative method, which allows the construction of (necessarily correct) algorithms from a specification using algebraic transformations and refinement techniques which prevent the introduction of errors." "Constructing Correct Software will provide invaluable reading for students and practitioners of Computer Science and Software Engineering to whom correctness of software is of prime importance."--BOOK JACKET |
| Notes |
Previous ed. published: 1998 |
|
Formerly CIP. Uk |
| Bibliography |
Includes bibliographical references (pages [501]-502) and index |
| Notes |
Also available in print |
|
Mode of access: World Wide Web |
| Subject |
Computer software -- Development.
|
|
Formal methods (Computer science)
|
| LC no. |
2004050410 |
| ISBN |
1852338202 alkaline paper |
|
