LEADER 03668nam  22005175  450 
001 9910480311803321
005 20200702094308.0
010   $a1-4612-1674-5
024 7 $a10.1007/978-1-4612-1674-2
035   $a(CKB)3400000000089649
035   $a(SSID)ssj0000808267
035   $a(PQKBManifestationID)11429835
035   $a(PQKBTitleCode)TC0000808267
035   $a(PQKBWorkID)10777134
035   $a(PQKB)11515655
035   $a(DE-He213)978-1-4612-1674-2
035   $a(MiAaPQ)EBC3076610
035   $a(EXLCZ)993400000000089649
100   $a20121227d1998      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aRefinement Calculus$b[electronic resource] $eA Systematic Introduction /$fby Ralph-Johan Back, Joakim Wright
205   $a1st ed. 1998.
210  1$aNew York, NY :$cSpringer New York :$cImprint: Springer,$d1998.
215   $a1 online resource (XVI, 520 p. 11 illus.) 
225 1 $aTexts in Computer Science,$x1868-0941
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a0-387-98417-8 
320   $aIncludes bibliographical references and index.
327   $a1 Introduction -- 1.1 Contracts -- 1.2 Using Contracts -- 1.3 Computers as Agents -- 1.4 Algebra of Contracts -- 1.5 Programming Constructs -- 1.6 Specification Constructs -- 1.7 Correctness -- 1.8 Refinement of Programs -- 1.9 Background -- 1.10 Overview of the Book -- I Foundations -- 2 Posets, Lattices, and Categories -- 3 Higher-Order Logic -- 4 Functions -- 5 States and State Transformers -- 6 Truth Values -- 7 Predicates and Sets -- 8 Boolean Expressions and Conditionals -- 9 Relations -- 10 Types and Data Structures -- II Statements -- 11 Predicate Transformers -- 12 The Refinement Calculus Hierarchy -- 13 Statements -- 14 Statements as Games -- 15 Choice Semantics -- 16 Subclasses of Statements -- 17 Correctness and Refinement of Statements -- III Recursion and Iteration -- 18 Well-founded Sets and Ordinals -- 19 Fixed Points -- 20 Recursion -- 21 Iteration and Loops -- 22 Continuity and Executable Statements -- 23 Working with Arrays -- 24 The N-Queens Problem -- 25 Loops and Two-Person Games -- IV Statement Subclasses -- 26 Statement Classes and Normal Forms -- 27 Specification Statements -- 28 Refinement in Context -- 29 Iteration of Conjunctive Statements -- References.
330   $aMuch current research in computer science is concerned with two questions: is a program correct? And how can we improve a correct program preserving correctness? This latter question is known as the refinement of programs and the purpose of this book is to consider these questions in a formal setting. In fact, correctness turns out to be a special case of refinement and so the focus is on refinement. Although a reasonable background knowledge is assumed from mathematics and CS, the book is a self-contained introduction suitable for graduate students and researchers coming to this subject for the first time. There are numerous exercises provided of varying degrees of challenge.
410  0$aTexts in Computer Science,$x1868-0941
606   $aComputers
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
615  0$aComputers.
615 14$aTheory of Computation.
676   $a005.1/4
700   $aBack$b Ralph-Johan$4aut$4http://id.loc.gov/vocabulary/relators/aut$0543932
702   $aWright$b Joakim$4aut$4http://id.loc.gov/vocabulary/relators/aut
906   $aBOOK
912   $a9910480311803321
996   $aRefinement Calculus$92018518
997   $aUNINA