| |
| 2008 | ||
|---|---|---|
| 8 | EE | Martin Hofmann, Ulrich Schöpp: Pure Pointer Programs with Iteration. CSL 2008: 79-93 |
| 7 | EE | Ulrich Schöpp: A Formalised Lower Bound on Undirected Graph Reachability. LPAR 2008: 621-635 |
| 6 | EE | Ulrich Schöpp, Martin Hofmann: Pointer Programs and Undirected Reachability. Electronic Colloquium on Computational Complexity (ECCC) 15(090): (2008) |
| 2007 | ||
| 5 | EE | Ulrich Schöpp: Stratified Bounded Affine Logic for Logarithmic Space. LICS 2007: 411-420 |
| 4 | EE | Ulrich Schöpp: Modelling Generic Judgements. Electr. Notes Theor. Comput. Sci. 174(5): 19-35 (2007) |
| 2006 | ||
| 3 | EE | Ulrich Schöpp: Space-Efficient Computation by Interaction. CSL 2006: 606-621 |
| 2004 | ||
| 2 | EE | Ulrich Schöpp, Ian Stark: A Dependent Type Theory with Names and Binding. CSL 2004: 235-249 |
| 2002 | ||
| 1 | EE | Ulrich Schöpp, Alex K. Simpson: Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes. FoSSaCS 2002: 372-386 |
| 1 | Martin Hofmann | [6] [8] |
| 2 | Alex K. Simpson (Alex Simpson) | [1] |
| 3 | Ian Stark | [2] |