1 citations · 2 across the 3 of their papers we have counts for
14 papers
GKAT with Hoare Hypotheses
Jurriaan Rot, Todd Schmid, Jana Wagemaker
Guarded Kleene Algebra with Tests (GKAT) is a variant of Kleene algebra which allows for reasoning about simple imperative programs, and which features a decision procedure for pro…
Incremental Fingerprinting in an Open World
Loes Kruger, Paul Kobialka, Andrea Pferscher +3
Network protocol fingerprinting is used to identify a protocol implementation by analyzing its input-output behavior. Traditionally, fingerprinting operates under a closed-world as…
Correct and Complete Symbolic Execution for Free
Erik Voogd, Einar Broch Johnsen, à smund Aqissiaq Arild Kløvstad +2
Symbolic execution is a powerful technique for program analysis. However, the formal semantics underlying symbolic execution is often developed on an ad-hoc basis and decoupled fro…
Learning Automata with Name Allocation
Florian Frank, Stefan Milius, Jurriaan Rot +1
Automata over infinite alphabets have emerged as a convenient computational model for processing structures involving data, such as nonces in cryptographic protocols or data values…
Error-awareness Accelerates Active Automata Learning
Loes Kruger, Sebastian Junges, Jurriaan Rot
Active automata learning (AAL) algorithms can learn a behavioral model of a system from interacting with it. The primary challenge remains scaling to larger models, in particular i…
Trees in Coalgebra from Generalized Reachability
Thorsten WiÃmann, Bálint Kocsis, Jurriaan Rot +1
An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property o…