Article thumbnail
Location of Repository

Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs

By Peter Schrammel and Bertrand Jeannet


International audienceAcceleration methods are commonly used for computing precisely the effects of loops in the reachability analysis of counter machine models. Applying these methods on synchronous data-flow programs with Boolean and numerical variables, e.g. Lustre programs, firstly requires the enumeration of the Boolean states in order to obtain a control graph with numerical variables only. Secondly, acceleration methods have to deal with the non-determinism introduced by numerical input variables. In this article we address the latter problem by extending the concept of abstract acceleration of Gonnord et al. to numerical input variables

Topics: static analysis, acceleration, abstract interpretation, linear relation analysis, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]
Publisher: 'Elsevier BV'
Year: 2010
DOI identifier: 10.1016/j.entcs.2010.09.009
OAI identifier: oai:HAL:hal-00749914v1
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • (external link)
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.