@InProceedings{   haddad:hal-00865682,
  Author        = "Haddad, Axel",
  Abstract      = "{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.}",
  Address       = "Guwahati, Inde",
  affiliation   = "Laboratoire d'informatique Algorithmique : Fondements et Applications - LIAFA , Laboratoire d'Informatique Gaspard-Monge - LIGM",
  audience      = "non sp{\'e}cifi{\'e}e",
  BookTitle     = "{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}",
  date-added    = "2013-12-10 13:58:19 +0000",
  date-modified = "2013-12-10 13:58:19 +0000",
  hal_id        = "hal-00865682",
  Language      = "Anglais",
  Note          = "Accepted paper to FSTTCS'13",
  Number        = "to appear",
  Pages         = "to appear",
  PDF           = "http://hal.archives-ouvertes.fr/hal-00865682/PDF/main.pdf",
  Title         = "{Model Checking and Functional Program Transformations}",
  URL           = "http://hal.archives-ouvertes.fr/hal-00865682",
  Volume        = "to appear",
  Year          = "2013",
  bdsk-url-1    = "http://hal.archives-ouvertes.fr/hal-00865682",
  File          = "Model Checking and Functional Program Transformations - Haddad (0) (0) - a - a - t.pdf"
}

@InProceedings{ haddad:hal-00865682, Author = "Haddad, Axel", Abstract = "{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.}", Address = "Guwahati, Inde", affiliation = "Laboratoire d'informatique Algorithmique : Fondements et Applications - LIAFA , Laboratoire d'Informatique Gaspard-Monge - LIGM", audience = "non sp{\'e}cifi{\'e}e", BookTitle = "{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}", date-added = "2013-12-10 13:58:19 +0000", date-modified = "2013-12-10 13:58:19 +0000", hal_id = "hal-00865682", Language = "Anglais", Note = "Accepted paper to FSTTCS'13", Number = "to appear", Pages = "to appear", PDF = "http://hal.archives-ouvertes.fr/hal-00865682/PDF/main.pdf", Title = "{Model Checking and Functional Program Transformations}", URL = "http://hal.archives-ouvertes.fr/hal-00865682", Volume = "to appear", Year = "2013", bdsk-url-1 = "http://hal.archives-ouvertes.fr/hal-00865682", File = "Model Checking and Functional Program Transformations - Haddad (0) (0) - a - a - t.pdf" }