Dipl.-Inform. Michael Kirsten

Researcher / PhD Student

Room 228, Building 50.34
Phone:
Fax:
Email:
+ 49 721 608 45648
+ 49 721 608 44021
kirsten1439967719Xfd4∂kit.edu

PGP/GPG: Encrypted and signed emails are strongly encouraged.

Key:
Fingerprint:
0xFDD82850
76CF 2BCA 6D06 FFD9 4731 36FD 35B9 789A FDD8 2850

KIT  /  Institute of Theoretical Informatics (ITI)

Am Fasanengarten 5
Building 50.34
76131 Karlsruhe
Germany

Dipl.-Inform. Michael Kirsten KIT + 49 721 608 43856 + 49 721 608 44021 Michael Kirsten

Research Interests

  • Formalisation and verification of axiomatic/declarative properties for:
    • Analysis of social choice mechanisms (in the broader sense), in particular voting rules
    • (Static) program analysis for information-flow properties
  • Software (bounded) model checking
  • Deductive program verification

Projects

  • The main goal of the project LehreForschung-PLUS is to improve the study conditions and to continuously raise the qualitiy of teaching by an extensive development of the curricula for bachelor and master students.

    Our subproject comprises three primary actions, which all aim to implement and strengthen project- and research-oriented, as well as interdisciplinary, teaching in the computer science curricula.

    These comprise the further development and improvement of the project- and research-oriented master module "Research Practice", the project-oriented bachelor module "Software Engineering Practice", as well as introducing the interdisciplinary and research-oriented master profile "Internet and Society".

    LehreForschung-PLUS

  • Voting schemes, as a method to combine individual preferences to an aggregated election result, are part of the fundamental democratic principles. It is thus vital that voting schemes are working as intended. Existing voting schemes have shown undesired and sometimes surprising properties (e.g., negative voting weights in federal elections in Germany) — for more complicated, newly designed voting schemes which become possible due to computer assistance in the vote counting process, these issues are likely to emerge as well.

    The goal of this project is to develop formal verification techniques which allow to check properties of voting schemes without the huge overhead of user interaction needed in full functional verification. The resulting methodology could then be used in an iterative design and implementation process of new voting schemes.

    COST Action IC1205

  • In recent years tremendous progress has been achieved in formal verification of functional properties of computer programs. At the same time seminal papers have been published showing that it is in principle possible to formulate information-flow problems as proof obligations in program logics. The overall goal of the project is to leverage these advances together with our own experience in formal methods for functional properties in order to specify and verify security properties.

    DeduSec Project
    (part of the DFG Priority Programme 1496 Reliably Secure Software Systems – RS³ )
  • The KeY System is a formal software development tool that aims to integrate design, implementation, formal specification, and formal verification of object-oriented software as seamlessly as possible. At the core of the system is a novel theorem prover for the first-order Dynamic Logic for Java with a user-friendly graphical interface.

    The project was started in November 1998 at the University of Karlsruhe. It is now a joint project of KIT, Chalmers University of Technology, Gothenburg, and TU Darmstadt. The KeY tool is available for download.

    KeY Project

Tools

  • BEAST - Automated Election Verification via Bounded Model Checking
  • CombinedApproach - Automatic and Precise Noninterference Verification of Java Programs
  • KeY - Integrated Deductive Software Design

Teaching

Publications (grouped by categories)

Articles
Title Author(s) Source
A Hybrid Approach for Proving Noninterference of Java ProgramsRalf Küsters, Tomasz Truderung, Bernhard Beckert, Daniel Bruns, Michael Kirsten, and Martin MohrIACR Cryptology ePrint Archive 2015(438)
Conference and Workshop Papers
Title Author(s) Source
Formal Fairness Properties in Network Routing Based on a Resource Allocation ModelAlmut Demel and Michael Kirsten9th Workshop on Logical Aspects of Multi-Agent Systems (LAMAS 2017) affiliated with CSL 2017: the 26th EACSL Annual Conference on Computer Science Logic
Generalized Test Tables: A Powerful and Intuitive Specification Language for Reactive SystemsAlexander Weigl, Franziska Wiebe, Mattias Ulbrich, Sebastian Ulewicz, Suhyun Cha, Michael Kirsten, Bernhard Beckert, and Birgit Vogel‑Heuser15th IEEE International Conference on Industrial Informatics (INDIN 2017)
Combining Graph-Based and Deduction-Based Information-Flow AnalysisBernhard Beckert, Simon Bischof, Mihai Herda, Michael Kirsten, and Marko Kleine Büning5th Workshop on Hot Issues in Security Principles and Trust (HotSpot 2017) affiliated with ETAPS 2017: European Joint Conferences on Theory and Practice of Software
Automatic Margin Computation for Risk-Limiting AuditsBernhard Beckert, Michael Kirsten, Vladimir Klebanov, and Carsten SchürmannFirst International Joint Conference on Electronic Voting – formerly known as EVOTE and VoteID (E-Vote-ID 2016)
A Verification-Supported Evolution Approach to Assist Software Application Engineers in Industrial Factory AutomationSebastian Ulewicz, Mattias Ulbrich, Alexander Weigl, Michael Kirsten, Franziska Wiebe, Bernhard Beckert, and Birgit Vogel‑HeuserIEEE International Symposium on Assembly and Manufacturing (ISAM 2016)
Automated Verification for Functional and Relational Properties of Voting RulesBernhard Beckert, Thorsten Bormer, Michael Kirsten, Till Neuber, and Mattias UlbrichSixth International Workshop on Computational Social Choice (COMSOC 2016)
A Hybrid Approach for Proving Noninterference of Java ProgramsRalf Küsters, Tomasz Truderung, Bernhard Beckert, Daniel Bruns, Michael Kirsten, and Martin Mohr28th IEEE Computer Security Foundations Symposium (CSF 2015)
Reasoning About Vote Counting Schemes Using Light-Weight and Heavy-Weight MethodsBernhard Beckert, Thorsten Bormer, Rajeev Goré, Michael Kirsten, and Thomas Meumann8th International Verification Workshop (VERIFY 2014) in connection with IJCAR 2014: International Joint Conference on Automated Reasoning
Book Chapters
Title Author(s) Source
An Introduction to Voting Rule VerificationBernhard Beckert, Thorsten Bormer, Rajeev Goré, Michael Kirsten, and Carsten SchürmannTrends in Computational Social Choice, Part II: Techniques
Workshop Contributions, Position Papers, Technical Reports
Title Author(s) Source
RIFL 1.1: A Common Specification Language for Information-Flow RequirementsThomas Bauereiß, Simon Greiner, Mihai Herda, Michael Kirsten, Ximeng Li, Heiko Mantel, Martin Mohr, Matthias Perner, David Schneider, and Markus TaschTU Darmstadt TUD-CS-2017-0225
Theses
Title Author(s) Source
Formal Verification of Voting SchemesMichael KirstenITI Beckert, Karlsruhe Institute of Technology (December 2014)
Proving Well-Definedness of JML Specifications with KeYMichael KirstenITI Schmitt, Karlsruhe Institute of Technology (November 2013)

Supervised Projects and Theses