Add to ORKGI Counting discrete structures of given size I Also, exhibiting non-trivial structural bijections I Software Engineering (SE) I methods for the rational design, devt and maintenance of software I validation, mainly by testing (around 50 % of software devt) I EC for SE I Analysis of algorithm complexity I Bounded exhaustive testing with structured data I SE for EC I Methods for guessing and proving conjectures in combinatorics I Focus on rooted map enumeratio
Discrete structure manipulation is a fundamental technique for many problems solved by computers. BD...
Property Testing is the study of super-efficient algorithms that solve "approximate decision pr...
International audienceWe present a theorem-proving experiment performed with a computer algebra syst...
We present an efficient, modular, and feature-rich framework for automated generation and validation...
International audienceIn this paper we show how the research domain of enumerative combinatorics can...
We present an efficient, modular, and feature-rich framework for automated generation and validation...
The general problem of proving properties of imperative programs is undecidable. Some subproblems– r...
Our framework allows us to analyze all our testers ina unified way and the obtained complexity bound...
The goal of Bounded-Exhaustive Testing (BET) is the automatic generation of all test cases satisfyin...
International audienceWe address automated testing and interactive proving of properties involving c...
This dissertation presents several results at the intersection ofcomplexity theory and algorithm des...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
In this paper we give a new description of the planarity testing and embedding algorithm presented ...
Le problème général de la preuve de propriétés de programmes impératifs est indécidable. Pour deslan...
Discrete structure manipulation is a fundamental technique for many problems solved by computers. BD...
Property Testing is the study of super-efficient algorithms that solve "approximate decision pr...
International audienceWe present a theorem-proving experiment performed with a computer algebra syst...
We present an efficient, modular, and feature-rich framework for automated generation and validation...
International audienceIn this paper we show how the research domain of enumerative combinatorics can...
We present an efficient, modular, and feature-rich framework for automated generation and validation...
The general problem of proving properties of imperative programs is undecidable. Some subproblems– r...
Our framework allows us to analyze all our testers ina unified way and the obtained complexity bound...
The goal of Bounded-Exhaustive Testing (BET) is the automatic generation of all test cases satisfyin...
International audienceWe address automated testing and interactive proving of properties involving c...
This dissertation presents several results at the intersection ofcomplexity theory and algorithm des...
At its core, much of Computational Complexity is concerned with combinatorial objects and structures...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
In this paper we give a new description of the planarity testing and embedding algorithm presented ...
Le problème général de la preuve de propriétés de programmes impératifs est indécidable. Pour deslan...
Discrete structure manipulation is a fundamental technique for many problems solved by computers. BD...
Property Testing is the study of super-efficient algorithms that solve "approximate decision pr...
International audienceWe present a theorem-proving experiment performed with a computer algebra syst...