#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2007

2016

- This year (0)
- Last 5 years (2)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Sylvain Conchon, Evelyne Contejean, Johannes Kanig, Stéphane Lescuyer
- Electr. Notes Theor. Comput. Sci.
- 2008

We present a generic congruence closure algorithm for deciding ground formulas in the combination of the theory of equality with uninterpreted symbols and an arbitrary built-in solvable theory X. Our algorithm CC(X) is reminiscent of Shostak combination: it maintains a union-find data-structure modulo X from which maximal information about implied… (More)

We present a Coq formalization of an algorithm deciding the satisfiability of propositional formulas (SAT). This SAT solver is described as a set of inference rules in a manner that is independent of the actual representation of propositional variables and formulas. We prove soundness and completeness for this system, and instantiate our solver directly on… (More)

- Jean-François Couchot, Stéphane Lescuyer
- CADE
- 2007

Polymorphism has become a common way of designing short and reusable programs by abstracting generic definitions from typespecific ones. Such a convenience is valuable in logic as well, because it unburdens the specifier from writing redundant declarations of logical symbols. However, top shelf automated theorem provers such as Simplify, Yices or other… (More)

- Stéphane Lescuyer, Sylvain Conchon
- FroCoS
- 2009

In an attempt to improve automation capabilities in the Coq proof assistant, we develop a tactic for the propositional fragment based on the DPLL procedure. Although formulas naturally arising in interactive proofs do not require a state-of-the-art SAT solver, the conversion to clausal form required by DPLL strongly damages the performance of the procedure.… (More)

set of inference rules, in particular we do not specify how and when rules should be applied. This kind of presentation is more similar to Tinelli’s DPLL(T ) presentation [Tin02]. In our opinion, the main advantage of this approach is that we can manipulate the system without taking the details of a particular implementation into account. Typically, we can… (More)

- Stéphane Lescuyer
- Stud. Inform. Univ.
- 2011

We present a Coq library for finite sets and maps which brings the same functionalities as the existing standard FSets/FMaps library, but ensures the genericity of the proposed data structures using type classes instead of modules. This architecture facilitates the use of these data structures thanks to overloading and implicit instantiation, and more… (More)

- Romain Bardou, Jean-Christophe Filliâtre, Johannes Kanig, Stéphane Lescuyer
- Stud. Inform. Univ.
- 2009

This article introduces MLPOST, an OCaml library for scientific drawing. It is based on METAPOST, which allows inclusion of LTEX fragments. OCaml is an appealing alternative to LTEX macro languages, dedicated languages and even to graphic tools. In particular, MLPOST users benefit from OCaml’s expressiveness and static typing. Finally, MLPOST features a… (More)

- Oana Fabiana Andreescu, Thomas Jensen, Stéphane Lescuyer
- ICFEM
- 2015

- ‹
- 1
- ›