• Publications
  • Influence
SMT Solving Modulo Tableau and Rewriting Theories
TLDR
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
  • 3
  • 2
  • PDF
Automated Deduction in the B Set Theory using Typed Proof Search and Deduction Modulo
TLDR
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
  • 19
  • PDF
Integrating Simplex with Tableaux
TLDR
We propose an extension of a tableau-based calculus to deal with linear arithmetic. Expand
  • 7
Centralizing equality reasoning in MCSAT
TLDR
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
  • 4
  • PDF
An Automation-Friendly Set Theory for the B Method
TLDR
We propose an automation-friendly set theory for the B method. Expand
  • 3
  • PDF
First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice
TLDR
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
  • 4
  • PDF
Implementing Polymorphism in Zenon
TLDR
In this paper, we discuss the implementation of polymorphism into the first-order tableau-based automated theorem prover Zenon. Expand
  • 4
  • PDF
Integrating rewriting, tableau and superposition into SMT
TLDR
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