Initiality, induction, and computability
Algebraic methods in semantics
On observational equivalence and algebraic specification
Journal of Computer and System Sciences
Journal of the ACM (JACM)
Topology and category theory in computer science
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Structured operational semantics and bisimulation as a congruence
Information and Computation
Logical support for modularisation
Papers presented at the second annual Workshop on Logical environments
Hiding and behaviour: an institutional approach
A classical mind
Observational specifications and the indistinguishability assumption
Theoretical Computer Science
Journal of the ACM (JACM)
Behavioural theories and the proof of behavioural properties
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Algebraic approaches to nondeterminism—an overview
ACM Computing Surveys (CSUR)
Theoretical Computer Science
Swinging types = functions + relations + transition systems
Theoretical Computer Science
Equational axiomatizability for coalgebra
Theoretical Computer Science
On implementing behavioral rewriting
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its 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
Towards the one-tiered design of data types and transition systems
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Towards an Algebraic Semantics for the Object Paradigm
Selected papers from the 9th Workshop on Specification of Abstract Data Types Joint with the 4th COMPASS Workshop on Recent Trends in Data Type Specification
Swinging Data Types: Syntax, Semantics, and Theory
Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification
Universal Realization, Persistent Interconnection and Implementation of Abstract Modules
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Proving Behavioural Theorems with Standard First-Order Logic
ALP '94 Proceedings of the 4th International Conference on Algebraic and Logic Programming
Circular Coinductive Rewriting
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
Circular Coinduction
Limits of the "algebraic" specification of abstract data types
ACM SIGPLAN Notices
Hidden coinduction: behavioural correctness proofs for objects
Mathematical Structures in Computer Science
Algebraic Valuations as Behavioral Logical Matrices
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Towards a Behavioral Algebraic Theory of Logical Valuations
Fundamenta Informaticae - Logic, Language, Information and Computation
Studia Logica
| Hi-index | 0.00 |
We show that for any behavioral Σ-specification B there is an ordinary algebraic specification B˜ over a larger signature, such that a model behaviorally satisfies B iff it satisfies, in the ordinary sense, the Σ-theorems of B˜. The idea is to add machinery for contexts and experiments (sorts, operations and equations), use it, and then hide it. We develop a procedure, called unhiding, which takes a finite B and produces a finite B˜. The practical aspect of this procedure is that one can use any standard equational inductive theorem prover to derive behavioral theorems, even if neither equational reasoning nor induction is sound for behavioral satisfaction.