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 | 236 | 1999 |

Symbolic verification of communication protocols with infinite state spaces using QDDs B Boigelot, P Godefroid Computer Aided Verification, 1-12, 1996 | 236 | 1996 |

Symbolic verification with periodic sets B Boigelot, P Wolper Computer Aided Verification, 55-67, 1994 | 217 | 1994 |

Verifying systems with infinite but regular state space B Boigelot, P Wolper Proc. of CAV’98, LNCS 1427, 1998 | 213* | 1998 |

Symbolic methods for exploring infinite state spaces B Boigelot Universite de Liege, 1999 | 186 | 1999 |

Verifying systems with infinite but regular state spaces P Wolper, B Boigelot Computer Aided Verification, 88-97, 1998 | 186 | 1998 |

The power of QDDs B Boigelot, P Godefroid, B Willems, P Wolper Static Analysis, 172-186, 1997 | 152 | 1997 |

Iterating transducers in the large B Boigelot, A Legay, P Wolper Computer Aided Verification, 223-235, 2003 | 132 | 2003 |

An automata-theoretic approach to Presburger arithmetic constraints P Wolper, B Boigelot Static Analysis, 21-32, 1995 | 130 | 1995 |

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 | 123 | 2000 |

On the expressiveness of real and integer arithmetic automata B Boigelot, S Rassart, P Wolper Automata, Languages and Programming, 152-163, 1998 | 87 | 1998 |

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 | 78 | 2005 |

Representing arithmetic constraints with finite automata: An overview B Boigelot, P Wolper Logic Programming, 1-20, 2002 | 58 | 2002 |

An improved reachability analysis method for strongly linear hybrid systems B Boigelot, L Bronne, S Rassart Computer Aided Verification, 167-178, 1997 | 54 | 1997 |

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 | 53 | 2001 |

Omega-regular model checking B Boigelot, A Legay, P Wolper Tools and Algorithms for the Construction and Analysis of Systems, 561-575, 2004 | 49 | 2004 |

On iterating linear transformations over recognizable sets of integers B Boigelot Theoretical Computer Science 309 (1), 413-468, 2003 | 36 | 2003 |

Counting the solutions of Presburger equations without enumerating them B Boigelot, L Latour Implementation and Application of Automata, 40-51, 2002 | 36 | 2002 |

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 | 31 | 1996 |

Counting the solutions of Presburger equations without enumerating them B Boigelot, L Latour Theoretical Computer Science 313 (1), 17-29, 2004 | 27 | 2004 |