Towards Modelling Actor-Based Concurrency in Term Rewriting
From MaRDI portal
Publication:5240184
DOI10.4230/OASIcs.WPTE.2015.19zbMath1428.68204OpenAlexW2276661322MaRDI QIDQ5240184
Publication date: 24 October 2019
Full work available at URL: https://doi.org/10.4230/oasics.wpte.2015.19
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Scala actors: Unifying thread-based and event-based programming
- Conditional rewriting logic as a unified model of concurrency
- Towards Erlang Verification by Term Rewriting
- Towards Symbolic Execution in Erlang
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Term Rewriting and All That
- Towards Testing Concurrent Objects in CLP
- Verification of Erlang processes by dependency pairs
This page was built for publication: Towards Modelling Actor-Based Concurrency in Term Rewriting