Pending constraints in symbolic execution for better exploration and seeding
File(s)accepted.pdf (910.06 KB)
Accepted version
Author(s)
Kapus, Timotej
Busse, Frank
Cadar, Cristian
Type
Conference Paper
Abstract
Symbolic execution is a well established technique for software testing and analysis. However, scalability continues to be a challenge, both in terms of constraint solving cost and path explosion.In this work, we present a novel approach for symbolic execution, which can enhance its scalability by aggressively prioritising execution paths that are already known to be feasible, and deferring all other paths. We evaluate our technique on nine applications, in-cludingSQLite3, make and tcpdump and show it can achieve higher coverage for both seeded and non-seeded exploration.
Date Issued
2020-12-25
Date Acceptance
2020-07-30
Citation
2020 35th IEEE/ACM International Conference on Automated Software Engineering (ASE), 2020
Publisher
IEEE / ACM
Journal / Book Title
2020 35th IEEE/ACM International Conference on Automated Software Engineering (ASE)
Copyright Statement
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Sponsor
DSO National Laboratories
European Research Council (ERC)
Identifier
https://ieeexplore.ieee.org/document/9286054
Grant Number
DSOCO16080
819141
Source
IEEE/ACM International Conference on Automated Software Engineering (ASE 2020)
Publication Status
Published
Start Date
2020-09-21
Finish Date
2020-09-25
Coverage Spatial
Melbourne, Australia (Virtual)