Flat Model Checking for Counting LTL using Quantifier-free Presburger Arithmetic
This paper presents an approximation approach to verifying counter systems with respect to properties formulated in an expressive counting extension of linear temporal logic. It can express, e.g., that the number of acknowledgements never exceeds the number of requests to a service, by counting specific positions along a run and imposing arithmetic constraints. The addressed problem is undecidable and therefore solved on flat under-approximations of a system. This provides a flexibly adjustable trade-off between exhaustiveness and computational effort, similar to bounded model checking. Recent techniques and results for model-checking frequency properties over flat Kripke structures are lifted and employed to construct a parametrised encoding of the (approximated) problem in quantifier-free Presburger arithmetic. A prototype implementation based on the z3 SMT solver demonstrates the effectiveness of the approach based on problems from the RERS Challange.
Mon 14 Jan (GMT+01:00) Greenwich Mean Time : Belfast change
|16:00 - 16:30|
Verification of an Industrial Asynchronous Leader Election Algorithm Using Abstractions and Parametric Model Checking
|16:30 - 17:00|
|17:00 - 17:30|