Florian Letombe

According to our database, Florian Letombe authored at least 12 papers between 2005 and 2012.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2012

Hybrid Incremental Algorithms for Boolean Satisfiability.

Florian Letombe, João Marques-Silva

Int. J. Artif. Intell. Tools, 2012

Mutation-analysis driven functional verification of a soft microprocessor.

Tao Xie, Wolfgang Müller, Florian Letombe

Proceedings of the IEEE 25th International SOC Conference, 2012

2011

IP-XACT based system level mutation testing.

Tao Xie, Wolfgang Müller, Florian Letombe

Proceedings of the 2011 IEEE International High Level Design Validation and Test Workshop, 2011

HDL-Mutation Based Simulation Data Generation by Propagation Guided Search.

Tao Xie, Wolfgang Müller, Florian Letombe

Proceedings of the 14th Euromicro Conference on Digital System Design, 2011

2010

Efficient Mutation-Analysis Coverage for Constrained Random Verification.

Tao Xie, Wolfgang Müller, Florian Letombe

Proceedings of the Distributed, Parallel and Biologically Inspired Systems, 2010

2009

On the Functional Qualification of a Platform Model.

Giuseppe Di Guglielmo, Franco Fummi, Graziano Pravadelli, Mark Hampton, Florian Letombe

Proceedings of the 24th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems, 2009

Functional qualification of TLM verification.

Nicola Bombieri, Franco Fummi, Graziano Pravadelli, Mark Hampton, Florian Letombe

Proceedings of the Design, Automation and Test in Europe, 2009

2008

Improvements to Hybrid Incremental SAT Algorithms.

Florian Letombe, João Marques-Silva

Proceedings of the Theory and Applications of Satisfiability Testing, 2008

A MAX-SAT Algorithm Portfolio.

Paulo J. Matos, Jordi Planes, Florian Letombe, João Marques-Silva

Proceedings of the ECAI 2008, 2008

2006

Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages.

Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis

J. Satisf. Boolean Model. Comput., 2006

2005

A Branching Heuristics for Quantified Renamable Horn Formulas.

Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe

Proceedings of the Theory and Applications of Satisfiability Testing, 2005

Propositional Fragments for Knowledge Compilation and Quantified Boolean Formulae.

Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis

Proceedings of the Proceedings, 2005