#### Filter Results:

- Full text PDF available (40)

#### Publication Year

1994

2017

- This year (0)
- Last 5 years (7)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Bernard Boigelot, Patrice Godefroid
- Formal Methods in System Design
- 1999

Queue-content Decision Diagrams (QDDs) are finite-automaton based data structures for representing (possibly infinite) sets of contents of a finite collection of unbounded FIFO queues. Their intendedâ€¦ (More)

- Pierre Wolper, Bernard Boigelot
- TACAS
- 2000

This paper presents an overview of algorithms for constructing automata from linear arithmetic constraints. It identifies one case in which the special structure of the automata that are constructedâ€¦ (More)

- Bernard Boigelot, SÃ©bastien Jodogne, Pierre Wolper
- ACM Trans. Comput. Log.
- 2005

This article considers finite-automata-based algorithms for handling linear arithmetic with both real and integer variables. Previous work has shown that this theory can be dealt with by using finiteâ€¦ (More)

- Bernard Boigelot, StÃ©phane Rassart, Pierre Wolper
- ICALP
- 1998

1 I n t r o d u c t i o n The ab i l i ty to represen t and m a n i p u l a t e sets of in tegers a n d / o r reals is a fundamen ta l tool t ha t has many appl ica t ions . T h e specific p rob lâ€¦ (More)

- Bernard Boigelot, SÃ©bastien Jodogne, Pierre Wolper
- IJCAR
- 2001

This paper considers finite-automata based algorithms for handling linear arithmetic with both real and integer variables. Previous work has shown that this theory can be dealt with by using finiteâ€¦ (More)

- Pierre Wolper, Bernard Boigelot
- SAS
- 1995

This paper introduces a finite-automata based representation of Presburger arithmetic definable sets of integer vectors. The representation consists of concurrent automata operating on the binaryâ€¦ (More)

- Bernard Boigelot, Patrice Godefroid
- CAV
- 1996

1 I n t r o d u c t i o n State-space exploration is one of the most successful s trategies for analyzing and verifying properties of finite-state concurrent reactive systems. It proceeds byâ€¦ (More)

- Bernard Boigelot, Pierre Wolper
- CAV
- 1994

Symbolic approaches attack the state explosion problem by introducing implicit representations that allow the simultaneous manipulation of large sets of states. The most commonly used representationâ€¦ (More)

- Bernard Boigelot, Axel Legay, Pierre Wolper
- CAV
- 2003

Checking infinite-state systems is frequently done by encoding infinite sets of states as regular languages. Computing such a regular representation of, say, the reachable set of states of a systemâ€¦ (More)