Algebraic simulations
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1729952 (Why is no real title available?)
- scientific article; zbMATH DE number 438994 (Why is no real title available?)
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 4047065 (Why is no real title available?)
- scientific article; zbMATH DE number 1189278 (Why is no real title available?)
- scientific article; zbMATH DE number 3703962 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 3757688 (Why is no real title available?)
- scientific article; zbMATH DE number 49477 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 2102703 (Why is no real title available?)
- scientific article; zbMATH DE number 2102725 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Algebra and Coalgebra in Computer Science
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Automated deduction -- CADE-19. 19th international conference on automated deduction, Miami Beach, FL, USA, July 28 -- August 2, 2003. Proceedings
- CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
- Characterizing finite Kripke structures in propositional temporal logic
- Conditional rewriting logic as a unified model of concurrency
- Correct Hardware Design and Verification Methods
- ELAN from a rewriting logic point of view
- Equational abstractions
- Equational rules for rewriting logic
- Forward and backward simulations. I. Untimed Systems
- Handbook of philosophical logic. Vol. 9
- Maude: specification and programming in rewriting logic
- On degrees of unsolvability
- Property preserving abstractions for the verification of concurrent systems
- Recent Trends in Algebraic Development Techniques
- Rewriting logic: Roadmap and bibliography
- Semantic foundations for generalized rewrite theories
- Specification and proof in membership equational logic
- Term Rewriting and Applications
- The Maude LTL model checker
- The Temporal Logic of Rewriting: A Gentle Introduction
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
Cited in
(15)- Compositional specification in rewriting logic
- Twenty years of rewriting logic
- Simulation and verification of synchronous set relations in rewriting logic
- A Verification Logic for Rewriting Logic
- Building correct-by-construction systems with formal patterns
- Equational abstractions in rewriting logic and Maude
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- Verifying Reachability-Logic Properties on Rewriting-Logic Specifications
- ASM-based formal design of an adaptivity component for a cloud system
- Algebraic stuttering simulations
- Model-Checking Helena Ensembles with Spin
- Recent Trends in Algebraic Development Techniques
- Amalgamation of domain specific languages with behaviour
- Applying ELAN strategies in simulating processors over simple architectures
- José Meseguer: scientist and friend extraordinaire
This page was built for publication: Algebraic simulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844884)
