Using models to model-check recursive schemes

Abstract : We propose a model-based approach to the model checking problem for recursive schemes. Since simply typed lambda calculus with the fixpoint operator, lambda-Y-calculus, is equivalent to schemes, we propose to use a model of lambda-Y 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. We argue that having a model capable of recognizing terms satisfying a given property has other benefits than just providing decidability of the model-checking problem. We show a very simple construction transforming a scheme to a scheme reflecting a given property.
Type de document :
Communication dans un congrès
TLCA 2013, 2013, Eindhoven, Netherlands. 7941, pp.189-204, 2013, LNCS
Contributeur : Sylvain Salvati <>
Soumis le : vendredi 12 octobre 2012 - 10:57:30
Dernière modification le : jeudi 10 septembre 2015 - 01:08:33


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00741077, version 2



Sylvain Salvati, Igor Walukiewicz. Using models to model-check recursive schemes. TLCA 2013, 2013, Eindhoven, Netherlands. 7941, pp.189-204, 2013, LNCS. <hal-00741077v2>



Consultations de
la notice


Téléchargements du document