JDart: Portfolio Solving, Breadth-First Search and SMT-Lib Strings (Competition Contribution) Article Swipe
Related Concepts
Symbolic execution
Computer science
String (physics)
Constraint (computer-aided design)
Portfolio
Java
Path (computing)
Theoretical computer science
Encoding (memory)
Programming language
Parallel computing
Artificial intelligence
Mathematics
Software
Geometry
Financial economics
Mathematical physics
Economics
Malte Mues
,
Falk Howar
·
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.1007/978-3-030-72013-1_30
· OA: W3136901529
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.1007/978-3-030-72013-1_30
· OA: W3136901529
JDart performs dynamic symbolic execution of Java programs: it executes programs with concrete inputs while recording symbolic constraints on executed program paths. A portfolio of constraint solvers is then used for generating new concrete values from recorded constraints that drive execution along previously unexplored paths. For SV-COMP 2021, we improved JDart by implementing exploration strategies, bounded analysis, and path-specific constraint solving strategies, as well as by enabling the use of SMT-Lib string theory for encoding of string operations.
Related Topics
Finding more related topics…