| Analyzing the capabilities of the CAN attacker S Fröschle, A Stühring Computer Security–ESORICS 2017: 22nd European Symposium on Research in …, 2017 | 49 | 2017 |
| Analysing PKCS# 11 key management APIs with unbounded fresh data S Fröschle, G Steel Joint Workshop on Automated Reasoning for Security Protocol Analysis and …, 2009 | 48 | 2009 |
| On plain and hereditary history-preserving bisimulation SB Fröschle, TT Hildebrandt International Symposium on Mathematical Foundations of Computer Science, 354-365, 1999 | 43 | 1999 |
| Independence-friendly modal logic and true concurrency JC Bradfield, SB Fröschle Nordic Journal of Computing 9 (2), 102-117, 2002 | 42 | 2002 |
| Requirements for e-navigation architectures A Hahn, A Bolles, M Fränzle, S Fröschle, JH Park International Journal of e-Navigation and Maritime Economy 5, 1-20, 2016 | 24 | 2016 |
| Decidability of plain and hereditary history-preserving bisimilarity for BPP S Fröschle Electronic notes in theoretical computer science 27, 85-106, 1999 | 23 | 1999 |
| Decidability and coincidence of equivalences for concurrency SB Fröschle University of Edinburgh, 2004 | 19 | 2004 |
| Integrating the security aspect into design space exploration of embedded systems I Stierand, S Malipatlolla, S Fröschle, A Stühring, S Henkler 2014 IEEE International Symposium on Software Reliability Engineering …, 2014 | 18 | 2014 |
| Misbehavior detection system in VANETs using local traffic density J Zacharias, S Fröschle 2018 IEEE Vehicular Networking Conference (VNC), 1-4, 2018 | 16 | 2018 |
| The insecurity problem: Tackling unbounded data S Froschle 20th IEEE Computer Security Foundations Symposium (CSF'07), 370-384, 2007 | 16 | 2007 |
| Reasoning with past to prove PKCS# 11 keys secure S Fröschle, N Sommer International Workshop on Formal Aspects in Security and Trust, 96-110, 2010 | 15 | 2010 |
| Leakiness is decidable for well-founded protocols S Fröschle International Conference on Principles of Security and Trust, 176-195, 2015 | 14 | 2015 |
| Normed processes, unique decomposition, and complexity of bisimulation equivalences S Fröschle, S Lasota Electronic notes in theoretical computer science 239, 17-42, 2009 | 13 | 2009 |
| Decomposition and complexity of hereditary history preserving bisimulation on BPP S Fröschle, S Lasota International Conference on Concurrency Theory, 263-277, 2005 | 13 | 2005 |
| Composition and decomposition in true-concurrency S Fröschle International Conference on Foundations of Software Science and Computation …, 2005 | 13 | 2005 |
| Non-interleaving bisimulation equivalences on basic parallel processes S Fröschle, P Jančar, S Lasota, Z Sawa Information and computation 208 (1), 42-62, 2010 | 12 | 2010 |
| Concepts and proofs for configuring PKCS# 11 S Fröschle, N Sommer International Workshop on Formal Aspects in Security and Trust, 131-147, 2011 | 10 | 2011 |
| Partially-commutative context-free processes W Czerwiński, S Fröschle, S Lasota International Conference on Concurrency Theory, 259-273, 2009 | 10 | 2009 |
| The decidability border of hereditary history preserving bisimilarity SB Fröschle Information processing letters 93 (6), 289-293, 2005 | 10 | 2005 |
| Adding branching to the strand space model S Fröschle Electronic notes in theoretical computer science 242 (1), 139-159, 2009 | 9 | 2009 |
