Efficient Explicit -State Model Checking for Programs With Dynamically Allocated Data

We implemented Delta Execution in two model checkers, JPF (Java PathFinder) and BOX (Bounded Object eXploration) to evaluate the effectiveness of this technique in model checkers with different designs. The results show that DeltaExecution improves the overall exploration in both tools, but the improvements are due to different factors. We evaluate DeltaExecution on ten simple subject programs and a larger case study. The results show that DeltaExecution improves the exploration time for the smaller programs from 0.88x to 126.80x (with median 5.60x) in JPF and from 0.58x to 4.16x (with median 2.23x) in BOX, while taking from 0.46x to 11.50x (with median 1.48x) less memory in JPF and from 0.18x to 2.71x (with median 1.18x) memory in BOX. The experimental results on one larger case study show that DeltaExecution improves the exploration time from 0.88x to 2.04x (with median 1.72x). Note that a ratio smaller than 1 means a slow down or use of more memory. Such ratios can arise in the exploration of small state-spaces.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2015

Author dc:creator

• d'Amorim, Marcelo

Contributors dc:contributor

• Marinov, Darko

• Computer Science

Language dc:language

eng

Identifier

(MiAaPQ)AAI3290214

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/81776