 | 2011 |
|---|
| 13 |       | Sylvain Conchon,
Evelyne Contejean,
Mohamed Iguernelala:
Canonized Rewriting and Ground AC Completion Modulo Shostak Theories.
TACAS 2011: 45-59 |
| 2009 |
|---|
| 12 | | Stéphane Lescuyer,
Sylvain Conchon:
Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme.
FroCos 2009: 287-303 |
| 2008 |
|---|
| 11 | | Sylvain Conchon,
Jean-Christophe Filliâtre:
Semi-persistent Data Structures.
ESOP 2008: 322-336 |
| 10 | | Sylvain Conchon,
Evelyne Contejean,
Johannes Kanig,
Stéphane Lescuyer:
CC(X): Semantic Combination of Congruence Closure with Solvable Theories.
Electr. Notes Theor. Comput. Sci. 198(2): 51-69 (2008) |
| 2007 |
|---|
| 9 | | Sylvain Conchon,
Jean-Christophe Filliâtre:
A persistent union-find data structure.
ML 2007: 37-46 |
| 2006 |
|---|
| 8 | | Jean-Christophe Filliâtre,
Sylvain Conchon:
Type-safe modular hash-consing.
ML 2006: 12-19 |
| 7 | | Sylvain Conchon,
Sava Krstic:
Strategies for combining decision procedures.
Theor. Comput. Sci. 354(2): 187-210 (2006) |
| 2005 |
|---|
| 6 | | Sava Krstic,
Sylvain Conchon:
Canonization for disjoint unions of theories.
Inf. Comput. 199(1-2): 87-106 (2005) |
| 2003 |
|---|
| 5 | | Sava Krstic,
Sylvain Conchon:
Canonization for Disjoint Unions of Theories.
CADE 2003: 197-211 |
| 4 | | Sylvain Conchon,
Sava Krstic:
Strategies for Combining Decision Procedures.
TACAS 2003: 537-552 |
| 2001 |
|---|
| 3 | | Sylvain Conchon,
François Pottier:
JOIN(X): Constraint-Based Type Inference for the Join-Calculus.
ESOP 2001: 221-236 |
| 2000 |
|---|
| 2 | | François Pottier,
Sylvain Conchon:
Information flow inference for free.
ICFP 2000: 46-57 |
| 1999 |
|---|
| 1 | | Sylvain Conchon,
Fabrice Le Fessant:
Jocaml: Mobile Agents for Objective-Caml.
ASA/MA 1999: 22-29 |
Data released under the ODC-BY 1.0 license — See also our legal information page