000 | 03353nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-3-642-13321-3 | ||
003 | DE-He213 | ||
005 | 20240423125308.0 | ||
007 | cr nn 008mamaa | ||
008 | 100625s2010 gw | s |||| 0|eng d | ||
020 |
_a9783642133213 _9978-3-642-13321-3 |
||
024 | 7 |
_a10.1007/978-3-642-13321-3 _2doi |
|
050 | 4 | _aQA76.758 | |
072 | 7 |
_aUMZ _2bicssc |
|
072 | 7 |
_aCOM051230 _2bisacsh |
|
072 | 7 |
_aUMZ _2thema |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aMathematics of Program Construction _h[electronic resource] : _b10th International Conference, MPC 2010, Québec City, Canada, June 21-23, 2010, Proceedings / _cedited by Claude Bolduc, Jules Desharnais, Bechir Ktari. |
250 | _a1st ed. 2010. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010. |
|
300 |
_aX, 427 p. 57 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6120 |
|
505 | 0 | _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. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aImmunology. | |
650 | 0 | _aComputer programming. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aMachine theory. | |
650 | 1 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aImmunology. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
700 | 1 |
_aBolduc, Claude. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aDesharnais, Jules. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aKtari, Bechir. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642133206 |
776 | 0 | 8 |
_iPrinted edition: _z9783642133220 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6120 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-13321-3 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c176391 _d176391 |