-
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... -
Reachability Analysis of Term Rewriting Systems with Timbuk
We present Timbuk - a tree automata library - which implements usual operation- s on tree automata as well as a completion algorithm used to compute an... -
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... -
Rewriting for Cryptographic Protocol Verification - Extended Version -
On a case study, we present a new approach for verifying cryptographic protocols, based on rewriting and on tree automata techniques. Protocols are operationally... -
Ground Reducibility is EXPTIME-complete
We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of... -
Modular Aspects of Rewrite-Based Specifications
We investigate modular properties of term rewriting systems, the basic operational formalism for equational specifications. First we study sufficient conditions for... -
On Semi-Completeness of Term Rewriting Systems
We investigate the question whether semi-completeness, i.e., weak termination plus confluence, of term rewriting systems is preserved under the normalization of... -
Decidable Approximations of Sets of Descendants and Sets of Normal Forms - ex...
We present here decidable approximations of sets of descendants and sets of normal forms of Term Rewriting Systems, based on specific tree automata techniques. In the... -
Termination Proofs Using gpo Ordering Constraints : Extended Version
We present here an algorithm for proving termination of term rewriting systems by \gpo ordering constraint solving. The algorithm gives, as automatically as possible,... -
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... -
Abstraction-based Malware Analysis Using Rewriting and Model Checking
International audience -
Narrowing Based Inductive Proof Search
Premiere version en 2005, en l'honneur de Harald Ganzinger -
Formal Cellular Machinery
International audience -
Behavior Analysis of Malicious Code by Weighted Behavior Abstraction
This work is a weighted generalization of the abstraction based analysis technique we previously proposed for the detection of high-level malware behaviors. Our... -
Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New?
International audience -
Unranked Tree Rewriting and Effective Closures of Languages
International audience -
A Symbolic Transformation Language and its Application to a Multiscale Method
International audience -
Termination orders for 3-dimensional rewriting
This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit...
