Bits and pieces of the theory of institutions
Proceedings of a tutorial and workshop on Category theory and computer programming
On observational equivalence and algebraic specification
Journal of Computer and System Sciences
Abstract and concrete categories
Abstract and concrete categories
Topology and category theory in computer science
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Logical support for modularisation
Papers presented at the second annual Workshop on Logical environments
Hiding and behaviour: an institutional approach
A classical mind
Towards an algebraic semantics for the object paradigm
Selected papers from 9th workshop on Specification of abstract data types : recent trends in data type specification: recent trends in data type specification
On behavioural abstraction and behavioural satisfaction in higher-order logic
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Theoretical Computer Science
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Behavioural Satisfaction and Equivalence in Concrete Model Categories
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
On the Integration of Observability and Reachability Concepts
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Observational logic, constructor-based logic, and their duality
Theoretical Computer Science - Foundations of software science and computation structures
Institution-independent ultraproducts
Fundamenta Informaticae
Mathematical Structures in Computer Science
Elementary Diagrams in Institutions
Journal of Logic and Computation
Institution-independent Model Theory
Institution-independent Model Theory
Observational interpretation of casl specifications
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
We show that any institution ${\mathcal I}$ satisfying some reasonable conditions can be transformed into another institution, ${\mathcal I}_{beh}$, which captures formally and abstractly the intuitions of adding support for behavioral equivalence and reasoning to an existing, particular algebraic framework. We call our transformation an “extension” because ${\mathcal I}_{beh}$ has the same sentences as ${\mathcal I}$ and because its entailment relation includes that of ${\mathcal I}$. Many properties of behavioral equivalence in concrete hidden logics follow as special cases of corresponding institutional results. As expected, the presented constructions and results can be instantiated to other logics satisfying our requirements as well, thus leading to novel behavioral logics, such as partial or infinitary ones, that have the desired properties.