Polyhedral Analysis for Synchronous Languages - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1999

Polyhedral Analysis for Synchronous Languages

Résumé

We define an operational semantics for the Signal language and design an analysis which allows to verify properties pertaining to the relation between values of the numeric and boolean variables of a reactive system. A distinguished feature of the analysis is that it is expressed and proved correct with respect to the source program rather than on an intermediate representation of the program. The analysis calculates a safe approximation to the set of reachable states by a symbolic fixed point computation in the domain of convex polyhedra using a novel widening operator based on the convex hull representation of polyhedra.
Fichier principal
Vignette du fichier
CONCUR99-besson.pdf (273.46 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00544493 , version 1 (08-12-2010)

Identifiants

  • HAL Id : hal-00544493 , version 1

Citer

Frédéric Besson, Thomas Jensen, Jean-Pierre Talpin. Polyhedral Analysis for Synchronous Languages. 6th International Symposium on Static Analysis (SAS'99), Sep 1999, Venice, Italy. pp.51-68. ⟨hal-00544493⟩
141 Consultations
124 Téléchargements

Partager

Gmail Facebook X LinkedIn More