Refine my results

Reusing constraint proofs in symbolic analysis

Chen, Meixian ; Pezzè, Mauro (Dir.)

Thèse de doctorat : Università della Svizzera italiana, 2018 ; 2018INFO007.

Symbolic analysis is an important element of program verification and automatic testing. Symbolic analysis techniques abstract program properties as expressions of symbolic input values to characterise the program logical constraints, and rely on Satisfiability Modulo Theories (SMT) solvers to both validate the satisfiability of the constraint expression and verify the corresponding program...