Year: 2026
Type: article
Abstract: The paper considers regular expressions with external variables for event stream processing over structured events, referred to as RE+EV (Regular Expressions with External Variables). The computational model is intended for the compact description of decisions that must be made as streaming data arrives, including filtering, classification, bounded aggregation, data cleaning, and anomaly detection. A separate auxiliary theoretical formalization of RE+EV with an explicit linear memory bound is introduced. Within this theoretical setting, a correspondence with linear-bounded automata and context-sensitive grammars is established. The practical RE+EV fragment is not identified with a linear-bounded automaton: it employs a predicate-based form of expressions, finite external storage, total guards and updates, bounded iteration, and execution over a set of active configurations without recursive backtracking. The RE+EV prototype consists of an expression parser, a compiler that translates parsed expressions into a control graph, and a specialized virtual machine for executing the control graph. Experimental evaluation of the prototype was performed on synthetic event streams in sliding-start mode and is interpreted as a limited validation of the correctness and behavior of a minimal implementation.
Author: Сараа, А.
Institution: Moscow Institute of Physics and Technology
Language: Russian
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7222856676