Univ.-Prof. Dr. Johannes Kinder

CODE
Building Carl-Wery-Str. 22, Room 1721
+49 89 6004 7335
johannes.kinder@unibw.de

Univ.-Prof. Dr. Johannes Kinder

Short Biography

Prof. Dr. Johannes Kinder was appointed Professor for Computer Systems Hardening at Bundeswehr University Munich on January 1st, 2019. He heads the PATCH lab for Program Analysis, Transformation, Comprehension and Hardening and is a member of the Research Institute CODE and the Institute for Systems Security at the Department of Computer Science.

In his research, he works on the automatic hardening of applications and systems using static and dynamic program analysis. He focuses on the detection of software vulnerabilities and malware, and on instrumenting software to prevent exploitation. Hailing from a background in formal methods, he enjoys applying well-founded theory to concrete problems in systems security.

Before joining Bundeswehr University Munich, Johannes Kinder was Professor of Computer Science at Royal Holloway, University of London, where he had been leading a research group for five years. After graduating with a Diplom from Technische Universität München in 2005, he earned his doctorate at Technische Universität Darmstadt. During this time, he also was a visiting scholar at the University of Wisconsin in Madison and an intern at Microsoft Research, Redmond. From 2011 until moving to London, he was a postdoctoral researcher at École Polytechnique Fédérale de Lausanne (EPFL).

Conference and Workshop Organization

Program Committee Memberships

Selected Publications

A list of all publications can be found here or on DBLP and Google Scholar.

[1] Daniel Lehmann, Johannes Kinder, and Michael Pradel. Everything Old is New Again: Binary Security of WebAssembly. In 29th USENIX Security Symposium (USENIX Security), pp. 217–234, USENIX Association, 2020. BibTeX PDF
@inproceedings{usenixsecurity20-wasm,
    author = {Daniel Lehmann and Johannes Kinder and Michael Pradel},
    booktitle = {29th USENIX Security Symposium (USENIX Security)},
    pages = {217--234},
    publisher = {USENIX Association},
    title = {Everything Old is New Again: Binary Security of WebAssembly},
    year = {2020}
}

[2] Feargus Pendlebury, Fabio Pierazzi, Roberto Jordaney, Johannes Kinder, and Lorenzo Cavallaro. TESSERACT: Eliminating Experimental Bias in Malware Classification across Space and Time. In 28th USENIX Security Symposium (USENIX Security), pp. 729–746, USENIX Association, 2019. BibTeX PDF
@inproceedings{usenixsecurity19-tesseract,
    author = {Feargus Pendlebury and Fabio Pierazzi and Roberto Jordaney and Johannes Kinder and Lorenzo Cavallaro},
    booktitle = {28th USENIX Security Symposium (USENIX Security)},
    pages = {729--746},
    publisher = {USENIX Association},
    title = {TESSERACT: Eliminating Experimental Bias in Malware Classification across Space and Time},
    year = {2019}
}

[3] Blake Loring, Duncan Mitchell, and Johannes Kinder. Sound Regular Expression Semantics for Dynamic Symbolic Execution of JavaScript. In Proc. ACM SIGPLAN Conf. Programming Language Design and Implementation (PLDI), pp. 425–438, ACM, 2019. BibTeX PDF
@inproceedings{pldi19-regex,
    author = {Blake Loring and Duncan Mitchell and Johannes Kinder},
    booktitle = {Proc. ACM SIGPLAN Conf. Programming Language Design and Implementation (PLDI)},
    pages = {425--438},
    publisher = {ACM},
    title = {Sound Regular Expression Semantics for Dynamic Symbolic Execution of JavaScript},
    year = {2019}
}

[4] Jonas Wagner, Volodymyr Kuznetsov, George Candea, and Johannes Kinder. High System-Code Security with Low Overhead. In Proc. IEEE Symp. Security and Privacy (S&P), pp. 866–879, IEEE, 2015. BibTeX PDF
@inproceedings{oakland15,
    author = {Jonas Wagner and Volodymyr Kuznetsov and George Candea and Johannes Kinder},
    booktitle = {Proc. IEEE Symp. Security and Privacy (S\&P)},
    pages = {866--879},
    publisher = {IEEE},
    title = {High System-Code Security with Low Overhead},
    year = {2015}
}

[5] Stefan Bucur, Johannes Kinder, and George Candea. Prototyping Symbolic Execution Engines for Interpreted Languages. In Proc. 19th Int. Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS), pp. 239–254, ACM, 2014. BibTeX PDF
@inproceedings{asplos14,
    author = {Stefan Bucur and Johannes Kinder and George Candea},
    booktitle = {Proc. 19th Int. Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS)},
    ee = {http://doi.acm.org/10.1145/2541940.2541977},
    pages = {239--254},
    publisher = {ACM},
    title = {Prototyping Symbolic Execution Engines for Interpreted Languages},
    year = {2014}
}

[6] Volodymyr Kuznetsov, Johannes Kinder, Stefan Bucur, and George Candea. Efficient state merging in symbolic execution. In Proc. ACM SIGPLAN Conf. Programming Language Design and Implementation (PLDI), pp. 193–204, ACM, 2012. BibTeX PDF
@inproceedings{pldi12,
    author = {Volodymyr Kuznetsov and Johannes Kinder and Stefan Bucur and George Candea},
    booktitle = {Proc. ACM SIGPLAN Conf. Programming Language Design and Implementation (PLDI)},
    pages = {193--204},
    publisher = {ACM},
    title = {Efficient state merging in symbolic execution},
    year = {2012}
}