Handbook of theoretical computer science (vol. B)
Handbook of logic in computer science (vol. 1)
Algebra of programming
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
A Theory of Objects
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
IEEE Transactions on Software Engineering
Components as coalgebras: the refinement dimension
Theoretical Computer Science - Algebraic methodology and software technology
Modelling angelic and demonic nondeterminism with multirelations
Science of Computer Programming
Closure properties for the class of behavioral models
Theoretical Computer Science
Behavioural reasoning for conditional equations
Mathematical Structures in Computer Science
On the Behavioral Equivalence Between k-data Structures
The Computer Journal
Calculating Invariants as Coreflexive Bisimulations
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Refinement by Interpretation in a General Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
SEFM '09 Proceedings of the 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods
CIRC: a behavioral verification tool based on circular coinduction
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Hi-index | 0.00 |
In Computer Science stepwise refinement of algebraic specifications is a well-known formal methodology for rigorous program development. This paper illustrates how techniques from Algebraic Logic, in particular that of interpretation, understood as a multifunction that preserves and reflects logical consequence, capture a number of relevant transformations in the context of software design, reuse, and adaptation, difficult to deal with in classical approaches. Examples include data encapsulation and the decomposition of operations into atomic transactions. But if interpretations open such a new research avenue in program refinement, (conceptual) tools are needed to reason about them. In this line, the paper's main contribution is a study of the correspondence between logical interpretations and morphisms of a particular kind of coalgebras. This opens way to the use of coalgebraic constructions, such as simulation and bisimulation, in the study of interpretations between (abstract) logics.