Normal view MARC view ISBD view

Constructing Correct Software [electronic resource] / by John Cooke.

By: Cooke, John [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookPublisher: London : Springer London, 2005Edition: Second Edition.Description: XXI, 509 p. 100 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9781846280795.Subject(s): Computer science | Software engineering | Mathematical logic | Computer Science | Software Engineering/Programming and Operating Systems | Software Engineering | Mathematical Logic and Formal LanguagesAdditional physical formats: Printed edition:: No titleDDC classification: 005.1 Online resources: Click here to access online
Contents:
Preliminaries -- The Technical Background -- On Programming -- Fundamentals -- Algorithm Extraction -- Recursion Removal -- Quantifications -- Refinement and Re-use -- Developments -- Sorting -- Data Refinement -- Sorting Revisited -- Failures and Fixes -- Further Examples -- On Interactive Software.
In: Springer eBooksSummary: 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 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. Based on teaching material used extensively at Loughborough University, John Cooke introduces the basics, using simple examples and lots of detailed working (which can often be re-used). 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode
e-Books e-Books Bangalore University Library
Available BUSP001091

Preliminaries -- The Technical Background -- On Programming -- Fundamentals -- Algorithm Extraction -- Recursion Removal -- Quantifications -- Refinement and Re-use -- Developments -- Sorting -- Data Refinement -- Sorting Revisited -- Failures and Fixes -- Further Examples -- On Interactive Software.

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 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. Based on teaching material used extensively at Loughborough University, John Cooke introduces the basics, using simple examples and lots of detailed working (which can often be re-used). 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.

There are no comments for this item.

Log in to your account to post a comment.

Copyright © 2019 Bangalore University, Bangalore. All Rights Reserved.
You are Visitor No.
Web Counter

Powered by Koha