A Rocq-mechanized semantics for JavaScript regex with backtracking, proven equivalent to an ECMAScript embedding, then used to verify contextual equivalence of rewrites and to prove correctness of the PikeVM algorithm.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
TSseek approximates time series as line segments and regex queries as bounding rectangles, then uses a distributed spatial index (TSseek-X) to support efficient exact whole-matching and subsequence-matching queries.
citing papers explorer
-
Formal Verification for JavaScript Regular Expressions: a Proven Semantics and its Applications (Extended Version)
A Rocq-mechanized semantics for JavaScript regex with backtracking, proven equivalent to an ECMAScript embedding, then used to verify contextual equivalence of rewrites and to prove correctness of the PikeVM algorithm.
-
TSseek: Regular Expression-Based Similarity Search for Distributed Time Series Datasets
TSseek approximates time series as line segments and regex queries as bounding rectangles, then uses a distributed spatial index (TSseek-X) to support efficient exact whole-matching and subsequence-matching queries.