## Cogent: Accurate theorem proving for program verification (2005)

### Cached

### Download Links

Venue: | Proceedings of CAV 2005, volume 3576 of Lecture Notes in Computer Science |

Citations: | 35 - 10 self |

### BibTeX

@INPROCEEDINGS{Cook05cogent:accurate,

author = {Byron Cook and Daniel Kroening and Natasha Sharygina},

title = {Cogent: Accurate theorem proving for program verification},

booktitle = {Proceedings of CAV 2005, volume 3576 of Lecture Notes in Computer Science},

year = {2005},

pages = {296--300},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. Many symbolic software verification engines such as Slam and ESC/Java 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 machinelevel 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. 1