
Reachability for TwoCounter Machines with One Test and One Reset.
[pdf]
This talk (or variants) was given at:

Boundedness and Coverability for Pushdown Vector Addition Systems.
[pdf]
This talk was given at:

HyperAckermannian Bounds for Pushdown Vector Addition Systems.
[pdf]
This talk was given at:

On the ContextFreeness Problem for Vector Addition Systems.
[pdf]
This talk was given at:

On the Boundedness Problem for Pushdown Vector Addition Systems.
[pdf]
This talk was given at:

A Relational Trace Logic for Vector Addition Systems with Application to ContextFreeness.
[pdf]
This talk was given at:

Safety Verification of Communicating OneCounter Machines.
[pdf]
This talk was given at:

Reachability Analysis of Communicating Pushdown Systems.
[pdf]
This talk was given at:

Software Verification.
[pdf]
This (7h30) lecture was given at:

Accelerated Dataflow Analysis.
[pdf]
This talk (or variants) was given at:

Acceleration in Convex DataFlow Analysis.
[pdf]
This talk was given at:

Méthodes Symboliques pour l'Exploration des Systèmes Infinis.
[pdf]
This talk was given at:

Flat counter automata almost everywhere!.
[pdf]
This talk was given at:

On flatness for 2dimensional vector addition systems with states.
[pdf]
This talk was given at:

Parametric analysis and abstraction of genetic regulatory networks.
[pdf]
This talk was given at:

An optimal automata approach to LTL model checking of probabilistic systems.
[pdf]
This talk was given at:

Temporalsafety proofs for systems code.
[pdf]
This talk (or variants) was given at:

Lazy abstraction.
This (handwritten) talk was given at:

An algorithm constructing the semilinear post* for 2dim Reset/Transfer VASS.
This (handwritten) talk was given at:

Decidability of reachability problems for classes of two counters automata.
[ps]
This talk (or variants) was given at:

Summer School on Modelling and Verification of Parallel Processes (MOVEP'2000), Nantes, France, June 2000.

Dagstuhl Seminar 00141 on the Verification of Infinitestate Systems, Schloss Dagstuhl, Wadern, Germany, April 2000.

Symposium on Theoretical Aspects of Computer Science (STACS'2000), Lille, France, February 2000.

Effective recognizability and model checking of reactive fiffo automata.
This (handwritten) talk was given at: