Florian Letombe

12 papers A* 1A 4C 1Journal 2Unranked 4
YearRankTypeTitle / Venue / Authors
2012 J jnl
Hybrid Incremental Algorithms for Boolean Satisfiability.
Int. J. Artif. Intell. Tools
Florian Letombe, João Marques-Silva
2012 — conf
Mutation-analysis driven functional verification of a soft microprocessor.
SoCC
Tao Xie, Wolfgang Müller, Florian Letombe
2011 C conf
HDL-Mutation Based Simulation Data Generation by Propagation Guided Search.
DSD
Tao Xie, Wolfgang Müller, Florian Letombe
2011 — conf
IP-XACT based system level mutation testing.
HLDVT
Tao Xie, Wolfgang Müller, Florian Letombe
2010 — conf
Efficient Mutation-Analysis Coverage for Constrained Random Verification.
DIPES/BICC
Tao Xie, Wolfgang Müller, Florian Letombe
2009 A conf
Functional qualification of TLM verification.
DATE
Nicola Bombieri, Franco Fummi, Graziano Pravadelli, Mark Hampton, Florian Letombe
2009 — conf
On the Functional Qualification of a Platform Model.
DFT
Giuseppe Di Guglielmo, Franco Fummi, Graziano Pravadelli, Mark Hampton, Florian Letombe
2008 A conf
A MAX-SAT Algorithm Portfolio.
ECAI
Paulo J. Matos, Jordi Planes, Florian Letombe, João Marques-Silva
2008 A conf
Improvements to Hybrid Incremental SAT Algorithms.
SAT
Florian Letombe, João Marques-Silva
2006 J jnl
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages.
J. Satisf. Boolean Model. Comput.
Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis
2005 A conf
A Branching Heuristics for Quantified Renamable Horn Formulas.
SAT
Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe
2005 A* conf
Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae.
AAAI
Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis