2009 |
27 | EE | Bernard Boigelot,
Jean-François Degbomont:
Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization.
LATA 2009: 200-211 |
26 | EE | Bernard Boigelot,
Julien Brusten:
A generalization of Cobham's theorem to automata over real numbers.
Theor. Comput. Sci. 410(18): 1694-1703 (2009) |
2008 |
25 | EE | 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 |
24 | EE | Bernard Boigelot,
Julien Brusten:
A Generalization of Cobham's Theorem to Automata over Real Numbers.
ICALP 2007: 813-824 |
2006 |
23 | EE | Bernard Boigelot,
Frédéric Herbreteau:
The Power of Hybrid Acceleration.
CAV 2006: 438-451 |
2005 |
22 | | Bernard Boigelot:
Number-Set Representations for Infinite-State Verification.
VISSAS 2005: 1-16 |
21 | EE | 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) |
2004 |
20 | EE | Bernard Boigelot,
Axel Legay,
Pierre Wolper:
Omega-Regular Model Checking.
TACAS 2004: 561-575 |
19 | EE | Bernard Boigelot,
Louis Latour:
Counting the solutions of Presburger equations without enumerating them.
Theor. Comput. Sci. 313(1): 17-29 (2004) |
2003 |
18 | EE | Bernard Boigelot,
Frédéric Herbreteau,
Sébastien Jodogne:
Hybrid Acceleration Using Real Vector Automata (Extended Abstract).
CAV 2003: 193-205 |
17 | EE | Bernard Boigelot,
Axel Legay,
Pierre Wolper:
Iterating Transducers in the Large (Extended Abstract).
CAV 2003: 223-235 |
16 | EE | Bernard Boigelot,
Sébastien Jodogne,
Pierre Wolper:
An Effective Decision Procedure for Linear Arithmetic with Integer and Real Variables
CoRR cs.LO/0303019: (2003) |
15 | EE | Bernard Boigelot:
On iterating linear transformations over recognizable sets of integers.
Theor. Comput. Sci. 309(1-3): 413-468 (2003) |
2002 |
14 | EE | Bernard Boigelot,
Pierre Wolper:
Representing Arithmetic Constraints with Finite Automata: An Overview.
ICLP 2002: 1-19 |
2001 |
13 | EE | Bernard Boigelot,
Louis Latour:
Counting the Solutions of Presburger Equations without Enumerating Them.
CIAA 2001: 40-51 |
12 | EE | 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 |
2000 |
11 | EE | Pierre Wolper,
Bernard Boigelot:
On the Construction of Automata from Linear Arithmetic Constraints.
TACAS 2000: 1-19 |
1999 |
10 | | Bernard Boigelot,
Patrice Godefroid:
Symbolic Verification of Communication Protocols with Infinite State Spaces using QDDs.
Formal Methods in System Design 14(3): 237-255 (1999) |
1998 |
9 | | Pierre Wolper,
Bernard Boigelot:
Verifying Systems with Infinite but Regular State Spaces.
CAV 1998: 88-97 |
8 | EE | Bernard Boigelot,
Stéphane Rassart,
Pierre Wolper:
On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract).
ICALP 1998: 152-163 |
1997 |
7 | | Bernard Boigelot,
Louis Bronne,
Stéphane Rassart:
An Improved Reachability Analysis Method for Strongly Linear Hybrid Systems (Extended Abstract).
CAV 1997: 167-178 |
6 | | Bernard Boigelot,
Patrice Godefroid,
Bernard Willems,
Pierre Wolper:
The Power of QDDs (Extended Abstract).
SAS 1997: 172-186 |
5 | | Bernard Boigelot,
Patrice Godefroid:
Automatic Synthesis of Specifications from the Dynamic Observation of Reactive Programs.
TACAS 1997: 321-333 |
1996 |
4 | | Bernard Boigelot,
Patrice Godefroid:
Symbolic Verification of Communication Protocols with Infinite State Spaces Using QDDs (Extended Abstract).
CAV 1996: 1-12 |
3 | | Bernard Boigelot,
Patrice Godefroid:
Model Checking in Practice: An Analysis of the ACCESS.bus Protocol using SPIN.
FME 1996: 465-478 |
1995 |
2 | | Pierre Wolper,
Bernard Boigelot:
An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract)
SAS 1995: 21-32 |
1994 |
1 | | Bernard Boigelot,
Pierre Wolper:
Symbolic Verification with Periodic Sets.
CAV 1994: 55-67 |