- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j7 |      | |
| 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. Logical Methods in Computer Science 6(1) (2010) |
| c23 | | Bernard Boigelot, Julien Brusten, Jean-François Degbomont: Implicit Real Vector Automata. INFINITY 2010: 63-76 |
| 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 | | |
| 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 |  | |
| 2004 | ||
| j3 | | Bernard Boigelot, Louis Latour: Counting the solutions of Presburger equations without enumerating them. Theor. Comput. Sci. 313(1): 17-29 (2004) |
| c16 | | |
| 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 |
| 1999 | ||
| j1 | | 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 | ||
| 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 | | |
Colors in the list of coauthors
Last update Sat May 25 17:22:08 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page