Sciweavers

206 search results - page 22 / 42
» Deterministic Caterpillar Expressions
Sort
View
ENTCS
2006
123views more  ENTCS 2006»
13 years 10 months ago
From Discrete Duration Calculus to Symbolic Automata
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
Laure Gonnord, Nicolas Halbwachs, Pascal Raymond
WCRE
2003
IEEE
14 years 3 months ago
RegReg: a Lightweight Generator of Robust Parsers for Irregular Languages
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
Mario Latendresse
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 10 months ago
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...
Bernard Boigelot, Julien Brusten, Véronique...
EDBT
2009
ACM
133views Database» more  EDBT 2009»
14 years 2 months ago
Schema-conscious filtering of XML documents
In a publish-subscribe system based on filtering of XML documents, subscribers specify their interests with profiles expressed in the XPath language. The system processes a stre...
Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soinine...
POPL
2010
ACM
14 years 9 days ago
Programming with angelic nondeterminism
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
Rastislav Bodík, Satish Chandra, Joel Galen...