---
_id: '9987'
abstract:
- lang: eng
text: 'Stateless model checking (SMC) is one of the standard approaches to the verification
of concurrent programs. As scheduling non-determinism creates exponentially large
spaces of thread interleavings, SMC attempts to partition this space into equivalence
classes and explore only a few representatives from each class. The efficiency
of this approach depends on two factors: (a) the coarseness of the partitioning,
and (b) the time to generate representatives in each class. For this reason, the
search for coarse partitionings that are efficiently explorable is an active research
challenge. In this work we present RVF-SMC , a new SMC algorithm that uses a
novel reads-value-from (RVF) partitioning. Intuitively, two interleavings are
deemed equivalent if they agree on the value obtained in each read event, and
read events induce consistent causal orderings between them. The RVF partitioning
is provably coarser than recent approaches based on Mazurkiewicz and “reads-from”
partitionings. Our experimental evaluation reveals that RVF is quite often a very
effective equivalence, as the underlying partitioning is exponentially coarser
than other approaches. Moreover, RVF-SMC generates representatives very efficiently,
as the reduction in the partitioning is often met with significant speed-ups in
the model checking task.'
acknowledgement: The research was partially funded by the ERC CoG 863818 (ForM-SMArt)
and the Vienna Science and Technology Fund (WWTF) through project ICT15-003.
alternative_title:
- LNCS
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Pratyush
full_name: Agarwal, Pratyush
last_name: Agarwal
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Shreya
full_name: Pathak, Shreya
last_name: Pathak
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Viktor
full_name: Toman, Viktor
id: 3AF3DA7C-F248-11E8-B48F-1D18A9856A87
last_name: Toman
orcid: 0000-0001-9036-063X
citation:
ama: 'Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. Stateless model
checking under a reads-value-from equivalence. In: 33rd International Conference
on Computer-Aided Verification . Vol 12759. Springer Nature; 2021:341-366.
doi:10.1007/978-3-030-81685-8_16'
apa: 'Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., & Toman, V.
(2021). Stateless model checking under a reads-value-from equivalence. In 33rd
International Conference on Computer-Aided Verification (Vol. 12759, pp.
341–366). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-81685-8_16'
chicago: Agarwal, Pratyush, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis,
and Viktor Toman. “Stateless Model Checking under a Reads-Value-from Equivalence.”
In 33rd International Conference on Computer-Aided Verification , 12759:341–66.
Springer Nature, 2021. https://doi.org/10.1007/978-3-030-81685-8_16.
ieee: P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, and V. Toman, “Stateless
model checking under a reads-value-from equivalence,” in 33rd International
Conference on Computer-Aided Verification , Virtual, 2021, vol. 12759, pp.
341–366.
ista: 'Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. 2021. Stateless
model checking under a reads-value-from equivalence. 33rd International Conference
on Computer-Aided Verification . CAV: Computer Aided Verification , LNCS, vol.
12759, 341–366.'
mla: Agarwal, Pratyush, et al. “Stateless Model Checking under a Reads-Value-from
Equivalence.” 33rd International Conference on Computer-Aided Verification
, vol. 12759, Springer Nature, 2021, pp. 341–66, doi:10.1007/978-3-030-81685-8_16.
short: P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, V. Toman, in:, 33rd
International Conference on Computer-Aided Verification , Springer Nature, 2021,
pp. 341–366.
conference:
end_date: 2021-07-23
location: Virtual
name: 'CAV: Computer Aided Verification '
start_date: 2021-07-20
corr_author: '1'
date_created: 2021-09-05T22:01:24Z
date_published: 2021-07-15T00:00:00Z
date_updated: 2026-04-08T07:00:30Z
day: '15'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-030-81685-8_16
ec_funded: 1
external_id:
arxiv:
- '2105.06424'
isi:
- '000698732400016'
file:
- access_level: open_access
checksum: 4b346e5fbaa8b9bdf107819c7b2aadee
content_type: application/pdf
creator: dernst
date_created: 2022-05-13T07:00:20Z
date_updated: 2022-05-13T07:00:20Z
file_id: '11368'
file_name: 2021_LNCS_Agarwal.pdf
file_size: 1516756
relation: main_file
success: 1
file_date_updated: 2022-05-13T07:00:20Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '07'
oa: 1
oa_version: Published Version
page: 341-366
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: '33rd International Conference on Computer-Aided Verification '
publication_identifier:
eisbn:
- 978-3-030-81685-8
eissn:
- 1611-3349
isbn:
- 978-3-030-81684-1
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '10199'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Stateless model checking under a reads-value-from equivalence
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: '12759 '
year: '2021'
...