Computing race variants in message-passing concurrent programming with selective receives

DOI10.1007/978-3-031-08679-3_12zbMath1499.68070arXiv2210.03026OpenAlexW4293196910MaRDI QIDQ2165226

Germán Vidal

Publication date: 19 August 2022

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

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• Erlang
• go
• Rust
• Akka
• CauDEr

Cites Work

• Unnamed Item
• A theory of reversibility for Erlang
• Optimal dynamic partial order reduction with observers
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Time, clocks, and the ordering of events in a distributed system
• Source Sets
• Causal-Consistent Replay Reversible Semantics for Message Passing Concurrent Programs
• Dynamic partial-order reduction for model checking software
• Prefix-based tracing in message-passing concurrency
• Causal-consistent replay debugging for message passing programs

This page was built for publication: Computing race variants in message-passing concurrent programming with selective receives