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.
Cite
CITATION STYLE
Jeannet, B., Halbwachs, N., & Raymond, P. (1999). Dynamic partitioning in analyses of numerical properties. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1694, pp. 39–50). Springer Verlag. https://doi.org/10.1007/3-540-48294-6_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
