Trace-Driven Verification of Multithreaded Programs [chapter]

Zijiang Yang, Karem Sakallah
2010 Lecture Notes in Computer Science  
We present a new method that combines the efficiency of testing with the reasoning power of satisfiability modulo theory (SMT) solvers for the verification of multithreaded programs under a user specified test vector. Our method performs dynamic executions to obtain both under-and over-approximations of the program, represented as quantifier-free first order logic formulas. The formulas are then analyzed by an SMT solver which implicitly considers all possible thread interleavings. The symbolic
more » ... analysis may return the following results: (1) it reports a real bug, (2) it proves that the program has no bug under the given input, or (3) it remains inconclusive because the analysis is based on abstractions. In the last case, we present a refinement procedure that uses symbolic analysis to guide further executions.
doi:10.1007/978-3-642-16901-4_27 fatcat:w5yz7nvhezeqnhhd4rr7yojzt4