Seduct — A proof compiler for first order logic

Abstract

In this paper we present Seduct, which is a theorem prover for many-sorted first order logic. Seduct has been specially tailored to economically discharge proof obligations arising during the process of software verification. We will mainly describe those features of Seduct which distinguish this theorem prover from other theorem provers and which make it especially suited for software verification.