Communication Dans Un Congrès Année : 2013

Model Checking and Functional Program Transformations

Résumé

We study a model for recursive functional programs called, higher order recursion schemes (HORS). We give new proofs of two verification related problems: reflection and selection for HORS. The previous proofs are based on the equivalence between HORS and collapsible push- down automata and they looses the structure of the initial program. The constructions presen- ted here are based on shape preserving transformations, and can be applied on actual programs without losing the structure of the program.

Fichier principal
Vignette du fichier
main.pdf (727.62 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-00865682 , version 1 (24-09-2013)
hal-00865682 , version 2 (10-10-2013)

Licence

Identifiants

  • HAL Id : hal-00865682 , version 2

Citer

Axel Haddad. Model Checking and Functional Program Transformations. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2013, Guwahati, India. ⟨hal-00865682v2⟩
242 Consultations
245 Téléchargements

Partager

  • More