Skip to Main content Skip to Navigation
New interface
Conference papers

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.
Document type :
Conference papers
Complete list of metadata
Contributor : Sylvain Salvati Connect in order to contact the contributor
Submitted on : Friday, October 12, 2012 - 10:57:30 AM
Last modification on : Saturday, June 25, 2022 - 8:29:25 PM
Long-term archiving on: : Friday, March 31, 2017 - 2:10:50 PM


Files produced by the author(s)


  • HAL Id : hal-00741077, version 2



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



Record views


Files downloads