Reconciling preemption bounding with DPOR

DOI10.1007/978-3-031-30823-9_5zbMATH Open1543.68224MaRDI QIDQ6535344

Viktor Vafeiadis, Michalis Kokologiannakis, Iason Marmanis

Publication date: 13 December 2023

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Title not available (Why is that?)
• Stateless model checking under a reads-value-from equivalence
• Stateless model checking for TSO and PSO
• The topological structure of asynchronous computability
• Context-Bounded Analysis of TSO Systems
• Stateless Model Checking for TSO and PSO
• Dynamic partial-order reduction for model checking software
• Optimal dynamic partial order reduction
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: Reconciling preemption bounding with DPOR

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