Pascal Raymond. Recognizing regular expressions by means of dataflow networks. In 23rd International Colloquium on Automata, Languages, and Programming, (ICALP'96), number 1099 in LNCS. Springer, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....value of a register is always assumed to be 0. How to build a property observer from a given safety property in a given language is a separate question. Examples are IBM s FoCs tool [5] which builds observers for Sugar specifications [6] a temporal logic for Lustre [9] and regular expressions [10]. For the simple properties in the previous section, it is also easy to see how property observers for them can be constructed. # # Fig. 4. The three valued logic lattice There are a number of advantages to using property observers over general model checkers when verifying safety ....

P. Raymond. Recognizing regular expressions by means of dataflows networks. In 23rd International Colloquium on Automata, Languages, and Programming (ICALP'96), LNCS 1099. Springer Verlag, 1996.

....convert into ordinary automata [5] To guarantee efficient translation into monitor circuits, we impose a few restrictions. First, we require the expression contained within a Kleene star not to accept the empty string. Known constructions can normalize regular expressions to obey this restriction [10], but our implementation does not currently include this step. Second, we forbid non deterministic choice: we allow the choice operator, but the choices must be distinguishable within the first clock cycle. In practice, this restriction is not a problem because protocols are typically designed to ....

....passes activation signals from sub circuit to sub circuit, cor responding to possible parses of the input string by the regular expression. We will elaborate on this construction below. Our translation is similar to previous work in efficiently converting regular expressions into circuits [11, 10]. The key differences of our algorithm are building a monitor circuit, rather than a recognizer circuit, handling storage variables, and handling pipelining. The first difference is that we are interested in monitoring the on going behavior of an interface, rather than recognizing a regular ....

P. Raymond. Recognizing regular expressions by means of dataflow networks. 23rd Intl Coll on Automata, Languages, and Programming, pp. 336--347. LNCS 1099. Springer, 1996.

.... can be defined as follows: simplify (EmptyString : e) simplify e simplify (EmptyString : e) containsEmpty e = simplify e otherwise = EmptyString : simplify e simplify (Star (Star e) simplify (Star e) Another useful algorithm which can be expressed is the one presented in [20], which reduces (in linear time) a regular expression e to another one f such that the empty string does not occur in f and e # is the same language as f # . Thus, from now on, we assume that the body of a Star cannot produce the empty string. Compiling Regular Expressions into Circuits The ....

Pascal Raymond. Recognizing regular expressions by means of dataflow networks. In 23rd International Colloquium on Automata, Languages, and Programming, (ICALP'96), number 1099 in LNCS. Springer, 1996.

....observers in a more imperative style. For instance, expressing the safety property: the outputs a and b alternate is easy with a two states automaton, and a bit more difficult with a Lustre program. A language based on regular expressions has been used (via an efficient translation into Lustre [Ray96]) In this paper, we use mode automata for both the controller and the model of the environment. We could use them for describing safety properties as well. The rest of the paper is organized as follows: Section 2 is a brief introduction to data flow synchronous languages and the mode automaton ....

P. Raymond. Recognizing regular expressions by means of dataflows networks. In 23rd International Colloquium on Automata, Languages, and Programming, (ICALP'96) Paderborn, Germany. Springer Verlag, July 1996.

....a correspondence table between these boolean variables and the atomic formulae appearing in the pattern is also built. Second, the resulting regular expression is translated into an automaton whose inputs are boolean streams. For performing this translation, we chose the technique developed in [Ray96] and materialized in a tool called Reglo. This technique was chosen over classical automata generation techniques for three main reasons: ffl This technique assumes that the alphabet of the regular expression is composed of boolean variables and that the input of the generated automata is a ....

P. Raymond. Recognizing regular expressions by means of dataflows networks. In proc. of the 23rd International Colloquium on Automata, Languages, and Programming, (ICALP'96) Paderborn, Germany. LNCS 1099, Springer Verlag, July 1996.

....Moreover, the feasibility of our proposal has been validated by a prototype implementation on top of the O 2 DBMS. We are currently implementing our pattern matching operator. This implementation is based on techniques originally developed in the context of synchronous programming languages [16]. The idea behind these techniques is to translate properties expressed as regular expressions over boolean variables into an equivalent boolean dataflows network (a se quential circuit) which explores all the branches of a nondeterministic automaton whose size is proportional to that of the ....

P. Raymond. Recognizing regular expressions by means of dataflows networks. In proc. of the 23rd International Colloquium on Automata, Languages, and Programming, (ICALP'96) Paderborn, Germany. LNCS 1099, Springer Verlag, July 1996.

....implemented by a single loop program. The Esterel V4 and V5 compilers [Ber95] are based on this principle. About the compilation of synchronous imperative languages into data flow networks, let us mention also the translation of Argos [MH96] into the Dc common format (see x4.3) and the Reglo tool [Ray96] which produces recognizers (in Lustre) for regular expressions. 4.3 Common formats The Lustre, Signal, and Esterel compilers were developed in tight cooperation. In order to share common tools, and to make the languages integration easier, common formats were defined and used as intermediate ....

P. Raymond. Recognizing regular expressions by means of dataflows networks. In 23rd International Colloquium on Automata, Languages, and Programming, (ICALP'96) Paderborn, Germany. LNCS 1099, Springer Verlag, July 1996.

No context found.

P. Raymond. Recognizing regular expressions by means of dataflows networks. In 23rd International Colloquium on Automata, Languages, and Programming, (ICALP'96) Paderborn, Germany. LNCS 1099, Springer Verlag, July 1996.

.... Pascal Raymond Verimag Centre Equation, 2 rue de Vignate 38610 Gieres, France Pascal.Raymond imag.fr http: www verimag.imag.fr PEOPLE Pascal.Raymond Reglo is a compiler which translates regular expressions into sequential circuits [3]. Regular expressions are expressed in the reglo source language. Resulting circuit are described in the synchronous dataflow language Lustre [1] Contents 1 Reglo source language 1 1.1 Lexical aspects . 2 1.2 History declaration . ....

P. Raymond. Recognizing regular expressions by means of dataflows networks. In 23rd International Colloquium on Automata, Languages, and Programming, (ICALP'96) Paderborn, Germany. LNCS 1099, Springer Verlag, July 1996. 8

No context found.

Pascal Raymond. Recognizing regular expressions by means of dataflow networks. In 23rd International Colloquium on Automata, Languages, and Programming, (ICALP'96), number 1099 in LNCS. Springer, 1996.

No context found.

Pascal Raymond. Recognizing regular expressions by means of dataflow networks. In 23rd International Colloquium on Automata, Languages, and Programming, pages 336--347. Springer, 1996. Lecture Notes in Computer Science Number 1099.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC