LEADER 03748nam  22007575  450 
001 996465637503316
005 20230220214744.0
010   $a1-280-38680-0
010   $a9786613564726
010   $a3-642-13321-5
024 7 $a10.1007/978-3-642-13321-3
035   $a(CKB)2670000000028901
035   $a(SSID)ssj0000446618
035   $a(PQKBManifestationID)11298842
035   $a(PQKBTitleCode)TC0000446618
035   $a(PQKBWorkID)10497754
035   $a(PQKB)10752553
035   $a(DE-He213)978-3-642-13321-3
035   $a(MiAaPQ)EBC3065463
035   $a(PPN)149063555
035   $a(EXLCZ)992670000000028901
100   $a20100625d2010      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aMathematics of Program Construction$b[electronic resource] $e10th International Conference, MPC 2010, Québec City, Canada, June 21-23, 2010, Proceedings /$fedited by Claude Bolduc, Jules Desharnais, Bechir Ktari
205   $a1st ed. 2010.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010.
215   $a1 online resource (X, 427 p. 57 illus.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6120
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-642-13320-7 
320   $aIncludes bibliographical references and index.
327   $aInvited Talks -- The Algorithmics of Solitaire-Like Games -- Compositionality of Secure Information Flow -- Process Algebras for Collective Dynamics -- Contributed Talks -- On Automated Program Construction and Verification -- The Logic of Large Enough -- Dependently Typed Grammars -- Abstraction of Object Graphs in Program Verification -- Subtyping, Declaratively -- Compositional Action System Derivation Using Enforced Properties -- Designing an Algorithmic Proof of the Two-Squares Theorem -- Partial, Total and General Correctness -- Unifying Theories of Programming That Distinguish Nontermination and Abort -- Adjoint Folds and Unfolds -- An Abstract Machine for the Old Value Retrieval -- A Tracking Semantics for CSP -- Matrices as Arrows! -- Lucy-n: a n-Synchronous Extension of Lustre -- Sampling, Splitting and Merging in Coinductive Stream Calculus -- Generic Point-free Lenses -- Formal Derivation of Concurrent Garbage Collectors -- Temporal Logic Verification of Lock-Freedom -- Gradual Refinement.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6120
606   $aSoftware engineering
606   $aImmunology
606   $aComputer programming
606   $aComputer science
606   $aMachine theory
606   $aSoftware Engineering
606   $aImmunology
606   $aProgramming Techniques
606   $aComputer Science Logic and Foundations of Programming
606   $aFormal Languages and Automata Theory
615  0$aSoftware engineering.
615  0$aImmunology.
615  0$aComputer programming.
615  0$aComputer science.
615  0$aMachine theory.
615 14$aSoftware Engineering.
615 24$aImmunology.
615 24$aProgramming Techniques.
615 24$aComputer Science Logic and Foundations of Programming.
615 24$aFormal Languages and Automata Theory.
676   $a005.10151
702   $aBolduc$b Claude$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aDesharnais$b Jules$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aKtari$b Bechir$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aMPC 2010
906   $aBOOK
912   $a996465637503316
996   $aMathematics of Program Construction$92915783
997   $aUNISA