UID:
almahu_9947364136502882
Format:
X, 427 p. 57 illus.
,
online resource.
ISBN:
9783642133213
Series Statement:
Lecture Notes in Computer Science, 6120
Note:
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.
In:
Springer eBooks
Additional Edition:
Printed edition: ISBN 9783642133206
Language:
English
DOI:
10.1007/978-3-642-13321-3
URL:
http://dx.doi.org/10.1007/978-3-642-13321-3
Bookmarklink