Mathematics of Program Construction: 10th International Conference, MPC 2010, Québec City, Canada, June 21-23, 2010, Proceedings: Lecture Notes in Computer Science, cartea 6120

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.