I work as an RA on the Pro.Platz project at the LMU Munich.
Past activities:
- 2001–2005 PhD at LFCS, Edinburgh, supervised by Ian Stark
- 2000–2001 MSc at LFCS, Edinburgh, supervised by Alex Simpson
- 1996–2000 Informatics studies at the University of Leipzig
Publications, Slides, Drafts
- Pure Pointer Programs with Iteration
- With Martin Hofmann.
- In Computer Science Logic, CSL08, Bertinoro, Italy, to appear
- Stratified Bounded Affine Logic for Logarithmic Space
- In Logic in Computer Science, LICS07, Wroclaw, Poland
- Draft full version, comments welcome!
- Slides: LICS07 (July 2007)
- Space-efficient Computation by Interaction – A Type System for Logarithmic Space
- In Computer Science Logic, CSL06, Szeged, Hungary, LNCS 4207, 2006, © Springer-Verlag
- Slides: CSL06 (September 2006)
- Modelling Generic Judgements
- In International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, LFMTP06, Seattle, USA, 2006, Appears in ENTCS 174(5), 2007
- Slides: LFMTP06 (August 2006)
- Names and Binding in Type Theory
- PhD Thesis, The University of Edinburgh, 2006
- Slides: ICMS07 (May 2007)
- A Dependent Type Theory with Names and Binding
- With Ian Stark.
- In Computer Science Logic, CSL04, Karpacz, Poland, LNCS, 3210, pages 235–249, 2004
- Slides: CSL04 (September 2004), Logic and Semantics Club at LFCS (August 2004)
- Verifying Temporal Properties using Explicit Approximants: Completeness for Context-free Processes. (Older version with outline proofs)
- With Alex Simpson.
- In Proceedings of Foundations of Software Science and Computation Structures, FOSSACS02, Grenoble, France, LNCS, 2303, pages 372–386, 2002, © Springer-Verlag
- Slides: FoSSaCS02 (April 2002), Logic and Semantics Club at LFCS (February 2002)
- Formal Verification of Processes
- MSc thesis, The University of Edinburgh, 2001