14 citations · 18 across the 5 of their papers we have counts for
5 papers
Modular Constraint Solver Cooperation via Abstract Interpretation
Pierre Talbot, Éric Monfroy, Charlotte Truchet
Cooperation among constraint solvers is difficult because different solving paradigms have different theoretical foundations. Recent works have shown that abstract interpretation c…
Reachability in Parametric Interval Markov Chains using Constraints
Anicet Bart, Benoit Delahaye, Didier Lime +2
Parametric Interval Markov Chains (pIMCs) are a specification formalism that extend Markov Chains (MCs) and Interval Markov Chains (IMCs) by taking into account imprecision in the…
A Probabilistic-Based Model for Binary CSP
Amine Balafrej, Xavier Lorca, Charlotte Truchet
This work introduces a probabilistic-based model for binary CSP that provides a fine grained analysis of its internal structure. Assuming that a domain modification could occur in…
Prediction of Parallel Speed-ups for Las Vegas Algorithms
Charlotte Truchet, Florian Richoux, Philippe Codognet
We propose a probabilistic model for the parallel execution of Las Vegas algorithms, i.e., randomized algorithms whose runtime might vary from one execution to another, even with t…
Sonet Network Design Problems
Marie Pelleau, Pascal Van Hentenryck, Charlotte Truchet
This paper presents a new method and a constraint-based objective function to solve two problems related to the design of optical telecommunication networks, namely the Synchronous…