This work develops new automated reasoning techniques for verifying the correctness of equationally specified programs. These techniques are not just theoretical, but have been implemented, and applied to actual program verification projects. Although the work spans several different areas, a major theme of this work is to develop better techniques at the boundary between decidable and undecidable problems. That is, this work seeks out not just positive decidability results, but ways to extend the underlying techniques to be effective on problems outside of decidable subclasses. For program verification to succeed, we feel that two important directions must be pursued: (1) considering more expressive logics to allow designers to more eas...
The thesis is devoted to the development of formal methods for software verification. Indeed, two ar...
Software model checking is the algorithmic analysis of programs to prove prop-erties of their execut...
An \em equational system\/ is a set of equations. Often we are interested in knowing if an equation ...
This work develops new automated reasoning techniques for verifying the correctness of equationally ...
Sufficient completeness means that enough equations have been specified, so that the functions of an...
We propose three different notions of completeness for term rewrite specifications supporting order-...
International audienceThis paper is part of a long-term effort to increase expressiveness of algebra...
We explore some of the problems of verification by trying to prove that some sort of relationship ho...
textThe goal of formal verification is to use mathematical methods to prove that a computing system...
Abstract: This paper is part of a long-term effort to increase expressiveness of algebraic specifica...
This paper aims to introduce a method for verification of programs, which is fully automatic. This...
In the paper, we introduce a new tree automata framework, called propositional tree automata, captur...
AbstractThis paper is part of a long-term effort to increase expressiveness of algebraic specificati...
AbstractThis paper presents new classes of tree automata combining automata with equality test and a...
AbstractVerification problems can often be encoded as first-order validity or satisfiability problem...
The thesis is devoted to the development of formal methods for software verification. Indeed, two ar...
Software model checking is the algorithmic analysis of programs to prove prop-erties of their execut...
An \em equational system\/ is a set of equations. Often we are interested in knowing if an equation ...
This work develops new automated reasoning techniques for verifying the correctness of equationally ...
Sufficient completeness means that enough equations have been specified, so that the functions of an...
We propose three different notions of completeness for term rewrite specifications supporting order-...
International audienceThis paper is part of a long-term effort to increase expressiveness of algebra...
We explore some of the problems of verification by trying to prove that some sort of relationship ho...
textThe goal of formal verification is to use mathematical methods to prove that a computing system...
Abstract: This paper is part of a long-term effort to increase expressiveness of algebraic specifica...
This paper aims to introduce a method for verification of programs, which is fully automatic. This...
In the paper, we introduce a new tree automata framework, called propositional tree automata, captur...
AbstractThis paper is part of a long-term effort to increase expressiveness of algebraic specificati...
AbstractThis paper presents new classes of tree automata combining automata with equality test and a...
AbstractVerification problems can often be encoded as first-order validity or satisfiability problem...
The thesis is devoted to the development of formal methods for software verification. Indeed, two ar...
Software model checking is the algorithmic analysis of programs to prove prop-erties of their execut...
An \em equational system\/ is a set of equations. Often we are interested in knowing if an equation ...