• Home
  • Search
  • A Sound Dynamic Partial Order Reduction Engine for Java Pathfinder
  • Cite Icon3
  • https://doi.org/10.1145/3364452.3364457Copy DOI Icon

A Sound Dynamic Partial Order Reduction Engine for Java Pathfinder

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

When model checking a multi-threaded program, it is often nec- essary to enumerate the possible ordering of concurrent events to evaluate the behavior of the program. However, enumerating every possible order of events quickly leads to state-space explo- sion. Dynamic Partial Order Reduction (DPOR) is a method to dynamically determine a subset of schedules that need to be evaluated to observe all the relevant behavior of a program. A sound implementation of DPOR in Java Path nder (JPF) can be tricky without incurring unacceptable amounts of overhead, be- cause JPF does not support subdividing existing transitions and conservatively inserting choice generators to end transitions at each possible scheduling point causes JPF to save a large amount of state. We present an extension to JPF, which is an efficient implementation of DPOR that attempts to minimize spacial com- plexity. It handles the directing of the search and uses a simple interface to allow the user to de ne the set of events to operate on and to determine which of those events are dependent. It keeps its own internal representation of all possible scheduling points without inserting choice generators at each point. It then restarts portions of the search, if necessary, to insert only the needed choice generators.

Similar Papers
  • Research Article
  • Citations8

Vector-clock based partial order reduction for JPF

  • Feb 11, 2014
  • ACM SIGSOFT Software Engineering Notes
  • Eric Noonan +2
  • Research Article
  • Citations4

Bounded partial-order reduction

  • Oct 29, 2013
  • ACM SIGPLAN Notices
  • Katherine E Coons +2
  • Book Chapter
  • Citations2

Stateful Dynamic Partial Order Reduction for Model Checking Event-Driven Applications that Do Not Terminate

  • Jan 01, 2022
  • Rahmadi Trimananda +3
  • Research Article

Awaiting for Godot: stateless model checking that avoids executions where nothing happens

  • Jul 25, 2025
  • Formal Methods in System Design
  • Bengt Jonsson +2
  • Conference Article
  • Citations33

Improving Dynamic Partial Order Reductions for Concolic Testing

  • Jun 01, 2012
  • Olli Saarikivi +2
  • Conference Article
  • Citations8

Optimal context-sensitive dynamic partial order reduction with observers

  • Jul 10, 2019
  • Elvira Albert +4
  • Research Article
  • Citations2

Optimal dynamic partial order reduction with context-sensitive independence and observers

  • Apr 29, 2023
  • Journal of Systems and Software
  • Elvira Albert +4
  • Book Chapter
  • Citations94

Efficient Stateful Dynamic Partial Order Reduction

  • Aug 13, 2008
  • Yu Yang +3
  • Research Article
  • Citations3

Distributed dynamic partial order reduction

  • Apr 06, 2010
  • International Journal on Software Tools for Technology Transfer
  • Yu Yang +3
  • Book Chapter
  • Citations13

Scalable Dynamic Partial Order Reduction

  • Jan 01, 2013
  • Jiri Simsa +3
  • PDF
  • Book Chapter
  • Citations25

Constrained Dynamic Partial Order Reduction

  • Jan 01, 2018
  • Elvira Albert +3
  • Book Chapter
  • Citations56

Distributed Dynamic Partial Order Reduction Based Verification of Threaded Software

  • Aug 30, 2007
  • Yu Yang +3
  • Book Chapter
  • Citations38

Context-Sensitive Dynamic Partial Order Reduction

  • Jan 01, 2017
  • Elvira Albert +4
  • PDF
  • Book Chapter
  • Citations4

Parsimonious Optimal Dynamic Partial Order Reduction

  • Jan 01, 2024
  • Parosh Aziz Abdulla +4
  • Book Chapter
  • Citations6

Comparing Source Sets and Persistent Sets for Partial Order Reduction

  • Jan 01, 2017
  • Parosh Abdulla +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.