作者: Andreas Ibing
DOI: 10.1007/978-3-319-05032-4_9
关键词: Solver 、 Test suite 、 Eclipse 、 Satisfiability modulo theories 、 Interface (Java) 、 Programming language 、 Integer (computer science) 、 Computer science 、 Symbolic execution 、 Parallel computing 、 Context (language use)
摘要: This paper presents a symbolic execution plug-in extension for Eclipse CDT/Codan, which serves to reason about satisfiable paths of C programs. Programs are translated into the SMT-LIB sublogic arrays, uninterpreted functions and nonlinear integer real arithmetic (AUFNIRA), path satisfiability is automatically examined with an SMT solver. The presented can serve as basis path-sensitive static bug detection bounded or unrestricted context, where presence bugs decided An interface provides notifications context information checker classes. With buffer bound shown capable accurately detecting currently 36 39 flow variants NSA's Juliet test suite analyzers.