| Publication | Date of Publication | Type |
|---|
An approximation-based approach for the random exploration of large models
Tests and Proofs | 2023-05-05 | Paper |
| Update on the asymptotic optimality of LPT | 2022-03-31 | Paper |
A comparison of random task graph generation methods for scheduling problems
Lecture Notes in Computer Science | 2020-07-20 | Paper |
Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes
Mathematics | 2018-12-18 | Paper |
| Controlling and assessing correlations of cost matrices in heterogeneous scheduling | 2018-01-11 | Paper |
Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering | 2017-04-03 | Paper |
The emptiness problem for tree automata with at least one global disequality constraint is NP-hard
Information Processing Letters | 2016-11-23 | Paper |
Random generation and enumeration of accessible deterministic real-time pushdown automata
Implementation and Application of Automata | 2015-09-23 | Paper |
On the uniform random generation of non deterministic automata up to isomorphism
Implementation and Application of Automata | 2015-09-23 | Paper |
Handling left-quadratic rules when completing tree automata
Electronic Notes in Theoretical Computer Science | 2015-03-23 | Paper |
Tree automata for detecting attacks on protocols with algebraic cryptographic primitives
Electronic Notes in Theoretical Computer Science | 2015-03-19 | Paper |
Enhancing approximations for regular reachability analysis
Implementation and Application of Automata | 2013-08-07 | Paper |
On positive TAGED with a bounded number of constraints
Implementation and Application of Automata | 2012-09-20 | Paper |
From linear temporal logic properties to rewrite propositions
Automated Reasoning | 2012-09-05 | Paper |
Loops and overloops for tree-walking automata
Theoretical Computer Science | 2012-08-09 | Paper |
On the complexity of computing the profinite closure of a rational language
Theoretical Computer Science | 2011-10-10 | Paper |
Loops and overloops for tree walking automata
Implementation and Application of Automata | 2011-07-29 | Paper |
A random testing approach using pushdown automata
Tests and Proofs | 2011-07-07 | Paper |
Parametric random generation of deterministic tree automata
Theoretical Computer Science | 2010-10-07 | Paper |
Component simulation-based substitutivity managing QoS and composition issues
Science of Computer Programming | 2010-08-26 | Paper |
A note on partially ordered tree automata
Information Processing Letters | 2010-06-09 | Paper |
A theoretical limit for safety verification techniques with regular fix-point computations
Information Processing Letters | 2010-04-19 | Paper |
HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA
International Journal of Foundations of Computer Science | 2009-11-19 | Paper |
How to Tackle Integer Weighted Automata Positivity
Lecture Notes in Computer Science | 2009-11-19 | Paper |
| Approximation-based tree regular model-checking | 2009-10-12 | Paper |
Random Generation of Deterministic Tree (Walking) Automata
Implementation and Application of Automata | 2009-07-09 | Paper |
TAGED Approximations for Temporal Properties Model-Checking
Implementation and Application of Automata | 2009-07-09 | Paper |
Handling Algebraic Properties in Automatic Analysis of Security Protocols
Lecture Notes in Computer Science | 2008-09-11 | Paper |
Finer Is Better: Abstraction Refinement for Rewriting Approximations
Rewriting Techniques and Applications | 2008-08-28 | Paper |
Efficiency of automata in semi-commutation verification techniques
RAIRO - Theoretical Informatics and Applications | 2008-07-29 | Paper |
A polynomial time algorithm to compute the Abelian kernel of a finite monoid
Semigroup Forum | 2003-08-31 | Paper |
Some complexity results for polynomial rational expressions.
Theoretical Computer Science | 2003-05-25 | Paper |
| scientific article; zbMATH DE number 1773080 (Why is no real title available?) | 2002-07-28 | Paper |
| scientific article; zbMATH DE number 1740161 (Why is no real title available?) | 2002-05-14 | Paper |
On Shuffle Ideals
RAIRO - Theoretical Informatics and Applications | 2002-01-01 | Paper |
On Shuffle Ideals
RAIRO - Theoretical Informatics and Applications | 2002-01-01 | Paper |
A lower bound for reversible automata
RAIRO. Theoretical Informatics and Applications | 2001-06-26 | Paper |
A lower bound for reversible automata
RAIRO. Theoretical Informatics and Applications | 2001-06-26 | Paper |
