Mathematics of Program Construction

This volumecontainsthe proceedingsof MPC2010,the 10th InternationalC- ferenceonthe MathematicsofProgramConstruction.ThebiennialMPCconf- encesaimtopromotethedevelopmentofmathematicalprinciplesandtechniques that aredemonstrablypracticalande?ective in the processof constructingc- puter programs, whether implemented in hardware or software. The focus is on techniques that combine precision with conciseness, enabling programs to be constructed by formal calculation. Within this theme, the scope of the series is very diverse, including programming methodology, program speci?cation and transformation, program analysis, programming paradigms, programming c- culi, programming language semantics, security, and program logics. The conference took place during June 21 23 in Lac-Beauport, a suburb of Qu ebec City, Canada, prior to AMAST 2010 (June 23 26). The previous nine conferences were held in 1989 in Twente, The Netherlands (LNCS 375); in 1992 in Oxford, UK (LNCS 669); in 1995 in Kloster Irsee, Germany (LNCS 947); in 1998 in Marstrand near Got eborg, Sweden (LNCS 1422); in 2000 in Ponte de Lima, Portugal (LNCS 1837); in 2002 in Dagstuhl, Germany (LNCS 2386); in 2004,inStirling,UK(LNCS3125);in2006inKuressaare,Estonia(LNCS4014); and in 2008 in Marseille-Luminy, France (LNCS 5133). The volume contains one invited paper, the abstracts of two invited talks, and 19 papersselected for presentationby the ProgramCommittee from 37 s- missions. Eachpaper wasrefereed by at least three reviewers,and on averageby four. We are grateful to the members of the Program Committee and the ext- nal referees for their care and diligence in reviewing the submitted papers. The review process and compilation of the proceedings were greatly helped by - drei Voronkov s EasyChair system that we highly recommend to every Program Chair.

Klappentext

This book constitutes the refereed proceedings of the 10th International Conference on Mathematics of Program Construction, MPC 2010, held in Québec City, Canada in June 2010. The 19 revised full papers presented together with 1 invited talk and the abstracts of 2 invited talks were carefully reviewed and selected from 37 submissions. The focus is on techniques that combine precision with conciseness, enabling programs to be constructed by formal calculation. Within this theme, the scope of the series is very diverse, including programming methodology, program specification and transformation, program analysis, programming paradigms, programming calculi, programming language semantics, security and program logics.

Inhalt
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.