Initial computability, algebraic specifications, and partial algebras
Initial computability, algebraic specifications, and partial algebras
On observational equivalence and algebraic specification
Journal of Computer and System Sciences
Specifications in an arbitrary institution
Information and Computation - Semantics of Data Types
Abstract and concrete categories
Abstract and concrete categories
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Behavioural and abstractor specifications
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
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
Proof systems for structured specifications with observability operators
Theoretical Computer Science - Special issue: algebraic development techniques
Specification of abstract data types
Specification of abstract data types
Theoretical Computer Science
Swinging types = functions + relations + transition systems
Theoretical Computer Science
Algebraic Foundations of Systems Specification
Algebraic Foundations of Systems Specification
On institutions for modular coalgebraic specifications
Theoretical Computer Science
CASL: the common algebraic specification language
Theoretical Computer Science
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
A Modular Framework for Specification and Implementation
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and 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
Coalgebras and modal logic for parameterised endofunctors
Coalgebras and modal logic for parameterised endofunctors
Equality of streams is a Π0 over 2-complete problem
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Observational Refinement Process
Electronic Notes in Theoretical Computer Science (ENTCS)
Circular Coinduction with Special Contexts
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Constructor-based institutions
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Linking algebraic observational equivalence and bisimulation
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Behavioral extensions of institutions
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
On the complexity of equivalence of specifications of infinite objects
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Interpolation in logics with constructors
Theoretical Computer Science
The duality of state and observation in probabilistic transition systems
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
Duality in Logic and Computation
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Observability and reachability are important concepts for formal software development. While observability concepts are used to specify the required observable behavior of a program or system, teachability concepts are used to describe the underlying data in terms of datatype constructors. In this paper we first reconsider the observational logic institution which provides a logical framework for dealing with observabifity. Then we develop in a completely analogous way the constructor-based logic institution which formalizes a novel treatment of reachability. Both institutions are tailored to capture the semantically correct realizations of a specification from either the observational or the reachability point of view. We show that there is a methodological and even formal duality between both frameworks. In particular, we establish a correspondence between observer operations and datatype constructors, observational and constructor-based algebras, fully abstract and reachable algebras, and observational and inductive consequences of specifications. The formal duality between the observability and reachability concepts is established in a category-theoretic setting.