We propose an automated theorem prover that combines an SMT solver with tableau calculus and rewriting, for which we introduce an algorithm based on superposition, but where all clauses contain a single atomic formula.Expand

We introduce an encoding of the set theory of the B method using polymorphic types and deduction modulo, which is used for the automated verication of proof obligations in the framework of theBWare project.Expand

This paper broaches the topic of how to reason about equalities in a centralized way, so that the theory reasoners can avoid replicating equality reasoning steps, and even benefit from a centralized implementation of equivalence classes.Expand

A theory, commonly formulated as a collection of axioms, is often necessary to specify, in a concise and understandable way, the properties of objects manipulated in software proofs.Expand

This PhD thesis presents ArchSAT, an automated theorem prover with formal proof outputs, which is used to study the integration of some first-order reasoning methods into SMT solvers.Expand