Pending constraints in symbolic execution for better exploration and seeding

Autor:	Cristian Cadar, Timotej Kapus, Frank Busse
Přispěvatelé:	DSO National Laboratories, European Research Council (ERC)
Rok vydání:	2020
Předmět:	Computer science Distributed computing Path (graph theory) Scalability 0202 electrical engineering electronic engineering information engineering 020207 software engineering 020201 artificial intelligence & image processing 02 engineering and technology Symbolic execution Constraint (mathematics)
Zdroj:	ASE IEEE/ACM International Conference on Automated Software Engineering (ASE 2020) Proceedings of the 35th IEEE/ACM International Conference on Automated Software Engineering
Popis:	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, including SQLite3, make and tcpdump and show it can achieve higher coverage for both seeded and non-seeded exploration.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9dd84c383e7e79b475f8fb56105d3660 https://doi.org/10.1145/3324884.3416589 Zobrazit plný text záznamu