Algebraic and Coalgebraic Methods in the Mathematics of Program Construction


Book Description

Program construction is about turning specifications of computer software into implementations. Recent research aimed at improving the process of program construction exploits insights from abstract algebraic tools such as lattice theory, fixpoint calculus, universal algebra, category theory, and allegory theory. This textbook-like tutorial presents, besides an introduction, eight coherently written chapters by leading authorities on ordered sets and complete lattices, algebras and coalgebras, Galois connections and fixed point calculus, calculating functional programs, algebra of program termination, exercises in coalgebraic specification, algebraic methods for optimization problems, and temporal algebra.




Mathematics of Program Construction


Book Description

This volume contains the proceedings of the 8th International Conference on Mathematics of ProgramConstruction, MPC 2006,held at Kuressaare, Estonia, July 3-5, 2006, colocated with the 11th International Conference on Algebraic Methodology and Software Technology, AMAST 2006, July 5-8, 2006. TheMPCconferencesaimtopromotethedevelopmentofmathematicalpr- ciples and techniques that are demonstrably useful and usable in the process of constructing computer programs. Topics of interest range from algorithmics to support for program construction in programming languages and systems. The previous MPCs were held at Twente, The Netherlands (1989, LNCS 375), Oxford, UK (1992, LNCS 669), Kloster Irsee, Germany (1995,LNCS 947), Marstrand, Sweden (1998, LNCS 1422), Ponte de Lima, Portugal (2000, LNCS 1837), Dagstuhl, Germany (2002, LNCS 2386) and Stirling, UK (2004, LNCS 3125, colocated with AMAST 2004). MPC 2006 received 45 submissions. Each submission was reviewed by four Programme Committee members or additional referees. The committee decided to accept 22 papers. In addition, the programme included three invited talks by Robin Cockett (University of Calgary, Canada), Olivier Danvy (Aarhus Univ- sitet, Denmark) and Oege de Moor (University of Oxford, UK). The review process and compilation of the proceedings were greatly helped by Andrei Voronkov's EasyChair system that I can only recommend to every programme chair. MPC 2006 had one satellite workshop, the Workshop on Mathematically Structured Functional Programming, MSFP 2006, organized as a "small" wo- shop of the FP6 IST coordination action TYPES. This took place July 2, 2006.




Algebraic and Coalgebraic Methods in the Mathematics of Program Construction


Book Description

Program construction is about turning specifications of computer software into implementations. Recent research aimed at improving the process of program construction exploits insights from abstract algebraic tools such as lattice theory, fixpoint calculus, universal algebra, category theory, and allegory theory. This textbook-like tutorial presents, besides an introduction, eight coherently written chapters by leading authorities on ordered sets and complete lattices, algebras and coalgebras, Galois connections and fixed point calculus, calculating functional programs, algebra of program termination, exercises in coalgebraic specification, algebraic methods for optimization problems, and temporal algebra.




Mathematics of Program Construction


Book Description

This book constitutes the refereed proceedings of the 7th International Conference on the Mathematics of Program Construction, MPC 2004, held in Stirling, Scotland, UK in July 2004. The 19 revised full papers presented were carefully reviewed and selected from 37 submissions. Among the topics addressed are programming theory, programming methodology, program specification, program transformation, programming paradigms, programming calculi, and programming language semantics.




Mathematics of Program Construction


Book Description

This book constitutes the refereed proceedings of the 11th International Conference on Mathematics of Program Construction, MPC 2012, held in Madrid, Spain, in June 2012. The 13 revised full papers presented together with three invited talks were carefully reviewed and selected from 27 submissions. The papers are organized in topical sections on security and information flow, synchronous and real-time systems, algorithms and games, program calculi, tool support, algebras and datatypes, and categorical functional programming.




Mathematical Frameworks For Component Software: Models For Analysis And Synthesis


Book Description

The range of components technology is both wide and diverse, but some common understanding is emerging through the ideas of model-based development. These include the notions of interfaces, contracts, services, connectors and architectures. Key issues in the application of the technology are becoming clearer, including the consistent integration of different views of a component, component composition, component coordination and transformation for platforms. However, we still know little about theories that support analysis and synthesis of component-based systems. The distinct feature of this volume is its focus on mathematical models that identify the “core” concepts as first class modeling elements, and its providing of techniques for integrating and relating them. The volume contains eleven chapters by well-established researchers writing from different perspectives. Each chapter gives explicit definitions of components in terms of a set of key aspects and addresses some of the problems of integration and analysis of various views: component specification, component composition, component coordination, refinement and substitution, and techniques for solving problems. The concepts and techniques are motivated and explained with the help of examples and case studies.




Relational and Algebraic Methods in Computer Science


Book Description

This book constitutes the proceedings of the 12 International Conference on Relational and Algebraic Methods in Computer Science, RAMICS 2011, held in Rotterdam, The Netherlands, in May/June 2011. This conference merges the RelMICS (Relational Methods in Computer Science) and AKA (Applications of Kleene Algebra) conferences, which have been a main forum for researchers who use the calculus of relations and similar algebraic formalisms as methodological and conceptual tools. Relational and algebraic methods and software tools turn out to be useful for solving problems in social choice and game theory. For that reason this conference included a special track on Computational Social Choice and Social Software. The 18 papers included were carefully reviewed and selected from 27 submissions. In addition the volume contains 2 invited tutorials and 5 invited talks.




Algebra, Meaning, and Computation


Book Description

This volume - honoring the computer science pioneer Joseph Goguen on his 65th Birthday - includes 32 refereed papers by leading researchers in areas spanned by Goguen's work. The papers address a variety of topics from meaning, meta-logic, specification and composition, behavior and formal languages, as well as models, deduction, and computation, by key members of the research community in computer science and other fields connected with Joseph Goguen's work.




Formal Methods for Components and Objects


Book Description

This book presents revised tutorial lectures given by invited speakers at the First International Symposium on Formal Methods for Components and Objects, FMCO 2002, held in Leiden, The Netherlands, in November 2002. The 21 revised lectures by leading researchers present a comprehensive account of the potential of formal methods applied to complex software systems such as components and object systems. The book makes a unique contribution to bridging the gap between theory and practice in software engineering.




Programming Languages and Systems


Book Description

The 23 papers presented together with 4 invited papers 2 system and tool presentations and 1 tutorial lecture were carefully reviewed and selected from 95 initial submissions. The papers are devoted to both foundational and practical issues in programming languages and systems and feature current research in the following areas: semantics, logics, foundational theory, design of languages and foundational calculi, type systems, compilers, interpreters, abstract machines, program derivation, analysis, transformation, software security, safety, verification, concurrency, constraints, domain-specific languages, as well as tools for programming, verification, and implementation.