A Logical Framework to Prove Properties of Alpha Programs (revised version) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1997

A Logical Framework to Prove Properties of Alpha Programs (revised version)

Luc Bougé
David Cachera

Abstract

We present an assertional approach to prove properties of Alpha programs. Alpha is a functional language based on affine recurrence equations. We first present two kinds of operational semantics for Alpha together with some equivalence and confluence properties of these semantics. We then present an attempt to provide Alpha with an external logical framework. We therefore define a proof method based on invariants. We focus on a particular class of invariants, namely canonical invariants, that are a logical expression of the program's semantics. We finally show that this framework is well-suited to prove partial properties, equivalence properties between Alpha programs and properties that we cannot express within the Alpha language
Fichier principal
Vignette du fichier
RR-3177.pdf (277.83 Ko) Télécharger le fichier

Dates and versions

inria-00073512 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073512 , version 1

Cite

Luc Bougé, David Cachera. A Logical Framework to Prove Properties of Alpha Programs (revised version). [Research Report] RR-3177, INRIA. 1997. ⟨inria-00073512⟩
131 View
80 Download

Share

Gmail Facebook X LinkedIn More