Sur-approximations non régulières et terminaison pour l’analyse d’accessibilité

Abstract : Reachability analysis is part of model checking. It consists to model complex systems by three sets : initial language, unwanted configurations and rewrite system. The initial language and the unwanted configurations language are sets of terms. Terms are words which are construct with symbols that have an arity that can be greater than 1. The rewrite system represent the dynamic of the complex system. It is a set of rules that permit from a initial term to obtain a new term. One of the approaches to analyze reachability from this modelling is to compute the set of reachable configurations. This set which is called set of descendants is obtained by applying the rewrite system on the initial language until obtaining no more new terms. After the set of descendants is computed, we need to compute the intersection between this set and the unwanted configurations set. If this intersection is empty then there is no unwanted configuration reachable, else the configurations in this intersection are reachable. However, the set of descendants is not computable in the general case. To bypass this problem, we compute an over-approximation of descendants.Now, if the intersection is empty, we keep proving that no unwanted configuration is reachable. Nevertheless, if the intersection is not empty, it is not possible to know if it comes from false-positives or form unwanted reachable configurations. So, the precision of the over-approximation is decisive.
Document type :
Theses
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01891863
Contributor : Abes Star <>
Submitted on : Wednesday, October 10, 2018 - 9:59:05 AM
Last modification on : Thursday, January 17, 2019 - 3:10:02 PM
Long-term archiving on : Friday, January 11, 2019 - 12:59:34 PM

File

vivien-pelletier_3510.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01891863, version 1

Citation

Vivien Pelletier. Sur-approximations non régulières et terminaison pour l’analyse d’accessibilité. Modélisation et simulation. Université d'Orléans, 2017. Français. ⟨NNT : 2017ORLE2044⟩. ⟨tel-01891863⟩

Share

Metrics

Record views

47

Files downloads

38