Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Handbook of logic in computer science (vol. 2)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
IEEE Transactions on Software Engineering
Operating systems (2nd ed.): design and implementation
Operating systems (2nd ed.): design and implementation
Verification of sequential and concurrent programs (2nd ed.)
Verification of sequential and concurrent programs (2nd ed.)
Objects and classes, co-algebraically
Object orientation with parallelism and persistence
Reasoning about Java classes: preliminary report
Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Object-oriented hybrid systems of coalgebras plus monoid actions
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Distributed Algorithms
Algebraic Foundations of Systems Specification
Algebraic Foundations of Systems Specification
Reasonong about Classess in Object-Oriented Languages: Logical Models and Tools
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
A Logic for Parametric Polymorphism
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A Logic for Abstract Data Types as Existential Types
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Coalgebra semantics for hidden algebra: Parameterised objects an inheritance
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Mongruences and Cofree Coalgebras
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Invariants, Bisimulations and the Correctness of Coalgebraic Refinements
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Inheritance and Cofree Constructions
ECCOP '96 Proceedings of the 10th European Conference on Object-Oriented Programming
Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Behaviour-Refinement of Coalgebraic Specifications with Coinductive Correctness Proofs
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Simulation Techniques for Proving Properties of Real-Time Systems
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
The temporal logic of coalgebras via Galois algebras
Mathematical Structures in Computer Science
Pre-Galois Connection on Coalgebras for Generic Component Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Inductive and Coinductive Components of Corecursive Functions in Coq
Electronic Notes in Theoretical Computer Science (ENTCS)
On the algebraic structure of declarative programming languages
Theoretical Computer Science
A Single Complete Relational Rule for Coalgebraic Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Trace Semantics for Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata and Fixed Point Logics for Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
A Coalgebraic Semantic Framework for Component-based Development in UML
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
An introduction to coalgebraic specification is presented via examples. A coalgebraic specification describes a collection of coalgebras satisfying certain assertions. It is thus an axiomatic description of a particular class of mathematical structures. Such specifications are especially suitable for state-based dynamical systems in general, and for classes in object-oriented programming languages in particular. This chapter will gradually introduce the notions of bisimilarity, invariance, component classes, temporal logic and refinement in a coalgebraic setting. Besides the running example of the coalgebraic specification of (possibly infinite) binary trees, a specification of Peterson's mutual exclusion algorithm is elaborated in detail.