Slides

Equivalence Between
Model-Checking Flat Counter Systems
and Presburger Arithmetic
Amit Kumar Dhar
LIAFA,
Paris.
ULB,
Belgium.
Casstings Meeting
Joint Work With:
Stéphane Demri,Arnaud Sangnier
NYU,
New York. CNRS,
France. LIAFA, Université Paris Diderot,
Paris.

.Verication .Model Checking
..
A System
.
Satises
.
A Property
.................... A .|=
▶Model-checking innite state systems are generally undecidable.
▶Decidability can be obtained by restricting expressiveness.
..
1

.Verication .Model Checking
..
A System
.
Satises
.
A Property
...................
.A .|=
▶Model-checking innite state systems are generally undecidable.
▶Decidability can be obtained by restricting expressiveness.
..
1

.Verication .Model Checking
..
A System
.
Satises
.
A Property
.................... A
.|=
▶Model-checking innite state systems are generally undecidable.
▶Decidability can be obtained by restricting expressiveness.
..
1

.Verication .Model Checking
..
A System
.
Satises
.
A Property
.................... A .|=
▶Model-checking innite state systems are generally undecidable.
▶Decidability can be obtained by restricting expressiveness.
..
1