Automating memory model metatheory with intersections

DOI10.4230/LIPICS.CONCUR.2024.33MaRDI QIDQ6859915zbMATH OpenFDO

Authors Aristotelis Koutsouridis, Michalis Kokologiannakis, Viktor Vafeiadis

Publication date 10 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2024.33

zbMATH Keywords

Kleene algebraweak memory models

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• Allegories: decidability and graph homomorphisms
• Concurrent Kleene Algebra
• Concurrent Kleene algebra with tests
• Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks
• Dynamic partial-order reduction for model checking software
• Equational properties of Kleene algebras of relations with conversion
• Finite-memory automata
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• scientific article; zbMATH DE number 108525 (Why is no real title available?)
• Introduction to algorithms.
• KAT + B!
• Kleene algebra with observations
• Netkat, semantic foundations for networks
• Petri Automata for Kleene Allegories

This page was built for publication: Automating memory model metatheory with intersections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859915)