## Light-Weight Theorem Proving for Debugging and Verifying Units of Code (2003)

### Cached

### Download Links

- [www.consiste.dimap.ufrn.br]
- [monolith.consiste.dimap.ufrn.br]
- DBLP

### Other Repositories/Bibliography

Citations: | 47 - 25 self |

### BibTeX

@INPROCEEDINGS{Déharbe03light-weighttheorem,

author = {David Déharbe and Silvio Ranise},

title = {Light-Weight Theorem Proving for Debugging and Verifying Units of Code},

booktitle = {},

year = {2003},

pages = {220--228},

publisher = {Society Press}

}

### Years of Citing Articles

### OpenURL

### Abstract

Software bugs are very difficult to detect even in small units of code. Several techniques to debug or prove correct such units are based on the generation of a set of formulae whose unsatisfiability reveals the presence of an error. These techniques assume the availability of a theorem prover capable of automatically discharging the resulting proof obligations. Building such a tool is a difficult, long, and error-prone activity. In this paper, we describe techniques to build provers which are highly automatic and flexible by combining state-of-the-art superposition theorem provers and BDDs. We report experimental results on formulae extracted from the debugging of C functions manipulating pointers showing that an implementation of our techniques can discharge proof obligations which cannot be handled by Simplify (the theorem prover used in the ESC/Java tool) and performs much better on others. 1.