24 citations · 25 across the 4 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2019
How to Win First-Order Safety Games
Helmut Seidl, Christian Müller, Bernd Finkbeiner
First-order (FO) transition systems have recently attracted attention for the verification of parametric systems such as network protocols, software-defined networks or multi-agent…
cs.LO2017★ 24 cited
Verifying Security Policies in Multi-agent Workflows with Loops
Bernd Finkbeiner, Christian Müller, Helmut Seidl +1
We consider the automatic verification of information flow security policies of web-based workflows, such as conference submission systems like EasyChair. Our workflow description…
cs.LO2005
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying
Helmut Seidl, Kumar Neeraj Verma
Cryptographic protocols with single blind copying were defined and modeled by Comon and Cortier using the new class of first order clauses. They showed its satisfiabil…