A hidden agenda
From MaRDI portal
Publication:1575735
DOI10.1016/S0304-3975(99)00275-3zbMath0946.68070MaRDI QIDQ1575735
Grant Malcolm, Joseph A. Goguen
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Formal design and verification of operational transformation algorithms for copies convergence, Observational logic, constructor-based logic, and their duality., Bisimulation and Hidden Algebra, Characterising Behavioural Equivalence: Three Sides of One Coin, Closure properties for the class of behavioral models, Behavioral equivalence of hidden \(k\)-logics: an abstract algebraic approach, A Proof Score Approach to Formal Verification of an Imperative Programming Language Compiler, A PARAMETERIZATION PROCESS: FROM A FUNCTORIAL POINT OF VIEW, Action Algebras and Model Algebras in Denotational Semantics, Abstract valuation semantics, A short overview of Hidden Logic, Foundations for structuring behavioural specifications, Coinduction for preordered algebra, From hidden to visible: a unified framework for transforming behavioral theories into rewrite theories, Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs, Observational Refinement Process, From Grammars and Automata to Algebras and Coalgebras, Integrating Observational and Computational Features in the Specification of State-Based, Dynamical Systems, Coalgebras for Binary Methods: Properties of Bisimulations and Invariants, Unnamed Item, Diagrammatic logic applied to a parameterisation process, Behavioral abstraction is hiding information, Semantic constructions for the specification of objects, Equational axiomatizability for coalgebra, Behavioural reasoning for conditional equations, Coalgebraic description of generalised binary methods, Object oriented institutions to specify symbolic computation systems, Behavioral algebraization of logics, Algebraic Valuations as Behavioral Logical Matrices, Sheaves, Objects, and Distributed Systems, Behavioral algebraization of da Costa's C-systems, Towards Behavioral Maude, Formalizing in Coq Hidden Algebras to Specify Symbolic Computation Systems, A hidden Herbrand theorem: Combining the object and logic paradigms, On institutions for modular coalgebraic specifications., Compositional SOS and beyond: A coalgebraic view of open systems, Expander2: Program Verification Between Interaction and Automation, Model-based specification, On the complexity of stream equality, Logical foundations of CafeOBJ
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Data structures and program transformation
- Denotational semantics of a parallel object-oriented language
- Toward formal development of programs from algebraic specifications: Implementations revisited
- Final algebra semantics and data type extensions
- Algebraic implementation of abstract data types
- Conditional rewriting logic as a unified model of concurrency
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- A calculus of mobile processes. II
- Final algebras, cosemicomputable algebras and degrees of unsolvability
- Universal coalgebra: A theory of systems
- Category theory and computer science. Manchester, UK, September 5--8, 1989. Proceedings
- Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems
- Behavioural and abstractor specifications
- Terminal coalgebras in well-founded set theory
- Proof of correctness of data representations
- Parameterized Programming
- Process Algebra
- Semantics of computation
- Abstract data types and the development of data structures
- Initial Algebra Semantics and Continuous Algebras
- Abstract and behaviour module specifications
- Hidden coinduction: behavioural correctness proofs for objects
- Institutions: abstract model theory for specification and programming
- An Oxford survey of order sorted algebra
- An approach to object semantics based on terminal co-algebras
- Algebraic implementation of abstract data types: a survey of concepts and new compositionality results
- Mongruences and cofree coalgebras
- Automata in general algebras
- Equality, types, modules, and (why not?) generics for logic programming
