Translation of Semi-extended Regular Expressions Using Derivatives

Download PDF
Open Webpage

Antoine Martin, Etienne Renault, Alexandre Duret-Lutz

Published: 01 Jan 2024, Last Modified: 15 Nov 2025CIAA 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We generalize Antimirov’s notion of linear form of a regular expression, to the Semi-Extended Regular Expressions typically used in the Property Specification Language or SystemVerilog Assertions. Doing so requires extending the construction to handle more operators, and dealing with expressions over alphabets \(\varSigma =2^ AP \) of valuations of atomic propositions. Using linear forms to construct automata labeled by Boolean expressions suggests heuristics that we evaluate. Finally, we study a variant of this translation to automata with accepting transitions: this construction is more natural and provides smaller automata.