LEADER 03037nam  2200601 a 450 
001 9910482959003321
005 20200520144314.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   $a20100420d2010      uy         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aMathematics of program construction $e10th international conference, MPC 2010, Quebec City, Canada, June 21-23, 2010. proceedings /$fClaude Bolduc, Jules Desharnais, Bechir Ktari (Eds.)
205   $a1st ed.
210   $aNew York $cSpringer$d2010
215   $a1 online resource (X, 427 p. 57 illus.) 
225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues
225 1 $aLecture notes in computer science,$x0302-9743 ;$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$aLecture notes in computer science.
410  0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues.
606   $aComputer programming$vCongresses
615  0$aComputer programming
676   $a005.10151
701   $aBolduc$b Claude$01761703
701   $aDesharnais$b Jules$01761704
701   $aKtari$b Bechir$01761705
712 12$aMPC 2010
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910482959003321
996   $aMathematics of program construction$94201305
997   $aUNINA