## Testing extended regular language membership incrementally by rewriting (2003)

Venue: | In Rewriting Techniques and Applications (RTA’03), Lecture Notes in Computer Science |

Citations: | 10 - 1 self |

### BibTeX

@INPROCEEDINGS{Viswanathan03testingextended,

author = {Mahesh Viswanathan},

title = {Testing extended regular language membership incrementally by rewriting},

booktitle = {In Rewriting Techniques and Applications (RTA’03), Lecture Notes in Computer Science},

year = {2003},

pages = {499--514},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. In this paper we present lower bounds and rewriting algorithms for testing membership of a word in a regular language described by an extended regular expression. Motivated by intuitions from monitoring and testing, where the words to be tested (execution traces) are typically much longer than the size of the regular expressions (patterns or requirements), and by the fact that in many applications the traces are only available incrementally, on an event by event basis, our algorithms are based on an event-consumption idea: a just arrived event is “consumed ” by the regular expression, i.e., the regular expression modifies itself into another expression discarding the event. We present an exponential space lower bound for monitoring extended regular expressions and argue that the presented rewriting-based algorithms, besides their simplicity and elegance, are practical and almost as good as one can hope. We experimented with and evaluated our algorithms in Maude. 1

### Citations

174 | Maude: Specification and programming in rewriting logic
- Clavel, Durán, et al.
- 2002
(Show Context)
Citation Context ...algorithm based on rewriting, when applied to expressions not containing any negation, use space O(m 2 ) and time O(n · m 2 ). 4 Implementation, Evaluation and Conclusion We have implemented in Maude =-=[4]-=- several improved versions of the rewritingbased algorithm in Section 3. In this section we present an implementation which worked best on our test suits. Space/time analysis seems hard to do rigorous... |

127 |
Monitoring Java Programs with Java PathExplorer
- Havelund, Ro¸su
- 2001
(Show Context)
Citation Context ... safety requirements, using an interval past time temporal logic at its core. In [21, 20] various algorithms to generate testing automata from temporal logic formulae are described. Java PathExplorer =-=[7]-=- is a runtime verification environment under current development at NASA Ames, whose logical monitoring part consists of checking execution traces against formulae expressed in both future time and pa... |

88 |
The temporal rover and the ATG rover
- Drusinsky
- 2000
(Show Context)
Citation Context ...ally preferred. There has been some interest manifested recently in the software analysis community in using temporal logics in testing [9, 10]. The Temporal Rover tools(TR) and its follower DB Rover =-=[5]-=- are already commercial; they are based on the idea of extending or instrumenting Java programs to enforce checking their execution trace against formulae expressed in temporal logics. The MaC tool [1... |

61 | Automata-based verification of temporal properties on running programs
- Giannakopoulou, Havelund
(Show Context)
Citation Context ...n environment under current development at NASA Ames, whose logical monitoring part consists of checking execution traces against formulae expressed in both future time and past time temporal logics. =-=[6, 8]-=- present efficient algorithms for monitoring future time linear temporal logic formulae, while [11] gives a method to synthesize efficient monitors from past time temporal formulae. An interesting asp... |

60 | Partial derivates of regular expressions and finite automata constructions
- Antimirov
- 1995
(Show Context)
Citation Context ...er extended regular expression, denoted R{a}, with the property that for any trace w, aw ∈ R if and only if w ∈ R{a}. The ERE R{a} is also known as a ”derivative” of ”residual” in the literature (see =-=[2, 1]-=-, where several interesting properties of derivatives are also presented). The intuition here is that in order to incrementally test for membership of an incoming sequence of events to a given ERE, on... |

57 |
Monitoring programs using rewriting
- Havelund, Rosu
- 2001
(Show Context)
Citation Context ...n environment under current development at NASA Ames, whose logical monitoring part consists of checking execution traces against formulae expressed in both future time and past time temporal logics. =-=[6, 8]-=- present efficient algorithms for monitoring future time linear temporal logic formulae, while [11] gives a method to synthesize efficient monitors from past time temporal formulae. An interesting asp... |

19 | P.D.: Rewriting extended regular expressions
- Antimirov, Mosses
- 1995
(Show Context)
Citation Context ...er extended regular expression, denoted R{a}, with the property that for any trace w, aw ∈ R if and only if w ∈ R{a}. The ERE R{a} is also known as a ”derivative” of ”residual” in the literature (see =-=[2, 1]-=-, where several interesting properties of derivatives are also presented). The intuition here is that in order to incrementally test for membership of an incoming sequence of events to a given ERE, on... |

1 |
Runtime Verification 2001, volume 55 of Electronic
- Havelund, Ro¸su
(Show Context)
Citation Context ...ore the execution trace or equivalent size information are typically preferred. There has been some interest manifested recently in the software analysis community in using temporal logics in testing =-=[9, 10]-=-. The Temporal Rover tools(TR) and its follower DB Rover [5] are already commercial; they are based on the idea of extending or instrumenting Java programs to enforce checking their execution trace ag... |