---
OA_place: publisher
OA_type: hybrid
_id: '10190'
abstract:
- lang: eng
  text: 'The verification of concurrent programs remains an open challenge, as thread
    interaction has to be accounted for, which leads to state-space explosion. Stateless
    model checking battles this problem by exploring traces rather than states of
    the program. As there are exponentially many traces, dynamic partial-order reduction
    (DPOR) techniques are used to partition the trace space into equivalence classes,
    and explore a few representatives from each class. The standard equivalence that
    underlies most DPOR techniques is the happens-before equivalence, however recent
    works have spawned a vivid interest towards coarser equivalences. The efficiency
    of such approaches is a product of two parameters: (i) the size of the partitioning
    induced by the equivalence, and (ii) the time spent by the exploration algorithm
    in each class of the partitioning. In this work, we present a new equivalence,
    called value-happens-before and show that it has two appealing features. First,
    value-happens-before is always at least as coarse as the happens-before equivalence,
    and can be even exponentially coarser. Second, the value-happens-before partitioning
    is efficiently explorable when the number of threads is bounded. We present an
    algorithm called value-centric DPOR (VCDPOR), which explores the underlying partitioning
    using polynomial time per class. Finally, we perform an experimental evaluation
    of VCDPOR on various benchmarks, and compare it against other state-of-the-art
    approaches. Our results show that value-happens-before typically induces a significant
    reduction in the size of the underlying partitioning, which leads to a considerable
    reduction in the running time for exploring the whole partitioning.'
acknowledgement: "The authors would also like to thank anonymous referees for their
  valuable comments and helpful suggestions. This work is supported by the Austrian
  Science Fund (FWF) NFN grants S11407-N23 (RiSE/SHiNE) and S11402-N23 (RiSE/SHiNE),
  by the Vienna Science and Technology Fund (WWTF) Project ICT15-003, and by the Austrian
  Science Fund (FWF) Schrodinger grant J-4220.\r\n"
article_number: '124'
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- 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: 'Chatterjee K, Pavlogiannis A, Toman V. Value-centric dynamic partial order
    reduction. In: <i>Proceedings of the 34th ACM International Conference on Object-Oriented
    Programming, Systems, Languages, and Applications</i>. Vol 3. ACM; 2019. doi:<a
    href="https://doi.org/10.1145/3360550">10.1145/3360550</a>'
  apa: 'Chatterjee, K., Pavlogiannis, A., &#38; Toman, V. (2019). Value-centric dynamic
    partial order reduction. In <i>Proceedings of the 34th ACM International Conference
    on Object-Oriented Programming, Systems, Languages, and Applications</i> (Vol.
    3). Athens, Greece: ACM. <a href="https://doi.org/10.1145/3360550">https://doi.org/10.1145/3360550</a>'
  chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric
    Dynamic Partial Order Reduction.” In <i>Proceedings of the 34th ACM International
    Conference on Object-Oriented Programming, Systems, Languages, and Applications</i>,
    Vol. 3. ACM, 2019. <a href="https://doi.org/10.1145/3360550">https://doi.org/10.1145/3360550</a>.
  ieee: K. Chatterjee, A. Pavlogiannis, and V. Toman, “Value-centric dynamic partial
    order reduction,” in <i>Proceedings of the 34th ACM International Conference on
    Object-Oriented Programming, Systems, Languages, and Applications</i>, Athens,
    Greece, 2019, vol. 3.
  ista: 'Chatterjee K, Pavlogiannis A, Toman V. 2019. Value-centric dynamic partial
    order reduction. Proceedings of the 34th ACM International Conference on Object-Oriented
    Programming, Systems, Languages, and Applications. OOPSLA: Object-oriented Programming,
    Systems, Languages and Applications vol. 3, 124.'
  mla: Chatterjee, Krishnendu, et al. “Value-Centric Dynamic Partial Order Reduction.”
    <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming,
    Systems, Languages, and Applications</i>, vol. 3, 124, ACM, 2019, doi:<a href="https://doi.org/10.1145/3360550">10.1145/3360550</a>.
  short: K. Chatterjee, A. Pavlogiannis, V. Toman, in:, Proceedings of the 34th ACM
    International Conference on Object-Oriented Programming, Systems, Languages, and
    Applications, ACM, 2019.
conference:
  end_date: 2019-10-25
  location: Athens, Greece
  name: 'OOPSLA: Object-oriented Programming, Systems, Languages and Applications'
  start_date: 2019-10-23
corr_author: '1'
date_created: 2021-10-27T14:57:06Z
date_published: 2019-10-10T00:00:00Z
date_updated: 2026-04-08T07:00:31Z
day: '10'
ddc:
- '000'
department:
- _id: GradSch
- _id: KrCh
doi: 10.1145/3360550
external_id:
  arxiv:
  - '1909.00989'
file:
- access_level: open_access
  checksum: 2149979c46964c4d117af06ccb6c0834
  content_type: application/pdf
  creator: cchlebak
  date_created: 2021-11-12T11:41:56Z
  date_updated: 2021-11-12T11:41:56Z
  file_id: '10278'
  file_name: 2019_ACM_Chatterjee.pdf
  file_size: 570829
  relation: main_file
  success: 1
file_date_updated: 2021-11-12T11:41:56Z
has_accepted_license: '1'
intvolume: '         3'
keyword:
- safety
- risk
- reliability and quality
- software
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
  grant_number: ICT15-003
  name: Efficient Algorithms for Computer Aided Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11407
  name: Game Theory
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S11402-N23
  name: Moderne Concurrency Paradigms
publication: Proceedings of the 34th ACM International Conference on Object-Oriented
  Programming, Systems, Languages, and Applications
publication_identifier:
  eissn:
  - 2475-1421
publication_status: published
publisher: ACM
quality_controlled: '1'
related_material:
  record:
  - id: '10199'
    relation: dissertation_contains
    status: public
scopus_import: '1'
status: public
title: Value-centric dynamic partial order reduction
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2019'
...
