|
|
|
|
| LEADER |
03101nam a22005775i 4500 |
| 001 |
978-3-642-13321-3 |
| 003 |
DE-He213 |
| 005 |
20151204155009.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100625s2010 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642133213
|9 978-3-642-13321-3
|
| 024 |
7 |
|
|a 10.1007/978-3-642-13321-3
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.758
|
| 072 |
|
7 |
|a UMZ
|2 bicssc
|
| 072 |
|
7 |
|a UL
|2 bicssc
|
| 072 |
|
7 |
|a COM051230
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1
|2 23
|
| 245 |
1 |
0 |
|a Mathematics of Program Construction
|h [electronic resource] :
|b 10th International Conference, MPC 2010, Québec City, Canada, June 21-23, 2010. Proceedings /
|c edited by Claude Bolduc, Jules Desharnais, Béchir Ktari.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2010.
|
| 300 |
|
|
|a X, 427 p. 57 illus.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 6120
|
| 505 |
0 |
|
|a Invited 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 |
|a Computer science.
|
| 650 |
|
0 |
|a Immunology.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Software Engineering/Programming and Operating Systems.
|
| 650 |
2 |
4 |
|a Immunology.
|
| 650 |
2 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 700 |
1 |
|
|a Bolduc, Claude.
|e editor.
|
| 700 |
1 |
|
|a Desharnais, Jules.
|e editor.
|
| 700 |
1 |
|
|a Ktari, Béchir.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642133206
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 6120
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-13321-3
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
