Skip to Main content Skip to Navigation
New interface
Reports (Research report)

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

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 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
Document type :
Reports (Research report)
Complete list of metadata
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 1:05:54 PM
Last modification on : Wednesday, October 26, 2022 - 8:16:07 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:59:55 PM


  • HAL Id : inria-00073512, version 1



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



Record views


Files downloads