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
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
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
Theoretical Computer Science - Selected papers of CMCS'03
Automata and fixed point logic: a coalgebraic perspective
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
A modal proof theory for final polynomial coalgebras
Theoretical Computer Science
Automata and fixed point logic: A coalgebraic perspective
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Towards the introduction of QoS information in a component model
Proceedings of the 2010 ACM Symposium on Applied Computing
Formalization of data flow computing and a coinductive approach to verifying flowware synthesis
Transactions on computational science I
Applications of Algebra and Coalgebra in Scientific Modelling
Electronic Notes in Theoretical Computer Science (ENTCS)
Bisimulation proof methods in a path-based specification language for polynomial coalgebras
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
A perspective on component refinement
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
The least fibred lifting and the expressivity of coalgebraic modal logic
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Covarieties of coalgebras: comonads and coequations
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
An introduction to coalgebraic specification is presented via examples. A coalgebralc 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.