Source Sets

DOI10.1145/3073408zbMath1426.68038OpenAlexW2747419197MaRDI QIDQ4640276

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

Publication date: 17 May 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3073408

zbMATH Keywords

concurrencysoftware model checkingdynamic partial order reductionsource setssystematic testingwakeup trees

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) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Computing race variants in message-passing concurrent programming with selective receives ⋮ Prefix-based tracing in message-passing concurrency ⋮ A pragmatic approach to stateful partial order reduction ⋮ Quasi-optimal partial order reduction

This page was built for publication: Source Sets