40 citations · 156 across the 43 of their papers we have counts for
51 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…
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…
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…
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…
Initial Algebra Correspondence under Reachability Conditions
Mayuko Kori, Kazuki Watanabe, Jurriaan Rot
Suitable reachability conditions can make two different fixed point semantics of a transition system coincide. For instance, the total and partial expected reward semantics on Mark…
Constructing Witnesses for Lower Bounds on Behavioural Distances
Ruben Turkenburg, Harsh Beohar, Franck van Breugel +2
Behavioural distances provide a robust alternative to notions of equivalence such as bisimilarity in the context of probabilistic transition systems. They can be defined as least f…