Abstract
In this paper, we apply fine-grained slicing techniques to the models generated from the Rebel modeling language before passing them on to an SMT solver. We show that our slicing techniques have a significant positive effect on performance, allowing us to verify larger problem instances and with higher path bounds than with unsliced models. For small and shallow instances, however, the overhead of slicing dominates verification time, and slicing should not be resorted to.
Original language | English |
---|---|
Title of host publication | 18th IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2018) |
Publisher | IEEE |
Pages | 235-244 |
Number of pages | 10 |
ISBN (Electronic) | 9781538682906 |
DOIs | |
Publication status | Published - 12 Nov 2018 |