-
Formalization of Wu's simple method in Coq
International audience -
Automated Deduction applied to the Analysis and Verification of Infinite Stat...
Description de mes activités de recherche réalisées depuis plus de 20 ans. -
Extended Tree Automata Models for the Verification of Infinite State Systems
This document presents the study of several models of state machines, all of them extending the same formalism: the classical tree automata, and their application in... -
Superposition with Equivalence Reasoning andDelayed Clause Normal Form Transf...
This report describes a superposition calculus where quantifiers are eliminated lazily. Superposition and simplification inferences may employ equivalences that have... -
BDD-Driven First-Order Satisfiability Procedures (Extended Version)
Providing a high degree of automation to discharge proof obligations in (fragments of) first-order logic is a crucial activity in many verification efforts.... -
Uniform Derivation of Decision Procedures by Superposition
We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly as a decision procedure for various theories... -
Compiling and Verifying Security Protocols
We propose a direct and fully automated translation from standard security protocol descriptions to rewrite rules. This compilation defines non-ambiguous operational... -
Non-Disjoint Unions of Theories and Combinations of Satisfiability Procedures...
In this paper we outline a theoretical framework for the combination of decision procedures for the satisfiability of constraints with respect to a constrainttheory.... -
Automated deduction with associative commutative operators
We propose a new inference system for automated deduction with equality and associative commutative operators. This system is an extension of the ordered... -
Interaction between Symbolic and numerical Computation; Application to Comput...
The initial motivations of this work come from the camera calibration in computer vision. We are especially interested in using jointly time measures in the images and... -
Combining Data Structures with Nonstably Infinite Theories using Many-Sorted ...
Most computer programs store elements of a given nature into container-based data structures such as lists, arrays, sets, and multisets. To verify the correctness of... -
A Decision Procedure for a Fragment of Set Theory Involving Monotone, Additiv...
2LS is a decidable many-sorted set-theoretic language involving one sort for elements and one sort for sets of elements. In this report we extend 2LS with constructs... -
C-tableaux
The Nelson-Oppen combination method combines decision procedures for first-order theories satisfying certain conditions into a single decision procedure for the union... -
Simplified Handling of Iterated Term Schemata
International audience -
Automated Deduction - CADE-15
Ouvrage (éditeur). -
Orderings in Automated Theorem Proving
Contribution à un ouvrage. -
Rough Algebras & Automated Deduction
Contribution à un ouvrage. -
Applying semantic subsumption rules in the context of inductive proofs
Colloque avec actes et comité de lecture. -
A Good Class of Tree Automata
Colloque avec actes et comité de lecture.
