Cargando…

Constructing Correct 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 wi...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Cooke, D. John (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: London : Springer London : Imprint: Springer, 2005.
Edición:2nd ed. 2005.
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-1-84628-079-5
003 DE-He213
005 20220112223850.0
007 cr nn 008mamaa
008 100301s2005 xxk| s |||| 0|eng d
020 |a 9781846280795  |9 978-1-84628-079-5 
024 7 |a 10.1007/b138515  |2 doi 
050 4 |a QA76.758 
072 7 |a UMZ  |2 bicssc 
072 7 |a COM051230  |2 bisacsh 
072 7 |a UMZ  |2 thema 
082 0 4 |a 005.1  |2 23 
100 1 |a Cooke, D. John.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Constructing Correct Software  |h [electronic resource] /  |c by D. John Cooke. 
250 |a 2nd ed. 2005. 
264 1 |a London :  |b Springer London :  |b Imprint: Springer,  |c 2005. 
300 |a XXI, 509 p. 100 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
505 0 |a 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. 
520 |a 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. 
650 0 |a Software engineering. 
650 0 |a Machine theory. 
650 1 4 |a Software Engineering. 
650 2 4 |a Formal Languages and Automata Theory. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9781848007680 
776 0 8 |i Printed edition:  |z 9781852338206 
856 4 0 |u https://doi.uam.elogim.com/10.1007/b138515  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)