Algorithm Selection for Dynamic Symbolic Execution: A Preliminary Study
| Autor: | Harald Søndergaard, Graeme Gange, Roberto Amadini, Peter Schachte, Peter J. Stuckey |
|---|---|
| Přispěvatelé: | Amadini R., Gange G., Schachte P., Sondergaard H., Stuckey P.J. |
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
050101 languages & linguistics
Mathematical optimization Computer science 05 social sciences Aggregate (data warehouse) 02 engineering and technology Symbolic execution Algorithm Selection Algorithm selection Software verification Path (graph theory) 0202 electrical engineering electronic engineering information engineering Portfolio 020201 artificial intelligence & image processing 0501 psychology and cognitive sciences ComputerSystemsOrganization_SPECIAL-PURPOSEANDAPPLICATION-BASEDSYSTEMS Constraint solving Portfolio solving Constraint satisfaction problem Dynamic symbolic execution |
| Zdroj: | Logic-Based Program Synthesis and Transformation ISBN: 9783030684457 LOPSTR |
| Popis: | Given a portfolio of algorithms, the goal of Algorithm Selection (AS) is to select the best algorithm(s) for a new, unseen problem instance. Dynamic Symbolic Execution (DSE) brings together concrete and symbolic execution to maximise the program coverage. DSE uses a constraint solver to solve the path conditions and generate new inputs to explore. In this paper we join these lines of research by introducing a model that combines DSE and AS approaches. The proposed AS/DSE model is a generic and flexible framework enabling the DSE engine to solve the path conditions it collects with a portfolio of different solvers, by exploiting and extending the well-known AS techniques that have been developed over the last decade. In this way, one can increase the coverage and sometimes even outperform the aggregate coverage achievable by running simultaneously all the solvers of the portfolio. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|