Extending abstract acceleration methods to data-flow programs with numerical inputs

Schrammel, Peter and Jeannet, Bertrand (2010) Extending abstract acceleration methods to data-flow programs with numerical inputs. Electronic Notes in Theoretical Computer Science, 267 (1). pp. 101-114. ISSN 1571-0661

[img] PDF - Published Version
Download (273kB)


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.

Item Type: Article
Keywords: static analysis; acceleration; abstract interpretation; linear relation analysis
Schools and Departments: School of Engineering and Informatics > Informatics
Subjects: Q Science > QA Mathematics > QA0075 Electronic computers. Computer science
Depositing User: Peter Schrammel
Date Deposited: 09 May 2016 10:59
Last Modified: 07 Mar 2017 00:22
URI: http://srodev.sussex.ac.uk/id/eprint/60803

View download statistics for this item

📧 Request an update