Skip to Main content Skip to Navigation
Journal articles

Applying abstract acceleration to (co-)reachability analysis of reactive programs

Peter Schrammel 1, * Bertrand Jeannet 1, *
* Corresponding author
1 POP ART - Programming languages, Operating Systems, Parallelism, and Aspects for Real-Time
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : 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, e.g. Lustre programs, requires to deal with the non-deterministic transformations due to numerical input variables. In this article, we address this problem by extending the concept of abstract acceleration of Gonnord et al. to numerical input variables. Moreover, we describe the dual analysis for co-reachability. We compare our method with some alternative techniques based on abstract interpretation pointing out its advantages and limitations. At last, we give some experimental results.
Complete list of metadata

Cited literature [39 references]  Display  Hide  Download

https://hal.inria.fr/hal-00753412
Contributor : Peter Schrammel <>
Submitted on : Monday, November 19, 2012 - 1:46:20 PM
Last modification on : Tuesday, February 9, 2021 - 3:24:16 PM
Long-term archiving on: : Thursday, February 21, 2013 - 11:21:01 AM

Files

paper.pdf
Files produced by the author(s)

Identifiers

Collections

CNRS | INRIA | LIG | UGA

Citation

Peter Schrammel, Bertrand Jeannet. Applying abstract acceleration to (co-)reachability analysis of reactive programs. Journal of Symbolic Computation, Elsevier, 2012, 47 (12), pp.1512-1532. ⟨10.1016/j.jsc.2011.12.051⟩. ⟨hal-00753412⟩

Share

Metrics

Record views

554

Files downloads

512