2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.PL2025
StacKAT: Infinite State Network Verification
Jules Jacobs, Nate Foster, Tobias Kappé +4
We develop StacKAT, a network verification language featuring loops, finite state variables, nondeterminism, and - most importantly - access to a stack with accompanying push and p…
cs.LO2023★ 2 cited
A Completeness Theorem for Probabilistic Regular Expressions
Wojciech Różowski, Alexandra Silva
We introduce Probabilistic Regular Expressions (PRE), a probabilistic analogue of regular expressions denoting probabilistic languages in which every word is assigned a probability…