Unfolding-based Partial Order Reduction

DOI10.4230/LIPIcs.CONCUR.2015.456zbMath1374.68342arXiv1507.00980OpenAlexW2964156448MaRDI QIDQ5357723

Subodh Sharma, César Rodríguez, Marcelo S. Sousa, Daniel Kroening

Publication date: 12 September 2017

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

zbMATH Keywords

model checkingconcurrencypartial order reductionunfoldings

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 (6)

Compact and efficiently verifiable models for concurrent systems ⋮ Thread-modular analysis of release-acquire concurrency ⋮ Independence Abstractions and Models of Concurrency ⋮ Unfolding-based dynamic partial order reduction of asynchronous distributed programs ⋮ Deadlock detection-oriented unfolding of unbounded Petri nets ⋮ Quasi-optimal partial order reduction

This page was built for publication: Unfolding-based Partial Order Reduction