9 citations · 13 across the 4 of their papers we have counts for
5 papers
Type-Directed Discretization of Probabilistic Programs (Extended Version)
Katherine Wu, Jules Jacobs, Kevin Batz +1
We study exact discretization as a semantics-preserving transformation for recursive, higher-order probabilistic programs with continuous distributions. We target programs where co…
SMT-Based Active Learning of Weighted Automata
Tiago Ferreira, Kevin Batz, Alexandra Silva
We present an SMT-based active learning algorithm for nondeterministic weighted automata (WFAs) as a practical and robust alternative to Hankel/L*-style methods. Our algorithm is p…
Weighted NetKAT: A Programming Language For Quantitative Network Verification
Emmanuel Suárez Acevedo, Tiago Ferreira, Kevin Batz +3
We introduce weighted NetKAT, a domain-specific language for modeling and verifying quantitative network properties. The language is parametric on a semiring, enabling the treatmen…
Active Learning of Symbolic NetKAT Automata
Mark Moeller, Tiago Ferreira, Thomas Lu +2
NetKAT is a domain-specific programming language and logic that has been successfully used to specify and verify the behavior of packet-switched networks. This paper develops techn…
KATch: A Fast Symbolic Verifier for NetKAT
Mark Moeller, Jules Jacobs, Olivier Savary Belanger +5
We develop new data structures and algorithms for checking verification queries in NetKAT, a domain-specific language for specifying the behavior of network data planes. Our result…