Infeasible Paths Elimination by Symbolic Execution Techniques
| Autor: | Frederic Voisin, Romain Aissat, Burkhart Wolff |
|---|---|
| Přispěvatelé: | Laboratoire de Recherche en Informatique (LRI), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS) |
| Jazyk: | angličtina |
| Rok vydání: | 2016 |
| Předmět: |
Graph rewriting
Theoretical computer science Computer science 020207 software engineering 0102 computer and information sciences 02 engineering and technology [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE] Symbolic execution 01 natural sciences Set (abstract data type) 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering Graph (abstract data type) Astrophysics::Galaxy Astrophysics ComputingMilieux_MISCELLANEOUS ComputingMethodologies_COMPUTERGRAPHICS |
| Zdroj: | Interactive Theorem Proving. ITP 2016 Interactive Theorem Proving. ITP 2016, 2016, NANCY, France Interactive Theorem Proving ISBN: 9783319431437 |
| Popis: | TRACER [8] is a tool for verifying safety properties of sequential C programs. TRACER attempts at building a finite symbolic execution graph which over-approximates the set of all concrete reachable states and the set of feasible paths. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|