Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. 5th Symp. on Logic in Computer Science (LICS 90), pages 414–425, 1990.
A. Benveniste and P. Le Guernic. Hybrid dynamical systems theory and the SIGNAL language. IEEE Trans. on Automatic Control, 35(5):535–546, May 1990.
A. Benveniste, P. Le Guernic, and C. Jacquemot. Synchronous programming with events and relations: the Signal language and its semantics. Science of Computer Programming, 16(2):103–149, September 1991.
G. Berry and G. Gonthier. The esterel synchronous programming language: design, semantics, implementation. Science of Computer Programming, 19, 1992.
M. Le Borgne, H. Marchand, E. Rutten, and M. Samaan. Formal verification of signal programs: Application to a power transformer station controller. In Proc. of the Fifth International Conference on Algebraic Methodology and Software Technology, pages 271–285. Springer LNCS vol. 1101, 1996.
P. Caspi, D. Pilaud, N. Halbwachs, and J. Plaice. Lustre: A declarative language for programming synchronous systems. In Proc. of 14th ACM Symp. on Principles of Programming Languages, pages 178–188. ACM Press, 1987.
P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In Proc. of the 4th ACM Symp. on Principles of Programming Languages, Los Angeles, pages 238–252, New York, NY, 1977. ACM.
P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Proc. of the 5th ACM Symp. on Principles of Programming Languages, pages 84–96. ACM, January 1978.
C. Daws, A. Olivero, S. Tripakis, and S. Yovine. The tool kronos. In R. Alur, T. A. Henzinger, and E. D. Sontag, editors, Hybrid Systems III, volume 1066 of Lecture Notes in Computer Science, pages 208–219. Springer-Verlag, 1996.
N. Halbwachs. Delay analysis in synchronous programs. In C. Courcoubetis, editor, Proc. of the 5th Int. Conference on Computer Aided Verification, volume 697 of LNCS, pages 333–346. Springer, 1993.
N. Halbwachs. Synchronous Programming of Reactive Systems. Kluwer Academic Publishers, 1993.
N. Halbwachs. About synchronous programming and abstract interpretation. In B. Le Charlier, editor, Proc. of the 1st Int. Static Analysis Symposium, LNCS 864, pages 179–192. Springer, 1994.
N. Halbwachs, F. Lagnier, and C. Ratel. Programming and verifying real-time systems by means of the synchronous data-flow language Lustre. IEEE Trans. on Software Engineering, 18(9):785–793, September 1992.
N. Halbwachs, F. Lagnier, and P. Raymond. Synchronous observers and the verification of reactive systems. In M. Nivat, C. Rattray, T. Rus, and G. Scollo, editors, 3d Int. Conf. on Algebraic Methodology and Software Technology, AMAST’93. Workshops in Computing, Springer, 1993.
N. Halbwachs, Y.-E. Proy, and P. Raymond. Verification of linear hybrid systems by means of convex approximations. In B. Le Charlier, editor, Proc. of the 1st Int. Static Analysis Symposium, LNCS 864, pages 223–237. Springer, 1994.
T. Jensen. Clock analysis of synchronous data ow programs. In Proc. of ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation. ACM Press, 1995.
D. K. Wilde. A Library for Doing Polyhedral Operations. Research Report 785, INRIA, December 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Besson, F., Jensen, T., Talpin, JP. (1999). Polyhedral Analysis for Synchronous Languages. In: Cortesi, A., Filé, G. (eds) Static Analysis. SAS 1999. Lecture Notes in Computer Science, vol 1694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48294-6_4
Download citation
DOI: https://doi.org/10.1007/3-540-48294-6_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66459-8
Online ISBN: 978-3-540-48294-9
eBook Packages: Springer Book Archive