Regular-expression derivatives re-examined

Owens, Scott; Reppy, John; Turon, Aaron

doi:10.1017/s0956796808007090

Cited by 102 publications

(77 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the online algorithm [15], built upon derivatives of regular expressions [12,13], we extensively use the rewriting functionality when deriving an expression with respect to a newly observed segment. The offline algorithm [14] is a recursive computation over the syntax tree of the expression; therefore, the role of Pure's rewriting engine is minimal.…”

Section: Tool Descriptionmentioning

confidence: 99%

Montre: A Tool for Monitoring Timed Regular Expressions

Ulus

2017

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. We present Montre, a monitoring tool to search patterns specified by timed regular expressions over real-time behaviors. We use timed regular expressions as a compact, natural, and highly-expressive pattern specification language for monitoring applications involving quantitative timing constraints. Our tool essentially incorporates online and offline timed pattern matching algorithms so it is capable of finding all occurrences of a given pattern over both logged and streaming behaviors. Furthermore, Montre is designed to work with other tools via standard interfaces to perform more complex and versatile tasks for analyzing and reasoning about cyber-physical systems. As the first of its kind, we believe Montre will enable a new line of inquiries and techniques in these fields.

show abstract

Section: Tool Descriptionmentioning

confidence: 99%

Montre: A Tool for Monitoring Timed Regular Expressions

Ulus

2017

Computer Aided Verification

View full text Add to dashboard Cite

show abstract

“…The smaller the automaton, the better. Therefore, it is natural to be eager at simplifying the expressions, and apply all the possible transformations that help reducing the size of the automaton [22]. Yet we chose relatively few identities: basically, those of Definition 3 are about the constants (0, 1, 0 K , 1 K ).…”

Section: Identities On Expressionsmentioning

confidence: 99%

Derived-Term Automata of Multitape Expressions with Composition

Demaille¹

2017

SACS

View full text Add to dashboard Cite

Rational expressions are powerful tools to define automata, but often restricted to single-tape automata. Our goal is to unleash their expressive power for transducers, and more generally, any multitape automaton; for instance (a + |x+b + |y) * . We generalize the construction of the derived-term automaton by using expansions. This approach generates small automata, and even allows us to support a composition operator.

show abstract

“…Since Kleene star and sequencing may invoke their arguments multiple times, dependent sequences embedded in them will be duplicated for each successful match of the pattern. This approach is similar to regular expression derivatives [9,38].…”

Section: Compilation Correctnessmentioning

confidence: 99%

Temporal higher-order contracts

2011

View full text Add to dashboard Cite

Behavioral contracts are embraced by software engineers because they document module interfaces, detect interface violations, and help identify faulty modules (packages, classes, functions, etc). This paper extends prior higher-order contract systems to also express and enforce temporal properties, which are common in software systems with imperative state, but which are mostly left implicit or are at best informally specified. The paper presents both a programmatic contract API as well as a temporal contract language, and reports on experience and performance results from implementing these contracts in Racket.Our development formalizes module behavior as a trace of events such as function calls and returns. Our contract system provides both non-interference (where contracts cannot influence correct executions) and also a notion of completeness (where contracts can enforce any decidable, prefix-closed predicate on event traces). Categories and Subject Descriptors Contract ExpressivenessLarge software systems typically consist of many modules (e.g., packages, classes, functions) produced by different development teams. When the system fails, an initial difficulty is fault localization: identifying the module that failed to perform as expected. Undocumented module interfaces are problematic for various reasons, not least because they lead to disagreements about which module is considered "at fault" and should be fixed.Software engineers embrace behavioral contracts because they address many of these problems. In particular, behavioral contracts provide a mechanism to explicitly document each module's assumptions and guarantees; to dynamically detect contract violations; and to identify faulty modules. Behavioral contracts are widely used in procedural, object-oriented, and functional languages, including Eiffel [36] Existing contract systems can express a range of interface specifications. Below, we consider a range of possible specifications for Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. 2. The argument function cmp in turn requires two arguments, both positive integers. This higher-order precondition constrains how the sort module can call the function argument cmp, and so is a guarantee provided by sort rather than an obligation on the client. Higherorder contract systems [19,15,22,24,45] support such preconditions by wrapping the cmp argument to enforce this property dynamically.3. The sort function is not re-entrant-it can only be called after all previous sort invocations have completed.Unlike the previous contracts that constrain how functions may be called, this temporal contract constrains when sort can be called [12,13]. This constra...

show abstract

Regular-expression derivatives re-examined

Cited by 102 publications

References 9 publications

Montre: A Tool for Monitoring Timed Regular Expressions

Montre: A Tool for Monitoring Timed Regular Expressions

Derived-Term Automata of Multitape Expressions with Composition

Temporal higher-order contracts

Contact Info

Product

Resources

About