B. Jeannet. Dynamic Partitioning in Linear Relation Analysis. Research Report RS-00-38, BRICS, December 2000.
Download paper: Gziped Postscript
Copyright notice:
This material is presented to ensure timely dissemination of scholarly and
technical work. Copyright and all rights therein are retained by authors or
by other copyright holders. All persons copying this information are expected
to adhere to the terms and constraints invoked by each author's
copyright. These works may not be reposted without the explicit permission of
the copyright holder.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic
Linear relation analysis is an abstract interpretation technique that computes linear constraints satisfied by the numerical variables of a program. We apply it to the verification of declarative synchronous programs. 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 consider very general partitions of the state space and to dynamically select a suitable partitioning according to the property to be proved. The presented approach is quite general and can be applied to other abstract interpretations
Bertrand Jeannet http://www.irisa.fr/prive/bjeannet
@TechReport{jeannet00,
Author = {Jeannet, B.},
Title = {Dynamic Partitioning in Linear Relation Analysis},
Institution = {RS-00-38, BRICS},
Month = {December},
Year = {2000}
}
Get EndNote Reference (.ref)
| VerTeCs
| Team
| Publications
| New Results
| Softwares
|
Irisa - Inria - Copyright 2005 © Projet VerTeCs |