Introducing Binary Decision Diagrams in the explicit-state verification of Java code

von Rhein, Alexander, Apel, Sven and Raimondi, Franco ORCID logoORCID: (2011) Introducing Binary Decision Diagrams in the explicit-state verification of Java code. In: The Java Pathfinder Workshop (co-located with ASE 2011), 12 Nov 2011, Oread, Lawrence, Kansas. . [Conference or Workshop Item]

[img] PDF - Draft pre-submission version (with author's formatting)
Restricted to Repository staff and depositor only

Download (307kB)


One of the big performance problems of software model checking is the state-explosion problem. Various tools exist to tackle this problem. One of such tools is Java Pathfinder (JPF) an explicit-state model checker for Java code that has been used to verify efficiently a number of real applications.
We present jpf-bdd, a JPF extension that allows users to annotate Boolean variables in the system under test to be managed using Binary Decision Diagrams (BDDs). Our tool partitions the program states of the system being verified and manages one part using BDDs. It maintains a formula for the values of these state partitions at every point during the verification. This allows us to merge states that would be kept distinct otherwise, thereby reducing the effect of the state-explosion problem.
We demonstrate the performance improvement of our extension by means of three example programs including an implementation of the well-known dining- philosophers problem.

Item Type: Conference or Workshop Item (Paper)
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 15117
Notes on copyright: Access to full text restricted pending copyright check.
Useful Links:
Depositing User: Franco Raimondi
Date Deposited: 23 Apr 2015 07:54
Last Modified: 30 Nov 2022 00:58

Actions (login required)

View Item View Item


Activity Overview
6 month trend
6 month trend

Additional statistics are available via IRStats2.