{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":19,"n_cols":5,"rows_kept":19,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[11,2,11,3],[12,2,12,3],[16,2,16,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910789226403321"]
[null,null,"Autore",null,"Back Ralph-Johan"]
[null,null,"Titolo",null,"Refinement Calculus [[electronic resource] ] : A Systematic Introduction / / by Ralph-Johan Back, Joakim Wright"]
[null,null,"Pubbl/distr/stampa",null,"New York, NY : , : Springer New York : , : Imprint : Springer, , 1998"]
[null,null,"ISBN",null,"1-4612-1674-5"]
[null,null,"Edizione",null,"[1st ed. 1998.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XVI, 520 p. 11 illus.)"]
[null,null,"Collana",null,"Texts in Computer Science, , 1868-0941"]
[null,null,"Disciplina",null,"005.1/4"]
[null,null,"Soggetti",null,"Computers"]
[{"$nulls":4},"Theory of Computation"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"1 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."]
[null,null,null,"Sommario/riassunto","Much 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. "]
[{"$nulls":4},"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."]