Abstract

Verifying the regular properties of a program is challenging. In this extended abstract, we report our recent progress of verifying regular properties based on dynamic symbolic execution (DSE). We propose two algorithms for DSE to improve the scalability of verification. Guiding algorithm boosts the falsification of verification. Slicing algorithm prunes redundant paths to boost path exploration. Based on JPF, we have implemented our verification method for Java programs. The results of the extensive experiments on real-world Java open-source programs are promising.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.