Mathematics of Program Construction : 10th International Conference, MPC 2010, Québec City, Canada, June 21-23, 2010, Proceedings
by Bolduc, Claude; Desharnais, Jules; Ktari, BechirRent Textbook
New Textbook
We're Sorry
Sold Out
Used Textbook
We're Sorry
Sold Out
eTextbook
We're Sorry
Not Available
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
Table of Contents
| Invited Talks | |
| The Algorithmics of Solitaire-Like Games | p. 1 |
| Compositionality of Secure Information Flow | p. 19 |
| Process Algebras for Collective Dynamics (Extended Abstract) | p. 20 |
| Contributed Talks | |
| On Automated Program Construction and Verification | p. 22 |
| The Logic of Large Enough | p. 42 |
| Dependently Typed Grammars | p. 58 |
| Abstraction of Object Graphs in Program Verification | p. 80 |
| Subtyping, Declaratively: An Exercise in Mixed Induction and Coinduction | p. 100 |
| Compositional Action System Derivation Using Enforced Properties | p. 119 |
| Designing an Algorithmic Proof of the Two-Squares Theorem | p. 140 |
| Partial, Total and General Correctness | p. 157 |
| Unifying Theories of Programming That Distinguish Nontermination and Abort | p. 178 |
| Adjoint Folds and Unfolds: Or: Scything through the Thicket of Morphisms | p. 195 |
| An Abstract Machine for the Old Value Retrieval | p. 229 |
| A Tracking Semantics for CSP | p. 248 |
| Matrices as Arrows!: A Biproduct Approach to Typed Linear Algebra | p. 271 |
| Lucy-n: a n-Synchronous Extension of Lustre | p. 288 |
| Sampling, Splitting and Merging in Coinductive Stream Calculus | p. 310 |
| Generic Point-free Lenses | p. 331 |
| Formal Derivation of Concurrent Garbage Collectors | p. 353 |
| Temporal Logic Verification of Lock-Freedom | p. 377 |
| Gradual Refinement: Blending Pattern Matching with Data Abstraction | p. 397 |
| Author Index | p. 427 |
| Table of Contents provided by Ingram. All Rights Reserved. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.
