Eric Noonan
Abstract
Java Pathfinder (JPF) employs a dynamic partial order reduction based on sharing and state hashing to reduce the schedules in concurrent systems. That partial order reduction is believed to be complete in the new version of JPF using search global IDs (SGOIDs) but does miss behaviors when SGOIDs are not employed. More importantly, it is not clear how such a dynamic partial order reduction, with or without SGOIDs, compares to other dynamic partial order reductions based on persistent sets, sleep sets, or clock vectors. In order to understand JPF's native dynamic partial order reduction better, this paper discusses an implementation of Flanagan and Goidefroid's clock vector partial order reduction in JPF. Then, the performance of JPF's native dynamic partial order reduction and the clock vector partial order reduction in JPF using SGOIDs will be compared in an effort to understand JPF's dynamic partial order reduction more fully. It was discovered that a clock vector POR always performs better in terms of runtime on the benchmarks chosen, and sometimes even better in terms of memory.
- J. Esparza and K. Heljanko. Implementing LTL Model Checking with Net Unfoldings. In M. B. Dwyer, editor, SPIN, volume 2057 of Lecture Notes in Computer Science, pages 37--56. Springer, 2001. Google Scholar
Digital Library
- C. Flanagan and P. Godefroid. Dynamic Partial-order Reduction for Model Checking Software. In POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 110--121, New York, NY, USA, 2005. ACM. Google ScholarDigital Library
- P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem, volume 1032 of Lecture Notes in Computer Science. Springer, 1996. Google ScholarDigital Library
- R. P. Kurshan, V. Levin, M. Minea, D. Peled, and H. Yenigün. Static Partial Order Reduction. In B. Steffen, editor, TACAS, volume 1384 of Lecture Notes in Computer Science, pages 345--357. Springer, 1998. Google ScholarDigital Library
- N. Rungta and E. G. Mercer. Hardness for Explicit State Software Model Checking Benchmarks. In SEFM, pages 247--256. IEEE Computer Society, 2007. Google ScholarDigital Library
Index Terms
- Vector-clock based partial order reduction for JPF
Recommendations
Relaxed Visibility Enhances Partial Order Reduction
State-space explosion is a central problem in the automatic verification (model-checking) of concurrent systems. Partial order reduction is a method that was developed to try to cope with the state-space explosion. Based on the observation that the ...
Formal Verification of an Executable LTL Model Checker with Partial Order Reduction
We present a formally verified and executable on-the-fly LTL model checker that uses ample set partial order reduction. The verification is done using the proof assistant Isabelle/HOL and covers everything from the abstract correctness proof down to the ...
Comments