Many symbolic software verification engines such as \slam and \escjava rely on automatic theorem provers. The existing theorem provers, such as \simplify, lack precise support for important programming language constructs such as pointers, structures and unions. This paper describes a theorem prover, \cogent, that accurately supports all ANSI-C expressions. The prover's implementation is based on a machine-level interpretation of expressions into propositional logic, and supports finite machine-level variables, bit operations, structures, unions, references, pointers and pointer arithmetic. When used by \slam during the model checking of over 300 benchmarks, \cogent's improved accuracy reduced the number of \slam timeouts by half, increased the number of true errors found, and decreased the number of false errors.
In the proceedings of the Computer-Aided
Verification (CAV) 2005 Conference, 2005, 4 pages.
PostScript(gz) /
PDF
© 2005 Natasha Sharygina.