Simulation and Verification of Synchronous Set Relations in Rewriting Logic
From MaRDI portal
Publication:3098052
DOI10.1007/978-3-642-25032-3_5zbMath1349.68105OpenAlexW25877563MaRDI QIDQ3098052
Publication date: 11 November 2011
Published in: Formal Methods, Foundations and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2060/20120009200
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)
Uses Software
Cites Work
- Unnamed Item
- A formal library of set relations and its application to synchronous languages
- P systems with control nuclei: the concept
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Equational rules for rewriting logic
- Semantic foundations for generalized rewrite theories
- Proving Safety Properties of Rewrite Theories
- Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Evolution Rule Actions
- Defining and Executing P Systems with Structured Data in K
This page was built for publication: Simulation and Verification of Synchronous Set Relations in Rewriting Logic