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 (3), 237-255, 1999
2421999
Symbolic verification of communication protocols with infinite state spaces using QDDs
B Boigelot, P Godefroid
Computer Aided Verification, 1-12, 1996
2421996
Symbolic verification with periodic sets
B Boigelot, P Wolper
Computer Aided Verification, 55-67, 1994
2231994
Verifying systems with infinite but regular state space
B Boigelot, P Wolper
Proc. of CAV’98, LNCS 1427, 1998
214*1998
Symbolic methods for exploring infinite state spaces
B Boigelot
Universite de Liege, 1999
1921999
Verifying systems with infinite but regular state spaces
P Wolper, B Boigelot
Computer Aided Verification, 88-97, 1998
1881998
The power of QDDs
B Boigelot, P Godefroid, B Willems, P Wolper
Static Analysis, 172-186, 1997
1571997
Iterating transducers in the large
B Boigelot, A Legay, P Wolper
Computer Aided Verification, 223-235, 2003
1352003
An automata-theoretic approach to Presburger arithmetic constraints
P Wolper, B Boigelot
Static Analysis, 21-32, 1995
1311995
On the construction of automata from linear arithmetic constraints
P Wolper, B Boigelot
Tools and Algorithms for the Construction and Analysis of Systems, 1-19, 2000
1262000
On the expressiveness of real and integer arithmetic automata
B Boigelot, S Rassart, P Wolper
Automata, Languages and Programming, 152-163, 1998
901998
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
802005
Representing arithmetic constraints with finite automata: An overview
B Boigelot, P Wolper
Logic Programming, 1-20, 2002
562002
On the use of weak automata for deciding linear arithmetic with integer and real variables
B Boigelot, S Jodogne, P Wolper
Automated reasoning, 611-625, 2001
552001
An improved reachability analysis method for strongly linear hybrid systems
B Boigelot, L Bronne, S Rassart
Computer Aided Verification, 167-178, 1997
551997
Omega-regular model checking
B Boigelot, A Legay, P Wolper
Tools and Algorithms for the Construction and Analysis of Systems, 561-575, 2004
502004
On iterating linear transformations over recognizable sets of integers
B Boigelot
Theoretical Computer Science 309 (1), 413-468, 2003
392003
Counting the solutions of Presburger equations without enumerating them
B Boigelot, L Latour
Implementation and Application of Automata, 40-51, 2002
362002
Model checking in practice: An analysis of the ACCESS. bus™ protocol using SPIN
B Boigelot, P Godefroid
FME'96: Industrial Benefit and Advances in Formal Methods, 465-478, 1996
331996
Counting the solutions of Presburger equations without enumerating them
B Boigelot, L Latour
Theoretical Computer Science 313 (1), 17-29, 2004
272004
The system can't perform the operation now. Try again later.
Articles 1–20