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

Peter Schrammel (1) , Bertrand Jeannet (1, 2)

1 POP ART - Programming languages, Operating Systems, Parallelism, and Aspects for Real-Time
2 LIG - Laboratoire d'Informatique de Grenoble

Acceleration 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.

Mots clés: static analysis; acceleration; abstract interpretation; linear relation analysis

Domaines: Systèmes embarqués; Calcul formel [cs.SC]

Peter Schrammel, Bertrand Jeannet. Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs. Numerical and Symbolic Abstract Domains, Sep 2010, Perpignan, France. pp.101-114, ⟨10.1016/j.entcs.2010.09.009⟩. ⟨hal-00749914⟩