The Power of Hybrid Acceleration

Boigelot, Bernard; Herbreteau, Frédéric

doi:10.1007/11817963_40

Cited by 17 publications

(44 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The question is then to check whether the reflexive and transitive closure of such a relation preserves the representability of sets of real vectors by weak deterministic RVA. This problem has been studied in [BHJ03,BH06], which provide a partial solution in the form of a sufficient criterion, expressed by the following definition and theorem.…”

Section: Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

Domain-specific regular acceleration

Boigelot

2011

Int J Softw Tools Technol Transfer

Self Cite

View full text Add to dashboard Cite

Abstract. The regular model-checking approach is a set of techniques aimed at exploring symbolically infinite state spaces. These techniques proceed by representing sets of configurations of the system under analysis by regular languages, and the transition relation between these configurations by a transformation over such languages. The set of reachable configurations can then be computed by repeatedly applying the transition relation, starting from a representation of the initial set of configurations, until a fixed point is reached.In order for this computation to terminate, it is generally needed to introduce so-called acceleration operators, the purpose of which is to explore in one computation step infinitely many paths in the transition graph of the system. A simple form of acceleration operator is one that is associated to a cycle in the transition graph, computing the set of states that can be obtained by following this cycle arbitrarily many times.The computation of acceleration operators is strongly dependent on the type of the data values that are manipulated by the system, and on the symbolic representation chosen for handling sets of such values. In this survey, we describe acceleration operators suited for the regular state-space exploration of systems relying on FIFO communication channels, as well as those based on integer and real variables.

show abstract

Section: Algorithmsmentioning

confidence: 99%

“…In some situations, computing the effect of iterating such LHT can be reduced to computing the closure of a simpler LHT which is itself periodic. A number of reduction rules for performing this operation are introduced in [BHJ03,BH06].…”

Section: Algorithmsmentioning

confidence: 99%

Domain-specific regular acceleration

Boigelot

2011

Int J Softw Tools Technol Transfer

Self Cite

View full text Add to dashboard Cite

show abstract

“…The tool is composed of several C functions grouped into packages. The LASH toolset implements several specific algorithms for solving the (ω-)regular reachability problems of several classes of infinite-state systems, which include FIFO-queue systems [Boigelot and Godefroid 1996;Boigelot et al 1997], systems with integer variables [Boigelot 2003], and linear hybrid systems Boigelot and Herbreteau 2006]. T(O)RMC extends the LASH toolset with the generic algorithm presented in this paper.…”

Section: The T(o)rmc Toolsetmentioning

confidence: 99%

On (Omega-)regular model checking

Legay

Wolper

2010

ACM Trans. Comput. Logic

View full text Add to dashboard Cite

Checking infinite-state systems is frequently done by encoding infinite sets of states as regular languages. Computing such a regular representation of, say, the set of reachable states of a system requires acceleration techniques that can finitely compute the effect of an unbounded number of transitions. Among the acceleration techniques that have been proposed, one finds both specific and generic techniques. Specific techniques exploit the particular type of system being analyzed, e.g. a system manipulating queues or integers, whereas generic techniques only assume that the transition relation is represented by a finite-state transducer, which has to be iterated. In this paper, we investigate the possibility of using generic techniques in cases where only specific techniques have been exploited so far. Finding that existing generic techniques are often not applicable in cases easily handled by specific techniques, we have developed a new approach to iterating transducers. This new approach builds on earlier work, but exploits a number of new conceptual and algorithmic ideas, often induced with the help of experiments, that give it a broad scope, as well as good performances.

show abstract

“…Intuitively, the automaton minimization algorithm performs like a simplification procedure for FO (R, Z, +, ≤). In particular arithmetic automata are adapted to the symbolic model checking approach computing inductively reachability sets of systems manipulating counters [BLP06] and/or clocks [BH06]. In practice algorithms for effectively computing an arithmetic automaton encoding the solutions of formulas in FO (R, Z, +, ≤) have been recently successfully implemented in tools Lash and Lira [BDEK07].…”

Section: Introductionmentioning

confidence: 99%

Convex Hull of Arithmetic Automata

Leroux¹

2008

Static Analysis

View full text Add to dashboard Cite

Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints combining both integral and real variables. In this paper, the closed convex hull of arithmetic automata is proved rational polyhedral. Moreover an algorithm computing the linear constraints defining these convex set is provided. Such an algorithm is useful for effectively extracting geometrical properties of the whole set of solutions of complex constraints symbolically represented by arithmetic automata.

show abstract

The Power of Hybrid Acceleration

Cited by 17 publications

References 15 publications

Domain-specific regular acceleration

Domain-specific regular acceleration

On (Omega-)regular model checking

Convex Hull of Arithmetic Automata

Contact Info

Product

Resources

About