Symbolic Verification with Periodic Sets. - Bernard Boigelot; Pierre Wolper (CAV, 1994)

An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract) - Pierre Wolper; Bernard Boigelot (SAS, 1995)

Symbolic Verification of Communication Protocols with Infinite State Spaces Using QDDs (Extended Abstract). - Bernard Boigelot; Patrice Godefroid (CAV, 1996)

Model Checking in Practice: An Analysis of the ACCESS.bus Protocol using SPIN. - Bernard Boigelot; Patrice Godefroid (FME, 1996)

An Improved Reachability Analysis Method for Strongly Linear Hybrid Systems (Extended Abstract). - Bernard Boigelot; Louis Bronne; Stéphane Rassart (CAV, 1997)

The Power of QDDs (Extended Abstract). - Bernard Boigelot; Patrice Godefroid; Bernard Willems; Pierre Wolper (SAS, 1997)

Automatic Synthesis of Specifications from the Dynamic Observation of Reactive Programs. - Bernard Boigelot; Patrice Godefroid (TACAS, 1997)

Verifying Systems with Infinite but Regular State Spaces. - Pierre Wolper; Bernard Boigelot (CAV, 1998)

On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract). - Bernard Boigelot; Stéphane Rassart; Pierre Wolper (ICALP, 1998)

Symbolic Methods for Exploring Infinite State Spaces. - Bernard Boigelot (1998)

Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs. - Bernard Boigelot; Patrice Godefroid (Formal Methods Syst. Des., 1999)

On the Construction of Automata from Linear Arithmetic Constraints. - Pierre Wolper; Bernard Boigelot (TACAS, 2000)

On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables. - Bernard Boigelot; Sébastien Jodogne; Pierre Wolper (IJCAR, 2001)

Representing Arithmetic Constraints with Finite Automata: An Overview. - Bernard Boigelot; Pierre Wolper (ICLP, 2002)

Hybrid Acceleration Using Real Vector Automata (Extended Abstract). - Bernard Boigelot; Frédéric Herbreteau; Sébastien Jodogne (CAV, 2003)

Iterating Transducers in the Large (Extended Abstract). - Bernard Boigelot; Axel Legay; Pierre Wolper (CAV, 2003)

An Effective Decision Procedure for Linear Arithmetic with Integer and Real Variables - Bernard Boigelot; Sébastien Jodogne; Pierre Wolper (CoRR, 2003)

On iterating linear transformations over recognizable sets of integers. - Bernard Boigelot (Theor. Comput. Sci., 2003)

Omega-Regular Model Checking. - Bernard Boigelot; Axel Legay; Pierre Wolper (TACAS, 2004)

Counting the solutions of Presburger equations without enumerating them. - Bernard Boigelot; Louis Latour (Theor. Comput. Sci., 2004)

Number-Set Representations for Infinite-State Verification. - Bernard Boigelot (VISSAS, 2005)

An effective decision procedure for linear arithmetic over the integers and reals. - Bernard Boigelot; Sébastien Jodogne; Pierre Wolper (ACM Trans. Comput. Log., 2005)

The Power of Hybrid Acceleration. - Bernard Boigelot; Frédéric Herbreteau (CAV, 2006)

A Generalization of Semenov's Theorem to Automata over Real Numbers. - Bernard Boigelot; Julien Brusten; Jérôme Leroux (CADE, 2009)

Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization. - Bernard Boigelot; Jean-François Degbomont (LATA, 2009)

A generalization of Cobham's theorem to automata over real numbers. - Bernard Boigelot; Julien Brusten (Theor. Comput. Sci., 2009)

On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases - Bernard Boigelot; Julien Brusten; Véronique Bruyère (Log. Methods Comput. Sci., 2010)

Implicit Real Vector Automata - Bernard Boigelot; Julien Brusten; Jean-François Degbomont (INFINITY, 2010)

Automata-Based Symbolic Representations of Polyhedra. - Bernard Boigelot; Julien Brusten; Jean-François Degbomont (LATA, 2012)

Domain-specific regular acceleration. - Bernard Boigelot (Int. J. Softw. Tools Technol. Transf., 2012)

Min Max Generalization for Deterministic Batch Mode Reinforcement Learning: Relaxation Schemes. - Raphael Fonteneau; Damien Ernst; Bernard Boigelot; Quentin Louveaux (SIAM J. Control. Optim., 2013)

Acceleration of Affine Hybrid Transformations. - Bernard Boigelot; Frédéric Herbreteau; Isabelle Mainz (ATVA, 2014)

Lipschitz robust control from off-policy trajectories. - Raphael Fonteneau; Damien Ernst; Bernard Boigelot; Quentin Louveaux (CDC, 2014)

Efficient Path Interpolation and Speed Profile Computation for Nonholonomic Mobile Robots. - Stéphane Lens; Bernard Boigelot (CoRR, 2015)

From Constrained Delaunay Triangulations to Roadmap Graphs with Arbitrary Clearance. - Stéphane Lens; Bernard Boigelot (CoRR, 2016)

An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention. - Bernard Boigelot; Isabelle Mainz; Victor Marsault; Michel Rigo (ICALP, 2017)

Efficient Symbolic Representation of Convex Polyhedra in High-Dimensional Spaces. - Bernard Boigelot; Isabelle Mainz (ATVA, 2018)

Symbolic methods and automata. - Bernard Boigelot (Handbook of Automata Theory (II.), 2021)

Deciding Satisfiability for Fragments with Unary Predicates and Difference Arithmetic (short paper). - Bernard Boigelot; Pascal Fontaine; Baptiste Vergain (SC-Square@SIAM AG, 2021)

Decidability of difference logics with unary predicates. - Bernard Boigelot; Pascal Fontaine; Baptiste Vergain (SC-Square@FLoC, 2022)

Decidability of Difference Logic over the Reals with Uninterpreted Unary Predicates. - Bernard Boigelot; Pascal Fontaine; Baptiste Vergain (CADE, 2023)

Universal First-Order Quantification over Automata. - Bernard Boigelot; Pascal Fontaine; Baptiste Vergain (CIAA, 2023)

First-Order Quantification over Automata. - Bernard Boigelot; Pascal Fontaine; Baptiste Vergain (CoRR, 2023)

Non-emptiness Test for Automata over Words Indexed by the Reals and Rationals. - Bernard Boigelot; Pascal Fontaine; Baptiste Vergain (CIAA, 2024)

Epsilon Automata on Linear Orderings. - Bernard Boigelot; Thomas Braipson; Tom Clara (CIAA, 2025)