Follow
Bernard Boigelot
Bernard Boigelot
Verified email at ulg.ac.be - Homepage
Title
Cited by
Cited by
Year
Symbolic verification of communication protocols with infinite state spaces using QDDs
B Boigelot, P Godefroid
Formal Methods in System Design 14, 237-255, 1999
2551999
Symbolic verification with periodic sets
B Boigelot, P Wolper
Computer Aided Verification: 6th International Conference, CAV'94 Stanford …, 1994
2311994
Verifying systems with infinite but regular state spaces
P Wolper, B Boigelot
Computer Aided Verification: 10th International Conference, CAV'98 Vancouver …, 1998
226*1998
Symbolic methods for exploring infinite state spaces
B Boigelot
ULiège-Université de Liège [Droit, Science politique et Criminologie], 1998
2051998
Verifying systems with infinite but regular state spaces
P Wolper, B Boigelot
Computer Aided Verification: 10th International Conference, CAV'98 Vancouver …, 1998
1971998
The power of QDDs
B Boigelot, P Godefroid, B Willems, P Wolper
Static Analysis: 4th International Symposium, SAS'97 Paris, France …, 1997
1631997
An automata-theoretic approach to Presburger arithmetic constraints
P Wolper, B Boigelot
International Static Analysis Symposium, 21-32, 1995
1421995
Iterating transducers in the large
B Boigelot, A Legay, P Wolper
International Conference on Computer Aided Verification, 223-235, 2003
1372003
On the construction of automata from linear arithmetic constraints
P Wolper, B Boigelot
International Conference on Tools and Algorithms for the Construction and …, 2000
1362000
On the expressiveness of real and integer arithmetic automata
B Boigelot, S Rassart, P Wolper
Automata, Languages and Programming: 25th International Colloquium, ICALP'98 …, 1998
1031998
An effective decision procedure for linear arithmetic over the integers and reals
B Boigelot, S Jodogne, P Wolper
ACM Transactions on Computational Logic (TOCL) 6 (3), 614-633, 2005
872005
On the use of weak automata for deciding linear arithmetic with integer and real variables
B Boigelot, S Jodogne, P Wolper
International Joint Conference on Automated Reasoning, 611-625, 2001
712001
An improved reachability analysis method for strongly linear hybrid systems
B Boigelot, L Bronne, S Rassart
Computer Aided Verification: 9th International Conference, CAV'97 Haifa …, 1997
611997
Representing arithmetic constraints with finite automata: An overview
B Boigelot, P Wolper
International Conference on Logic Programming, 1-20, 2002
602002
Omega-regular model checking
B Boigelot, A Legay, P Wolper
International Conference on Tools and Algorithms for the Construction and …, 2004
552004
On iterating linear transformations over recognizable sets of integers
B Boigelot
Theoretical Computer Science 309 (1-3), 413-468, 2003
462003
Counting the solutions of Presburger equations without enumerating them
B Boigelot, L Latour
Theoretical Computer Science 313 (1), 17-29, 2004
442004
Simulation of a process of a concurrent system
PI Godefroid, BA Boigelot
US Patent 5,937,181, 1999
371999
Counting the solutions of Presburger equations without enumerating them
B Boigelot, L Latour
Theoretical Computer Science 313 (1), 17-29, 2004
352004
Model checking in practice: An analysis of the ACCESS.bus protocol using SPIN
B Boigelot, P Godefroid
International Symposium of Formal Methods Europe, 465-478, 1996
321996
The system can't perform the operation now. Try again later.
Articles 1–20