default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernard Boigelot
Person information
- affiliation: Université de Liège, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c33]Bernard Boigelot
, Pascal Fontaine, Baptiste Vergain:
Non-emptiness Test for Automata over Words Indexed by the Reals and Rationals. CIAA 2024: 94-108- 2023
- [c32]Bernard Boigelot, Pascal Fontaine, Baptiste Vergain:
Decidability of Difference Logic over the Reals with Uninterpreted Unary Predicates. CADE 2023: 542-559 - [c31]Bernard Boigelot, Pascal Fontaine, Baptiste Vergain:
Universal First-Order Quantification over Automata. CIAA 2023: 91-102 - [i7]Bernard Boigelot, Pascal Fontaine, Baptiste Vergain:
Decidability of Difference Logic over the Reals with Uninterpreted Unary Predicates. CoRR abs/2305.15059 (2023) - [i6]Bernard Boigelot, Pascal Fontaine, Baptiste Vergain:
First-Order Quantification over Automata. CoRR abs/2306.04210 (2023) - 2022
- [c30]Bernard Boigelot, Pascal Fontaine, Baptiste Vergain:
Decidability of difference logics with unary predicates. SC-Square@FLoC 2022: 25-36 - 2021
- [c29]Bernard Boigelot, Pascal Fontaine, Baptiste Vergain:
Deciding Satisfiability for Fragments with Unary Predicates and Difference Arithmetic (short paper). SC-Square@SIAM AG 2021: 18-26 - [p1]Bernard Boigelot:
Symbolic methods and automata. Handbook of Automata Theory (II.) 2021: 1189-1215
2010 – 2019
- 2018
- [c28]Bernard Boigelot, Isabelle Mainz:
Efficient Symbolic Representation of Convex Polyhedra in High-Dimensional Spaces. ATVA 2018: 284-299 - 2017
- [c27]Bernard Boigelot, Isabelle Mainz, Victor Marsault, Michel Rigo:
An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention. ICALP 2017: 118:1-118:14 - [i5]Bernard Boigelot, Isabelle Mainz, Victor Marsault, Michel Rigo:
An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention. CoRR abs/1702.03715 (2017) - 2016
- [i4]Stéphane Lens, Bernard Boigelot:
From Constrained Delaunay Triangulations to Roadmap Graphs with Arbitrary Clearance. CoRR abs/1606.02055 (2016) - 2015
- [i3]Stéphane Lens, Bernard Boigelot:
Efficient Path Interpolation and Speed Profile Computation for Nonholonomic Mobile Robots. CoRR abs/1508.02608 (2015) - 2014
- [c26]Bernard Boigelot, Frédéric Herbreteau, Isabelle Mainz:
Acceleration of Affine Hybrid Transformations. ATVA 2014: 31-46 - [c25]Raphael Fonteneau, Damien Ernst, Bernard Boigelot, Quentin Louveaux:
Lipschitz robust control from off-policy trajectories. CDC 2014: 4924-4931 - 2013
- [j8]Raphael Fonteneau, Damien Ernst, Bernard Boigelot, Quentin Louveaux:
Min Max Generalization for Deterministic Batch Mode Reinforcement Learning: Relaxation Schemes. SIAM J. Control. Optim. 51(5): 3355-3385 (2013) - 2012
- [j7]Bernard Boigelot:
Domain-specific regular acceleration. Int. J. Softw. Tools Technol. Transf. 14(2): 193-206 (2012) - [c24]Bernard Boigelot, Julien Brusten, Jean-François Degbomont:
Automata-Based Symbolic Representations of Polyhedra. LATA 2012: 3-20 - [i2]Raphael Fonteneau, Damien Ernst, Bernard Boigelot, Quentin Louveaux:
Min Max Generalization for Deterministic Batch Mode Reinforcement Learning: Relaxation Schemes. CoRR abs/1202.5298 (2012) - 2010
- [j6]Bernard Boigelot, Julien Brusten, Véronique Bruyère:
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases. Log. Methods Comput. Sci. 6(1) (2010) - [c23]Bernard Boigelot, Julien Brusten, Jean-François Degbomont:
Implicit Real Vector Automata. INFINITY 2010: 63-76
2000 – 2009
- 2009
- [j5]Bernard Boigelot, Julien Brusten:
A generalization of Cobham's theorem to automata over real numbers. Theor. Comput. Sci. 410(18): 1694-1703 (2009) - [c22]Bernard Boigelot, Julien Brusten, Jérôme Leroux:
A Generalization of Semenov's Theorem to Automata over Real Numbers. CADE 2009: 469-484 - [c21]Bernard Boigelot, Jean-François Degbomont:
Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization. LATA 2009: 200-211 - 2008
- [c20]Bernard Boigelot, Julien Brusten, Véronique Bruyère:
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases. ICALP (2) 2008: 112-123 - 2007
- [c19]Bernard Boigelot, Julien Brusten:
A Generalization of Cobham's Theorem to Automata over Real Numbers. ICALP 2007: 813-824 - 2006
- [c18]Bernard Boigelot, Frédéric Herbreteau:
The Power of Hybrid Acceleration. CAV 2006: 438-451 - 2005
- [j4]Bernard Boigelot, Sébastien Jodogne, Pierre Wolper:
An effective decision procedure for linear arithmetic over the integers and reals. ACM Trans. Comput. Log. 6(3): 614-633 (2005) - [c17]Bernard Boigelot:
Number-Set Representations for Infinite-State Verification. VISSAS 2005: 1-16 - 2004
- [j3]Bernard Boigelot, Louis Latour:
Counting the solutions of Presburger equations without enumerating them. Theor. Comput. Sci. 313(1): 17-29 (2004) - [c16]Bernard Boigelot, Axel Legay, Pierre Wolper:
Omega-Regular Model Checking. TACAS 2004: 561-575 - 2003
- [j2]Bernard Boigelot:
On iterating linear transformations over recognizable sets of integers. Theor. Comput. Sci. 309(1-3): 413-468 (2003) - [c15]Bernard Boigelot, Frédéric Herbreteau, Sébastien Jodogne:
Hybrid Acceleration Using Real Vector Automata (Extended Abstract). CAV 2003: 193-205 - [c14]Bernard Boigelot, Axel Legay, Pierre Wolper:
Iterating Transducers in the Large (Extended Abstract). CAV 2003: 223-235 - [i1]Bernard Boigelot, Sébastien Jodogne, Pierre Wolper:
An Effective Decision Procedure for Linear Arithmetic with Integer and Real Variables. CoRR cs.LO/0303019 (2003) - 2002
- [c13]Bernard Boigelot, Pierre Wolper:
Representing Arithmetic Constraints with Finite Automata: An Overview. ICLP 2002: 1-19 - 2001
- [c12]Bernard Boigelot, Sébastien Jodogne, Pierre Wolper:
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables. IJCAR 2001: 611-625 - [c11]Bernard Boigelot, Louis Latour:
Counting the Solutions of Presburger Equations without Enumerating Them. CIAA 2001: 40-51 - 2000
- [c10]Pierre Wolper, Bernard Boigelot:
On the Construction of Automata from Linear Arithmetic Constraints. TACAS 2000: 1-19
1990 – 1999
- 1999
- [j1]Bernard Boigelot, Patrice Godefroid:
Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs. Formal Methods Syst. Des. 14(3): 237-255 (1999) - 1998
- [b1]Bernard Boigelot:
Symbolic Methods for Exploring Infinite State Spaces. University of Liège, Belgium, 1998 - [c9]Pierre Wolper, Bernard Boigelot:
Verifying Systems with Infinite but Regular State Spaces. CAV 1998: 88-97 - [c8]Bernard Boigelot, Stéphane Rassart, Pierre Wolper:
On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract). ICALP 1998: 152-163 - 1997
- [c7]Bernard Boigelot, Louis Bronne, Stéphane Rassart:
An Improved Reachability Analysis Method for Strongly Linear Hybrid Systems (Extended Abstract). CAV 1997: 167-178 - [c6]Bernard Boigelot, Patrice Godefroid, Bernard Willems, Pierre Wolper:
The Power of QDDs (Extended Abstract). SAS 1997: 172-186 - [c5]Bernard Boigelot, Patrice Godefroid:
Automatic Synthesis of Specifications from the Dynamic Observation of Reactive Programs. TACAS 1997: 321-333 - 1996
- [c4]Bernard Boigelot, Patrice Godefroid:
Symbolic Verification of Communication Protocols with Infinite State Spaces Using QDDs (Extended Abstract). CAV 1996: 1-12 - [c3]Bernard Boigelot, Patrice Godefroid:
Model Checking in Practice: An Analysis of the ACCESS.bus Protocol using SPIN. FME 1996: 465-478 - 1995
- [c2]Pierre Wolper, Bernard Boigelot:
An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract). SAS 1995: 21-32 - 1994
- [c1]Bernard Boigelot, Pierre Wolper:
Symbolic Verification with Periodic Sets. CAV 1994: 55-67
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-13 17:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
