IJIT: An API for Boolean Program Analysis with Just-in-Time Translation (Extended Technical Report)
This work addresses a bottleneck in program verification for researchers and practitioners by automating algorithm adaptation, though it is incremental as it builds on existing exploration techniques.
The paper tackles the laborious and error-prone manual adaptation of transition system exploration algorithms for program verification by introducing the IJIT API, which automatically transforms these algorithms to operate on Boolean programs with just-in-time translation, enabling effortless extension of non-trivial model checking algorithms to multi-threaded Boolean programs.
Exploration algorithms for explicit-state transition systems are a core back-end technology in program verification. They can be applied to programs by generating the transition system on the fly, avoiding an expensive up-front translation. An on-the-fly strategy requires significant modifications to the implementation, into a form that stores states directly as valuations of program variables. Performed manually on a per-algorithm basis, such modifications are laborious and error-prone. In this paper we present the IJIT Application Programming Interface (API), which allows users to automatically transform a given transition system exploration algorithm to one that operates on Boolean programs. The API converts system states temporarily to program states just in time for expansion via image computations, forward or backward. Using our API, we have effortlessly extended various non-trivial (e.g. infinite-state) model checking algorithms to operate on multi-threaded Boolean programs. We demonstrate the ease of use of the API, and present a case study on the impact of the just-in-time translation on these algorithms.