A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Practical symbolic verification of regular properties
2017
Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2017
It is challenging to verify regular properties of programs. This paper presents symbolic regular verification (SRV), a dynamic symbolic execution based technique for verifying regular properties. The key technique of SRV is a novel synergistic combination of propertyoriented path slicing and guiding to mitigate the path explosion problem. Indeed, slicing can prune redundant paths, while guiding can boost the finding of counterexamples. We have implemented SRV for Java and evaluated it on 16
doi:10.1145/3106237.3121275
dblp:conf/sigsoft/Yu17
fatcat:watm5dgihncg5fuiq5nmabjdpy