Skip to Main content Skip to Navigation
Reports

A Logical Framework to Prove Properties of Alpha Programs

Luc Bougé 1 David Cachera 1
1 REMAP - Regularity and massive parallel computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
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 andconfluence 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 equivalence properties between Alpha programs.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00073662
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 1:26:27 PM
Last modification on : Wednesday, November 20, 2019 - 2:34:18 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:53:57 PM

Identifiers

  • HAL Id : inria-00073662, version 1

Collections

Citation

Luc Bougé, David Cachera. A Logical Framework to Prove Properties of Alpha Programs. [Research Report] RR-3031, INRIA. 1996. ⟨inria-00073662⟩

Share

Metrics

Record views

220

Files downloads

263