Using Models to Model-check Recursive Schemes - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Logical Methods in Computer Science Année : 2015

Using Models to Model-check Recursive Schemes

Résumé

We propose a model-based approach to the model checking problem for recur-sive schemes. Since simply typed lambda calculus with the fixpoint operator, λY-calculus, is equivalent to schemes, we propose the use of a model of λY-calculus to discriminate the terms that satisfy a given property. If a model is finite in every type, this gives a decision procedure. We provide a construction of such a model for every property expressed by automata with trivial acceptance conditions and divergence testing. Such properties pose already interesting challenges for model construction. Moreover, we argue that having models capturing some class of properties has several other virtues in addition to providing decidability of the model-checking problem. As an illustration, we show a very simple construction transforming a scheme to a scheme reflecting a property captured by a given model.
Fichier principal
Vignette du fichier
m.pdf (377.88 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01251224 , version 1 (05-01-2016)

Identifiants

Citer

Sylvain Salvati, Igor Walukiewicz. Using Models to Model-check Recursive Schemes. Logical Methods in Computer Science, 2015, Selected Papers of the Conference "Typed Lambda Calculi and Applications [TLCA] 2013, ⟨10.2168/LMCS-???⟩. ⟨hal-01251224⟩
152 Consultations
66 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More