Algebraic Methodology and Software Technology

Invited Talks.- Incremental Software Construction with Refinement Diagrams.- Recursive Program Schemes: Past, Present, and Future.- Monad-Based Logics for Computational Effects.- Contributed Papers.- State Space Representation for Verification of Open Systems.- Data Movement Optimisation in Point-Free Form.- Measuring the Speed of Information Leakage in Mobile Processes.- Formal Islands.- Some Programming Languages for Logspace and Ptime.- Opaque Predicates Detection by Abstract Interpretation.- DO-Casl: An Observer-Based Casl Extension for Dynamic Specifications.- Model Transformations Incorporating Multiple Views.- Hyperfinite Approximations to Labeled Markov Transition Systems.- State Space Reduction of Rewrite Theories Using Invisible Transitions.- The Essence of Multitasking.- The Substitution Vanishes.- Decomposing Interactions.- Verification of Communication Protocols Using Abstract Interpretation of FIFO Queues.- Assessing the Expressivity of Formal Specification Languages.- Fork Algebras as a Sufficiently Rich Universal Institution.- Realizability Criteria for Compositional MSC.- Quantales and Temporal Logics.- Fractional Semantics.- Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic.- Testing Semantics: Connecting Processes and Process Logics.- Tableaux for Lattices.- Accelerated Modal Abstractions of Labelled Transition Systems.- A Compositional Semantics of Plan Revision in Intelligent Agents.- System Descriptions.- ITP/OCL: A Rewriting-Based Validation Tool for UML+OCL Static Class Diagrams.- A Computational Group Theoretic Symmetry Reduction Package for the Spin Model Checker.- Using Category Theory as a Basis for a Heterogeneous Data Source Search Meta-engine: The Prométhée Framework.