Stateless model checking under a reads-value-from equivalence

DOI10.1007/978-3-030-81685-8_16zbMath1493.68200arXiv2105.06424OpenAlexW3184331482MaRDI QIDQ832184

Pratyush Agarwal, Andreas Pavlogiannis, Shreya Pathak, Krishnendu Chatterjee, Viktor Toman

Publication date: 25 March 2022

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

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)

Uses Software

• veriSoft
• CHESS

Cites Work

• Unnamed Item
• Reducing concurrent analysis under a context bound to sequential analysis
• Stateless model checking for TSO and PSO
• State space reduction using partial order techniques
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Context-sensitive dynamic partial order reduction
• Optimal dynamic partial order reduction with observers
• Testing Shared Memories
• On the Complexity of Bounded Context Switching.
• Dynamic partial-order reduction for model checking software
• Optimal dynamic partial order reduction
• Quasi-optimal partial order reduction

This page was built for publication: Stateless model checking under a reads-value-from equivalence