Mathematics of Program Construction: 10th International Conference, Mpc 2010, Quebec City, Canada, June 21-23, 2010, Proceedings by Claude BolducMathematics of Program Construction: 10th International Conference, Mpc 2010, Quebec City, Canada, June 21-23, 2010, Proceedings by Claude Bolduc

Mathematics of Program Construction: 10th International Conference, Mpc 2010, Quebec City, Canada…

byClaude BolducEditorJules Desharnais, Bechir Ktari

Paperback | June 1, 2010

Pricing and Purchase Info

$148.02 online 
$178.50 list price save 17%
Earn 740 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

we highly recommend to every Program Chair.
Title:Mathematics of Program Construction: 10th International Conference, Mpc 2010, Quebec City, Canada…Format:PaperbackDimensions:427 pagesPublished:June 1, 2010Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3642133207

ISBN - 13:9783642133206

Look for similar items by category:

Reviews

Table of Contents

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.