Behavioral abstraction is hiding information
From MaRDI portal
Publication:703529
DOI10.1016/J.TCS.2004.07.027zbMath1105.68076OpenAlexW2120272424MaRDI QIDQ703529
Publication date: 11 January 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.07.027
Related Items (5)
Abstract valuation semantics ⋮ Categorical abstract algebraic logic: behavioral \(\pi\)-institutions ⋮ Behavioral algebraization of logics ⋮ Algebraic Valuations as Behavioral Logical Matrices ⋮ Behavioral algebraization of da Costa's C-systems
Uses Software
Cites Work
- Behavioural theories and the proof of behavioural properties
- Observational specifications and the indistinguishability assumption
- Institution morphisms
- On observational equivalence and algebraic specification
- Modular correctness proofs of behavioural implementations
- Context induction: A proof principle for behavioural abstractions and algebraic implementations
- Structured operational semantics and bisimulation as a congruence
- Recent trends in algebraic development techniques. 13th international workshop, WADT '98, Lisbon, Portugal, April 2--4, 1998. Proceedings
- Recent trends in algebraic development techniques. 12th international workshop, WADT '97, Tarquinia, Italy, June 3--7, 1997. Selected papers
- Swinging types=functions+relations+transition systems
- A hidden agenda
- Maude: specification and programming in rewriting logic
- Automated deduction in classical and non-classical logics. Selected papers
- Constructor-based observational logic
- Coalgebras for Binary Methods: Properties of Bisimulations and Invariants
- Greatest Bisimulations for Binary Methods
- Module algebra
- Bisimulation and Hidden Algebra
- Hidden coinduction: behavioural correctness proofs for objects
- Institutions: abstract model theory for specification and programming
- Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
- Recent Trends in Algebraic Development Techniques
- Equational axiomatizability for coalgebra
- 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
This page was built for publication: Behavioral abstraction is hiding information
