Name
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 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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.entcs.2010.09.009 | Electr. Notes Theor. Comput. Sci. |
Keywords | Field | DocType |
numerical input variable,abstract interpretation,acceleration,counter machine model,extending abstract acceleration methods,lustre program,latter problem,reachability analysis,static analysis,boolean state,numerical inputs,abstract acceleration,acceleration method,linear relation analysis,data-flow programs,control graph,numerical variable,data flow | Counter machine,Graph,Abstract interpretation,Computer science,Static analysis,Algorithm,Theoretical computer science,Reachability,Acceleration,Boolean algebra,Data flow diagram | Journal |
Volume | Issue | ISSN |
267 | 1 | Electronic Notes in Theoretical Computer Science |
Citations | PageRank | References |
7 | 0.46 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Schrammel | 1 | 134 | 19.10 |
| Bertrand Jeannet | 2 | 641 | 29.06 |