Borrow it
 Architecture Library
 Bizzell Memorial Library
 Boorstin Collection
 Chinese Literature Translation Archive
 Engineering Library
 Fine Arts Library
 Harry W. Bass Business History Collection
 History of Science Collections
 John and Mary Nichols Rare Books and Special Collections
 Library Service Center
 Price College Digital Library
 Western History Collections
The Resource Abstraction, Refinement and Proof for Probabilistic Systems, by Annabelle McIver, Carroll Morgan, (electronic resource)
Abstraction, Refinement and Proof for Probabilistic Systems, by Annabelle McIver, Carroll Morgan, (electronic resource)
Resource Information
The item Abstraction, Refinement and Proof for Probabilistic Systems, by Annabelle McIver, Carroll Morgan, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.This item is available to borrow from all library branches.
Resource Information
The item Abstraction, Refinement and Proof for Probabilistic Systems, by Annabelle McIver, Carroll Morgan, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.
This item is available to borrow from all library branches.
 Summary
 Probabilistic techniques are increasingly being employed in computer programs and systems because they can increase efficiency in sequential algorithms, enable otherwise nonfunctional distribution applications, and allow quantification of risk and safety in general. This makes operational models of how they work, and logics for reasoning about them, extremely important. Abstraction, Refinement and Proof for Probabilistic Systems presents a rigorous approach to modeling and reasoning about computer systems that incorporate probability. Its foundations lie in traditional Boolean sequentialprogram logic—but its extension to numeric rather than merely trueorfalse judgments takes it much further, into areas such as randomized algorithms, fault tolerance, and, in distributed systems, almostcertain symmetry breaking. The presentation begins with the familiar "assertional" style of program development and continues with increasing specialization: Part I treats probabilistic program logic, including many examples and case studies; Part II sets out the detailed semantics; and Part III applies the approach to advanced material on temporal calculi and twoplayer games. Topics and features: * Presents a general semantics for both probability and demonic nondeterminism, including abstraction and data refinement * Introduces readers to the latest mathematical research in rigorous formalization of randomized (probabilistic) algorithms * Illustrates by example the steps necessary for building a conceptual model of probabilistic programming "paradigm" * Considers results of a large and integrated research exercise (10 years and continuing) in the leadingedge area of "quantitative" program logics * Includes helpful chapterending summaries, a comprehensive index, and an appendix that explores alternative approaches This accessible, focused monograph, written by international authorities on probabilistic programming, develops an essential foundation topic for modern programming and systems development. Researchers, computer scientists, and advanced undergraduates and graduates studying programming or probabilistic systems will find the work an authoritative and essential resource text
 Language

 eng
 eng
 Extent
 1 online resource (397 p.)
 Note
 Description based upon print version of record
 Contents

 Probabilistic guarded commands and their refinement logic
 to pGCL: Its logic and its model
 Probabilistic loops: Invariants and variants
 Case studies in termination: Choice coordination, the dining philosophers, and the random walk
 Probabilistic data refinement: The steam boiler
 Semantic structures
 Theory for the demonic model
 The geometry of probabilistic programs
 Proved rules for probabilistic loops
 Infinite state spaces, angelic choice and the transformer hierarchy
 Advanced topics: Quantitative modal logic and game interpretations
 Quantitative temporal logic: An introduction
 The quantitative algebra of qTL
 The quantitative modal ?calculus, and gambling games
 Isbn
 9781280263552
 Label
 Abstraction, Refinement and Proof for Probabilistic Systems
 Title
 Abstraction, Refinement and Proof for Probabilistic Systems
 Statement of responsibility
 by Annabelle McIver, Carroll Morgan
 Subject

 Mathematical Logic and Formal Languages
 Probability Theory and Stochastic Processes
 Programming Languages, Compilers, Interpreters
 Programming Techniques
 Software Engineering/Programming and Operating Systems
 Computer science
 Software engineering
 Distribution (Probability theory
 Logic design
 Logics and Meanings of Programs
 Language

 eng
 eng
 Summary
 Probabilistic techniques are increasingly being employed in computer programs and systems because they can increase efficiency in sequential algorithms, enable otherwise nonfunctional distribution applications, and allow quantification of risk and safety in general. This makes operational models of how they work, and logics for reasoning about them, extremely important. Abstraction, Refinement and Proof for Probabilistic Systems presents a rigorous approach to modeling and reasoning about computer systems that incorporate probability. Its foundations lie in traditional Boolean sequentialprogram logic—but its extension to numeric rather than merely trueorfalse judgments takes it much further, into areas such as randomized algorithms, fault tolerance, and, in distributed systems, almostcertain symmetry breaking. The presentation begins with the familiar "assertional" style of program development and continues with increasing specialization: Part I treats probabilistic program logic, including many examples and case studies; Part II sets out the detailed semantics; and Part III applies the approach to advanced material on temporal calculi and twoplayer games. Topics and features: * Presents a general semantics for both probability and demonic nondeterminism, including abstraction and data refinement * Introduces readers to the latest mathematical research in rigorous formalization of randomized (probabilistic) algorithms * Illustrates by example the steps necessary for building a conceptual model of probabilistic programming "paradigm" * Considers results of a large and integrated research exercise (10 years and continuing) in the leadingedge area of "quantitative" program logics * Includes helpful chapterending summaries, a comprehensive index, and an appendix that explores alternative approaches This accessible, focused monograph, written by international authorities on probabilistic programming, develops an essential foundation topic for modern programming and systems development. Researchers, computer scientists, and advanced undergraduates and graduates studying programming or probabilistic systems will find the work an authoritative and essential resource text
 http://library.link/vocab/creatorName
 McIver, Annabelle
 Dewey number
 005.1
 http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsaut

 WANeKF4KccA
 CyaDE98zktQ
 Language note
 English
 LC call number
 QA76.758
 Literary form
 non fiction
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorName
 Morgan, Carroll.
 Series statement
 Monographs in Computer Science,
 http://library.link/vocab/subjectName

 Software engineering
 Distribution (Probability theory
 Computer science
 Logic design
 Software Engineering/Programming and Operating Systems
 Probability Theory and Stochastic Processes
 Programming Techniques
 Logics and Meanings of Programs
 Programming Languages, Compilers, Interpreters
 Mathematical Logic and Formal Languages
 Label
 Abstraction, Refinement and Proof for Probabilistic Systems, by Annabelle McIver, Carroll Morgan, (electronic resource)
 Note
 Description based upon print version of record
 Bibliography note
 Includes bibliographical references (p. [345]355) and indexes
 Carrier category
 online resource
 Carrier category code

 cr
 Content category
 text
 Content type code

 txt
 Contents
 Probabilistic guarded commands and their refinement logic  to pGCL: Its logic and its model  Probabilistic loops: Invariants and variants  Case studies in termination: Choice coordination, the dining philosophers, and the random walk  Probabilistic data refinement: The steam boiler  Semantic structures  Theory for the demonic model  The geometry of probabilistic programs  Proved rules for probabilistic loops  Infinite state spaces, angelic choice and the transformer hierarchy  Advanced topics: Quantitative modal logic and game interpretations  Quantitative temporal logic: An introduction  The quantitative algebra of qTL  The quantitative modal ?calculus, and gambling games
 Dimensions
 unknown
 Extent
 1 online resource (397 p.)
 Form of item
 online
 Isbn
 9781280263552
 Media category
 computer
 Media type code

 c
 Other control number
 10.1007/b138392
 Specific material designation
 remote
 System control number

 (CKB)1000000000228069
 (EBL)303042
 (OCoLC)62881619
 (SSID)ssj0000096292
 (PQKBManifestationID)11119542
 (PQKBTitleCode)TC0000096292
 (PQKBWorkID)10081669
 (PQKB)10132918
 (SSID)ssj0000767728
 (PQKBManifestationID)12343889
 (PQKBTitleCode)TC0000767728
 (PQKBWorkID)10740035
 (PQKB)10940511
 (DEHe213)9780387270067
 (MiAaPQ)EBC303042
 (EXLCZ)991000000000228069
 Label
 Abstraction, Refinement and Proof for Probabilistic Systems, by Annabelle McIver, Carroll Morgan, (electronic resource)
 Note
 Description based upon print version of record
 Bibliography note
 Includes bibliographical references (p. [345]355) and indexes
 Carrier category
 online resource
 Carrier category code

 cr
 Content category
 text
 Content type code

 txt
 Contents
 Probabilistic guarded commands and their refinement logic  to pGCL: Its logic and its model  Probabilistic loops: Invariants and variants  Case studies in termination: Choice coordination, the dining philosophers, and the random walk  Probabilistic data refinement: The steam boiler  Semantic structures  Theory for the demonic model  The geometry of probabilistic programs  Proved rules for probabilistic loops  Infinite state spaces, angelic choice and the transformer hierarchy  Advanced topics: Quantitative modal logic and game interpretations  Quantitative temporal logic: An introduction  The quantitative algebra of qTL  The quantitative modal ?calculus, and gambling games
 Dimensions
 unknown
 Extent
 1 online resource (397 p.)
 Form of item
 online
 Isbn
 9781280263552
 Media category
 computer
 Media type code

 c
 Other control number
 10.1007/b138392
 Specific material designation
 remote
 System control number

 (CKB)1000000000228069
 (EBL)303042
 (OCoLC)62881619
 (SSID)ssj0000096292
 (PQKBManifestationID)11119542
 (PQKBTitleCode)TC0000096292
 (PQKBWorkID)10081669
 (PQKB)10132918
 (SSID)ssj0000767728
 (PQKBManifestationID)12343889
 (PQKBTitleCode)TC0000767728
 (PQKBWorkID)10740035
 (PQKB)10940511
 (DEHe213)9780387270067
 (MiAaPQ)EBC303042
 (EXLCZ)991000000000228069
Subject
 Mathematical Logic and Formal Languages
 Probability Theory and Stochastic Processes
 Programming Languages, Compilers, Interpreters
 Programming Techniques
 Software Engineering/Programming and Operating Systems
 Computer science
 Software engineering
 Distribution (Probability theory
 Logic design
 Logics and Meanings of Programs
Member of
Library Locations

Architecture LibraryBorrow itGould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US35.205706 97.445050



Chinese Literature Translation ArchiveBorrow it401 W. Brooks St., RM 414, Norman, OK, 73019, US35.207487 97.447906

Engineering LibraryBorrow itFelgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US35.205706 97.445050

Fine Arts LibraryBorrow itCatlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US35.210371 97.448244

Harry W. Bass Business History CollectionBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

History of Science CollectionsBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

John and Mary Nichols Rare Books and Special CollectionsBorrow it401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US35.207487 97.447906


Price College Digital LibraryBorrow itAdams Hall 102 307 West Brooks St., Norman, OK, 73019, US35.210371 97.448244

Western History CollectionsBorrow itMonnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US35.209584 97.445414
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.libraries.ou.edu/portal/AbstractionRefinementandProoffor/eq8cqluTvzI/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/AbstractionRefinementandProoffor/eq8cqluTvzI/">Abstraction, Refinement and Proof for Probabilistic Systems, by Annabelle McIver, Carroll Morgan, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Abstraction, Refinement and Proof for Probabilistic Systems, by Annabelle McIver, Carroll Morgan, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.libraries.ou.edu/portal/AbstractionRefinementandProoffor/eq8cqluTvzI/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/AbstractionRefinementandProoffor/eq8cqluTvzI/">Abstraction, Refinement and Proof for Probabilistic Systems, by Annabelle McIver, Carroll Morgan, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>