10 citations · 37 across the 17 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2024★ 1 cited
Efficient Matching with Memoization for Regexes with Look-around and Atomic Grouping (Extended Version)
Hiroya Fujinami, Ichiro Hasuo
Regular expression (regex) matching is fundamental in many applications, especially in web services. However, matching by backtracking -- preferred by most real-world implementatio…
cs.PL2018
Ranking and Repulsing Supermartingales for Reachability in Probabilistic Programs
Toru Takisaka, Yuichiro Oyabu, Natsuki Urabe +1
Computing reachability probabilities is a fundamental problem in the analysis of probabilistic programs. This paper aims at a comprehensive and comparative account on various marti…