Practical symbolic verification of regular properties

Hengbiao Yu
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
more » ... -world open-source Java programs (totaling 270K lines of code). The experimental results demonstrate the effectiveness and efficiency of SRV. CCS CONCEPTS • Software and its engineering → Software verification and validation;
doi:10.1145/3106237.3121275 dblp:conf/sigsoft/Yu17 fatcat:watm5dgihncg5fuiq5nmabjdpy