Abstract
We apply linear relation analysis [CH78,HPR97] to the verification of declarative synchronous programs [Hal98]. In this approach, state partitioning plays an important role: on one hand the precision of the results highly depends on the fineness of the partitioning; on the other hand, a too much detailed partitioning may result in an exponential explosion of the analysis. In this paper, we propose to dynamically select a suitable partitioning according to the property to be proved.
This work was partially supported by the ESPRIT-LTR project “SYRF”.
Verimag is a joint laboratory of Université Joseph Fourier (Grenoble I), CNRS and INPG associated with IMAG.
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.
References
T. Bultan, R. Gerber, and C. League. Composite model checking: Verification with type-specific symbolic representations. Technical Report TRCS99-02, University of California, Santa Barbara, January 1999.
T. Bultan, R. Gerber, and W. Pugh. Symbolic model checking of infinite state systems using presburger arithmeti c. In Computer Aided Verification, CAV’97. LNCS 1254, Springer Verlag, June 1997.
F. Bourdoncle. Abstract interpretation by dynamic partitionning. Journal of Functional Programming, 2(4), 1992.
F. Bourdoncle. Sémantique des langages impératifs d’ordre supérieur et interprétation abstraite. Thesis Ecole Polytechnique, Paris, 1992.
P. Cousot and R. Cousot. Static determination of dynamic properties of programs. In 2nd Int. Symp. on Programming. Dunod, Paris, 1976.
P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th ACM Symposium on Principles of Programming Languages, POPL’77, Los Angeles, January 1977.
P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 1992.
P. Cousot and R. Cousot. Comparing the Galois connection and widening/narrowing approaches to abstract interpretation. In M. Bruynooghe and M. Wirsing, editors, PLILP’92, Leuven (Belgium), January 1992. LNCS 631, Springer Verlag.
P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In 5th ACM Symposium on Principles of Programming Languages, POPL’78, Tucson (Arizona), January 1978.
N. Halbwachs. About synchronous programming and abstract interpretation. Science of Computer Programming, Special Issue on SAS’94, 31(1), May 1998.
N. Halbwachs, Y.E. Proy, and P. Roumanoff. Verification of real-time systems using linear relation analysis. Formal Methods in System Design, 11(2):157–185, August 1997.
N. D. Jones, C. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall International, 1993.
Ch. Mauras. Symbolic simulation of interpreted automata. In 3rd Workshop on Synchronous Programming, Dagstuhl (Germany), December 1996.
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
Jeannet, B., Halbwachs, N., Raymond, P. (1999). Dynamic Partitioning in Analyses of Numerical Properties. 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_3
Download citation
DOI: https://doi.org/10.1007/3-540-48294-6_3
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