Testing Extended Regular Language Membership Incrementally by Rewriting (2003)
by
Grigore Ro
,
Mahesh Viswanathan
| Venue: | In Rewriting Techniques and Applications, Lecture Notes in Computer Science 2706 |
| Citations: | 3 - 1 self |
BibTeX
@INPROCEEDINGS{Ro03testingextended,
author = {Grigore Ro and Mahesh Viswanathan},
title = {Testing Extended Regular Language Membership Incrementally by Rewriting},
booktitle = {In Rewriting Techniques and Applications, Lecture Notes in Computer Science 2706},
year = {2003},
pages = {499--514},
publisher = {SpringerVerlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
1 Introduction Regular expressions represent a compact and useful technique to specify pat-terns in strings. There are programming and/or scripting languages, such as Perl, which are mostly based on efficient implementations of pattern matchingvia regular expressions. Extended regular expressions (ERA), which add complementation (~R) to the usual union (R1 + R2), concatenation (R1 * R2), andrepetition (
Citations
| 114 | Monitoring Java programs with Java PathExplorer - Havelund, Ro¸su - 2001 |
| 49 | Partial derivatives of regular expressions and finite automaton constructions - Antimirov - 1996 |
