Compositional Specification in Rewriting Logic

DOI10.1017/S1471068419000425zbMath1434.68301arXiv1908.11769WikidataQ123905805 ScholiaQ123905805MaRDI QIDQ5108529

Unnamed Author, Óscar Martín, Alberto Verdejo

Publication date: 4 May 2020

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.11769

zbMATH Keywords

modularityrewriting logiccompositional specificationsynchronous product

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Uses Software

• Maude
• Reo
• SCEL

Cites Work

• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• A calculus of communicating systems
• Conditional rewriting logic as a unified model of concurrency
• Abstract congruence closure
• Synchronous products of rewrite systems
• Egalitarian State-Transition Systems
• Connector algebras for C/E and P/T nets' interactions
• Deduction, Strategies, and Rewriting
• How to Translate Efficiently Extensions of Temporal Logics into Alternating Automata
• The Temporal Logic of Rewriting: A Gentle Introduction
• Coloured Petri Nets
• Communicating sequential processes
• Three logics for branching bisimulation
• Cospan/Span(Graph): An Algebra for open, reconfigurable automata networks
• An action-based framework for veryfying logical and behavioural properties of concurrent systems
• Reo: a channel-based coordination model for component composition
• Understanding Petri Nets
• The Linear Temporal Logic of Rewriting Maude Model Checker
• From LOTOS to LNT
• A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting
• Assembly Theories for Communication-Safe Component Systems
• A Rewriting Semantics for Maude Strategies
• Model Checking TLR* Guarantee Formulas on Infinite Systems
• Communicating Sequential Processes. The First 25 Years
• FM 2005: Formal Methods
• Integrated Formal Methods
• Parameterized programming for compositional system specification
• 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: Compositional Specification in Rewriting Logic