Explore the latest books of this year!
Bookbot

Till Mossakowski

    Programmieren mit Turbo-Prolog
    Representations, hierarchies and graphs of institutions
    Algebra and coalgebra in computer science
    Recent trends in algebraic development techniques
    • This book constitutes the thoroughly refereed post-conference proceedings of the 20th International Workshop on Algebraic Development Techniques, WADT 2010, held in July 2010 in Etelsen, Germany. The 15 revised papers presented were carefully reviewed and selected from 32 presentations. The workshop deals with the following topics: foundations of algebraic specification; other approaches to formal specification including process calculi and models of concurrent, distributed and mobile computing; specification languages, methods, and environments; semantics of conceptual modeling methods and techniques; model-driven development; graph transformations, term rewriting and proof systems; integration of formal specification techniques; formal testing and quality assurance validation, and verification.

      Recent trends in algebraic development techniques
    • Algebra and coalgebra in computer science

      • 461 pages
      • 17 hours of reading

      The content includes a variety of topics related to logical semantics, concurrency, and algebraic structures. It features invited talks on regular and algebraic words, as well as ordinals, and explores the logical semantics of types within concurrent systems. Key contributions include deriving bisimulation congruences using borrowed contexts, examining symmetry in concurrency, and presenting impossibility results for the equational theory of timed CCS. The annotation highlights conceptual data modeling with constraints in Maude and discusses bisimilarity in open Petri nets. It also addresses free modal algebras from a coalgebraic perspective and explores coalgebraic epistemic updates without changing models. The Maude formal tool environment is presented alongside bifinite Chu spaces and structured co-spans for interaction protocols. Additionally, it covers graphical encodings of spatial logic for the ?-calculus and higher-dimensional trees. A semantic characterization of unbounded-nondeterministic abstract state machines is provided, along with discussions on parametric (co)iteration and bisimulation for neighborhood structures. The work also delves into algebraic models for multithreaded and multi-core processors, quasitoposes, and applications of metric coinduction. Finally, it touches on specification-based testing for CoCasl’s modal specifications and introduces a circular coinductive prover.

      Algebra and coalgebra in computer science