Extending Timbuk to Verify Functional Programs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Extending Timbuk to Verify Functional Programs

Résumé

Timbuk implements the Tree Automata Completion algorithm whose purpose is to over-approximate sets of terms reachable by a term rewriting system. Completion is parameterized by a set of equations defining which terms are equated in the approximation. In this paper we present two extensions of Timbuk which permit us to automatically verify safety properties on functional programs. The first extension is a language, based on regular tree expressions, which eases the specification of the property to prove on the program. The second extension automatically generates a set of equations adapted to the property to prove on the program.
Fichier principal
Vignette du fichier
main.pdf (442.46 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01775190 , version 1 (24-04-2018)

Identifiants

Citer

Thomas Genet, Tristan Gillard, Timothée Haudebourg, Sébastien Lê Cong. Extending Timbuk to Verify Functional Programs. WRLA 2018 - 12th International Worshop on Rewriting Logic and its Applications, Apr 2018, Thessalonique, Greece. pp.153-163, ⟨10.1007/978-3-319-99840-4_9⟩. ⟨hal-01775190⟩
723 Consultations
159 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More