Comparing Source Sets and Persistent Sets for Partial Order Reduction

DOI10.1007/978-3-319-63121-9_26zbMath1431.68062OpenAlexW2739356170MaRDI QIDQ5217316

Stavros Aronis, Parosh Aziz Abdulla, Bengt Jonsson, Konstantinos Sagonas

Publication date: 24 February 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-63121-9_26

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

A pragmatic approach to stateful partial order reduction ⋮ Quasi-optimal partial order reduction

This page was built for publication: Comparing Source Sets and Persistent Sets for Partial Order Reduction