Bernard Boigelot

53 papers A* 10A 6B 5C 6Journal 17Unranked 7
YearRankTypeTitle / Venue / Authors
2026 J jnl
On the Theory of Order Over Real Numbers.
Math. Comput. Sci.
Bernard Boigelot, Pascal Fontaine, Baptiste Vergain
2026 J jnl
Universal First-Order Quantification over Automata.
Int. J. Found. Comput. Sci.
Bernard Boigelot, Pascal Fontaine, Baptiste Vergain
2025 C conf
Epsilon Automata on Linear Orderings.
CIAA
Bernard Boigelot, Thomas Braipson, Tom Clara
2024 C conf
Non-emptiness Test for Automata over Words Indexed by the Reals and Rationals.
CIAA
Bernard Boigelot, Pascal Fontaine, Baptiste Vergain
2023 A conf
Decidability of Difference Logic over the Reals with Uninterpreted Unary Predicates.
CADE
Bernard Boigelot, Pascal Fontaine, Baptiste Vergain
2023 J jnl
Decidability of Difference Logic over the Reals with Uninterpreted Unary Predicates.
CoRR
Bernard Boigelot, Pascal Fontaine, Baptiste Vergain
2023 J jnl
First-Order Quantification over Automata.
CoRR
Bernard Boigelot, Pascal Fontaine, Baptiste Vergain
2023 C conf
Universal First-Order Quantification over Automata.
CIAA
Bernard Boigelot, Pascal Fontaine, Baptiste Vergain
2022 — conf
Decidability of difference logics with unary predicates.
SC-Square@FLoC
Bernard Boigelot, Pascal Fontaine, Baptiste Vergain
2021 — conf
Deciding Satisfiability for Fragments with Unary Predicates and Difference Arithmetic (short paper).
SC-Square@SIAM AG
Bernard Boigelot, Pascal Fontaine, Baptiste Vergain
2021 — ch.
Symbolic methods and automata.
Handbook of Automata Theory (II.)
Bernard Boigelot
2018 B conf
Efficient Symbolic Representation of Convex Polyhedra in High-Dimensional Spaces.
ATVA
Bernard Boigelot, Isabelle Mainz
2017 A* conf
An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention.
ICALP
Bernard Boigelot, Isabelle Mainz, Victor Marsault, Michel Rigo
2017 J jnl
An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention.
CoRR
Bernard Boigelot, Isabelle Mainz, Victor Marsault, Michel Rigo
2016 J jnl
From Constrained Delaunay Triangulations to Roadmap Graphs with Arbitrary Clearance.
CoRR
Stéphane Lens, Bernard Boigelot
2015 J jnl
Efficient Path Interpolation and Speed Profile Computation for Nonholonomic Mobile Robots.
CoRR
Stéphane Lens, Bernard Boigelot
2014 B conf
Acceleration of Affine Hybrid Transformations.
ATVA
Bernard Boigelot, Frédéric Herbreteau, Isabelle Mainz
2014 — conf
Lipschitz robust control from off-policy trajectories.
CDC
Raphael Fonteneau, Damien Ernst, Bernard Boigelot, Quentin Louveaux
2013 J jnl
Min Max Generalization for Deterministic Batch Mode Reinforcement Learning: Relaxation Schemes.
SIAM J. Control. Optim.
Raphael Fonteneau, Damien Ernst, Bernard Boigelot, Quentin Louveaux
2012 C conf
Automata-Based Symbolic Representations of Polyhedra.
LATA
Bernard Boigelot, Julien Brusten, Jean-François Degbomont
2012 J jnl
Domain-specific regular acceleration.
Int. J. Softw. Tools Technol. Transf.
Bernard Boigelot
2012 J jnl
Min Max Generalization for Deterministic Batch Mode Reinforcement Learning: Relaxation Schemes
CoRR
Raphael Fonteneau, Damien Ernst, Bernard Boigelot, Quentin Louveaux
2010 — conf
Implicit Real Vector Automata
INFINITY
Bernard Boigelot, Julien Brusten, Jean-François Degbomont
2010 J jnl
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
Log. Methods Comput. Sci.
Bernard Boigelot, Julien Brusten, Véronique Bruyère
2009 A conf
A Generalization of Semenov's Theorem to Automata over Real Numbers.
CADE
Bernard Boigelot, Julien Brusten, Jérôme Leroux
2009 J jnl
A generalization of Cobham's theorem to automata over real numbers.
Theor. Comput. Sci.
Bernard Boigelot, Julien Brusten
2009 C conf
Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization.
LATA
Bernard Boigelot, Jean-François Degbomont
2008 — conf
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases.
ICALP (2)
Bernard Boigelot, Julien Brusten, Véronique Bruyère
2007 A* conf
A Generalization of Cobham's Theorem to Automata over Real Numbers.
ICALP
Bernard Boigelot, Julien Brusten
2006 A* conf
The Power of Hybrid Acceleration.
CAV
Bernard Boigelot, Frédéric Herbreteau
2005 J jnl
An effective decision procedure for linear arithmetic over the integers and reals.
ACM Trans. Comput. Log.
Bernard Boigelot, Sébastien Jodogne, Pierre Wolper
2005 — conf
Number-Set Representations for Infinite-State Verification.
VISSAS
Bernard Boigelot
2004 J jnl
Counting the solutions of Presburger equations without enumerating them.
Theor. Comput. Sci.
Bernard Boigelot, Louis Latour
2004 A conf
Omega-Regular Model Checking.
TACAS
Bernard Boigelot, Axel Legay, Pierre Wolper
2003 J jnl
An Effective Decision Procedure for Linear Arithmetic with Integer and Real Variables
CoRR
Bernard Boigelot, Sébastien Jodogne, Pierre Wolper
2003 A* conf
Hybrid Acceleration Using Real Vector Automata (Extended Abstract).
CAV
Bernard Boigelot, Frédéric Herbreteau, Sébastien Jodogne
2003 A* conf
Iterating Transducers in the Large (Extended Abstract).
CAV
Bernard Boigelot, Axel Legay, Pierre Wolper
2003 J jnl
On iterating linear transformations over recognizable sets of integers.
Theor. Comput. Sci.
Bernard Boigelot
2002 B conf
Representing Arithmetic Constraints with Finite Automata: An Overview.
ICLP
Bernard Boigelot, Pierre Wolper
2001 C conf
Counting the Solutions of Presburger Equations without Enumerating Them.
CIAA
Bernard Boigelot, Louis Latour
2001 A conf
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables.
IJCAR
Bernard Boigelot, Sébastien Jodogne, Pierre Wolper
2000 A conf
On the Construction of Automata from Linear Arithmetic Constraints.
TACAS
Pierre Wolper, Bernard Boigelot
1999 J jnl
Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs.
Formal Methods Syst. Des.
Bernard Boigelot, Patrice Godefroid
1998 A* conf
On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract).
ICALP
Bernard Boigelot, Stéphane Rassart, Pierre Wolper
1998 — —
Symbolic Methods for Exploring Infinite State Spaces.
Bernard Boigelot
1998 A* conf
Verifying Systems with Infinite but Regular State Spaces.
CAV
Pierre Wolper, Bernard Boigelot
1997 A* conf
An Improved Reachability Analysis Method for Strongly Linear Hybrid Systems (Extended Abstract).
CAV
Bernard Boigelot, Louis Bronne, Stéphane Rassart
1997 A conf
Automatic Synthesis of Specifications from the Dynamic Observation of Reactive Programs.
TACAS
Bernard Boigelot, Patrice Godefroid
1997 B conf
The Power of QDDs (Extended Abstract).
SAS
Bernard Boigelot, Patrice Godefroid, Bernard Willems, Pierre Wolper
1996 — conf
Model Checking in Practice: An Analysis of the ACCESS.bus Protocol using SPIN.
FME
Bernard Boigelot, Patrice Godefroid
1996 A* conf
Symbolic Verification of Communication Protocols with Infinite State Spaces Using QDDs (Extended Abstract).
CAV
Bernard Boigelot, Patrice Godefroid
1995 B conf
An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract)
SAS
Pierre Wolper, Bernard Boigelot
1994 A* conf
Symbolic Verification with Periodic Sets.
CAV
Bernard Boigelot, Pierre Wolper