Get started
Author

Bernard Boigelot

Observed names: B. Boigelot, Boigelot, Bernard, Prof Bernard Boigelot
Observed institution: University of Liège
ORCID: 0009-0009-4721-3824
Observed ORCID: 0009-0009-4721-3824
OpenAlex ID: A5078094550
Verifying systems with infinite but regular state spaces
1998 · Pierre Wolper, Bernard Boigelot · Lecture notes in computer science · 157
PDF
Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs
1999 · Bernard Boigelot, Patrice Godefroid · Formal Methods in System Design · 140
Symbolic verification with periodic sets
1994 · Bernard Boigelot, Pierre Wolper · Lecture notes in computer science · 123
PDF
Symbolic Methods for Exploring Infinite State Spaces
1998 · Bernard Boigelot · ORBi (University of Liège) · 122
PDF
An automata-theoretic approach to Presburger arithmetic constraints
1995 · Pierre Wolper, Bernard Boigelot · Lecture notes in computer science · 97
On the Construction of Automata from Linear Arithmetic Constraints
2000 · Pierre Wolper, Bernard Boigelot · Lecture notes in computer science · 90
PDF
Iterating Transducers in the Large
2003 · Bernard Boigelot, Axel Legay, et al. · Lecture notes in computer science · 87
PDF
Symbolic verification of communication protocols with infinite state spaces using QDDs
1996 · Bernard Boigelot, Patrice Godefroid · Lecture notes in computer science · 87
PDF
On the expressiveness of real and integer arithmetic automata
1998 · Bernard Boigelot, Stéphane Rassart, et al. · Lecture notes in computer science · 75
The Power of QDDs
1997 · Bernard Boigelot, Patrice Godefroid, et al. · Lecture notes in computer science · 72
The power of QDDs (extended abstract)
1997 · Bernard Boigelot, Patrice Godefroid, et al. · Lecture notes in computer science · 72
PDF
An effective decision procedure for linear arithmetic over the integers and reals
2005 · Bernard Boigelot, Sébastien Jodogne, et al. · ACM Transactions on Computational Logic · 68
Representing Arithmetic Constraints with Finite Automata: An Overview
2002 · Bernard Boigelot, Pierre Wolper · Lecture notes in computer science · 49
PDF
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables
2001 · Bernard Boigelot, Sébastien Jodogne, et al. · Lecture notes in computer science · 47
On iterating linear transformations over recognizable sets of integers
2003 · Bernard Boigelot · Theoretical Computer Science · 43
PDF
An improved reachability analysis method for strongly linear hybrid systems (extended abstract)
1997 · Bernard Boigelot, Louis Bronne, et al. · Lecture notes in computer science · 42
PDF
Omega-Regular Model Checking
2004 · Bernard Boigelot, Axel Legay, et al. · Lecture notes in computer science · 41
PDF
Counting the solutions of Presburger equations without enumerating them
2003 · Bernard Boigelot, Louis Latour · Theoretical Computer Science · 30
PDF
A Generalization of Semenov’s Theorem to Automata over Real Numbers
2009 · Bernard Boigelot, Julien Brusten, et al. · Lecture notes in computer science · 27
Iterating Transducers in the Large (Extended Abstract)
2003 · Bernard Boigelot, Axel Legay, et al. · 25
A generalization of Cobham’s theorem to automata over real numbers
2009 · Bernard Boigelot, Julien Brusten · Theoretical Computer Science · 23
Model checking in practice: An analysis of the ACCESS.bus™ protocol using SPIN
1996 · Bernard Boigelot, Patrice Godefroid · Lecture notes in computer science · 23
PDF
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
2010 · Bernard Boigelot, Julien Brusten, et al. · Logical Methods in Computer Science · 19
PDF
The Power of Hybrid Acceleration
2006 · Bernard Boigelot, Frédéric Herbreteau · Lecture notes in computer science · 19
Automatic synthesis of specifications from the dynamic observation of reactive programs
1997 · Bernard Boigelot, Patrice Godefroid · Lecture notes in computer science · 18
PDF
Works count: 89
Citation count: 1,694
H-index: 22
I10-index: 28
Year
Topic
Type