Swinging types=functions+relations+transition systems

DOI10.1016/S0304-3975(00)00171-7zbMath0947.68098MaRDI QIDQ1575635

Peter Padawitz

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

transition systemsswinging types

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Observational logic, constructor-based logic, and their duality. ⋮ Closure properties for the class of behavioral models ⋮ Behavioral equivalence of hidden \(k\)-logics: an abstract algebraic approach ⋮ A short overview of Hidden Logic ⋮ Observational Refinement Process ⋮ From Grammars and Automata to Algebras and Coalgebras ⋮ Integrating Observational and Computational Features in the Specification of State-Based, Dynamical Systems ⋮ Behavioral abstraction is hiding information ⋮ Shallow confluence of conditional term rewriting systems ⋮ Expander2: Program Verification Between Interaction and Automation

Uses Software

• CASL
• CafeOBJ
• EXPANDER

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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notions of computation and monads
• Codatatypes in ML
• Toward formal development of programs from algebraic specifications: Implementations revisited
• Final algebra semantics and data type extensions
• Specifications, models, and implementations of data abstractions
• Algebraic implementation of abstract data types
• Fixed point theorems and semantics: A folk tale
• Partial abstract types
• Observational structures and their logic
• Structured operational semantics and bisimulation as a congruence
• Specification of abstract dynamic-data types: A temporal logic approach
• Universal coalgebra: A theory of systems
• Automated deduction by theory resolution
• Logic of transition systems
• Behavioural and abstractor specifications
• Inductive theorem proving for design specifications
• Proof of correctness of data representations
• Algebraic laws for nondeterminism and concurrency
• Completion of a Set of Rules Modulo a Set of Equations
• Semantics-Based Translation Methods for Modal Logics
• Process Algebra
• Deduction and Declarative Programming
• Abstract data types and software validation
• Hidden coinduction: behavioural correctness proofs for objects
• An Oxford survey of order sorted algebra
• Conditional equational specifications of data types with partial operations for inductive theorem proving
• Parametrized data types do not need highly constrained parameters
• An approach to object semantics based on terminal co-algebras
• Proving the correctness of behavioural implementations