Florian Letombe

Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages

Pierre Marquis, Sylvie Coste-Marquis, Daniel Le Berre, 2006, J. Satisf. Boolean Model. Comput..

Hybrid Incremental Algorithms for Boolean Satisfiability

Joao Marques-Silva, Florian Letombe, Joao Marques-Silva, 2012, Int. J. Artif. Intell. Tools.

Efficient Mutation-Analysis Coverage for Constrained Random Verification

Tao Xie, Wolfgang Müller, Florian Letombe, 2010, DIPES/BICC.

A MAX-SAT Algorithm Portfolio

Joao Marques-Silva, Paulo J. Matos, Florian Letombe, 2008, ECAI.

HDL-Mutation Based Simulation Data Generation by Propagation Guided Search

Tao Xie, Wolfgang Müller, Florian Letombe, 2011, 2011 14th Euromicro Conference on Digital System Design.

Improvements to Hybrid Incremental SAT Algorithms

Joao Marques-Silva, Florian Letombe, 2008, SAT.

Functional qualification of TLM verification

Franco Fummi, Graziano Pravadelli, Nicola Bombieri, 2009, 2009 Design, Automation & Test in Europe Conference & Exhibition.

A Branching Heuristics for Quantified Renamable Horn Formulas

Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, 2005, SAT.

On the Functional Qualification of a Platform Model

Franco Fummi, Graziano Pravadelli, Giuseppe Di Guglielmo, 2009, 2009 24th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems.

Mutation-analysis driven functional verification of a soft microprocessor

Tao Xie, Wolfgang Müller, Florian Letombe, 2012, 2012 IEEE International SOC Conference.

IP-XACT based system level mutation testing

Tao Xie, Wolfgang Müller, Florian Letombe, 2011, 2011 IEEE International High Level Design Validation and Test Workshop.

Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae

Pierre Marquis, Sylvie Coste-Marquis, Daniel Le Berre, 2005, AAAI.