Deriving Analysers by Folding/Unfolding of Natural Semantics and a Case Study: Slicing

Valérie Gouranton 1
1 Lande - Logiciel : ANalyse et DEveloppement
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : We consider specifications of analysers expressed as compositions of two functions: a semantic function, which returns a natural semantics derivation tree, and a property defined by recurrence on derivation trees. A recursive definition of a dynamic analyser can be obtained by fold/unfold program transformation combined with deforestation. We apply our framework to the derivation of a slicing analysis for a logic programming language.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00073277
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 12:25:27 PM
Last modification on : Friday, November 16, 2018 - 1:23:42 AM
Long-term archiving on : Sunday, April 4, 2010 - 9:24:45 PM

Identifiers

  • HAL Id : inria-00073277, version 1

Citation

Valérie Gouranton. Deriving Analysers by Folding/Unfolding of Natural Semantics and a Case Study: Slicing. [Research Report] RR-3413, INRIA. 1998. ⟨inria-00073277⟩

Share

Metrics

Record views

223

Files downloads

273