 | 2012 |
| 14 |  | Andreas Lochbihler:
Java and the Java Memory Model - A Unified, Machine-Checked Formalisation.
ESOP 2012: 497-517 |
| 2011 |
| 13 |  | Andreas Lochbihler,
Lukas Bulwahn:
Animating the Formalised Semantics of a Java-Like Language.
ITP 2011: 216-232 |
| 2010 |
| 12 |  | Andreas Lochbihler:
Verifying a Compiler for Java Threads.
ESOP 2010: 427-447 |
| 11 |  | Peter Lammich,
Andreas Lochbihler:
The Isabelle Collections Framework.
ITP 2010: 339-354 |
| 10 |  | Bastian Katz,
Marcus Krug,
Andreas Lochbihler,
Ignaz Rutter,
Gregor Snelting,
Dorothea Wagner:
Gateway Decompositions for Constrained Reachability Problems.
SEA 2010: 449-461 |
| 9 |  | Andreas Lochbihler:
Coinductive.
Archive of Formal Proofs 2010: (2010) |
| 2009 |
| 8 |  | Andreas Lochbihler:
Formalising FinFuns - Generating Code for Functions as Data from Isabelle/HOL.
TPHOLs 2009: 310-326 |
| 7 |  | Andreas Lochbihler:
Code Generation for Functions as Data.
Archive of Formal Proofs 2009: (2009) |
| 6 |  | Andreas Lochbihler,
Gregor Snelting:
On temporal path conditions in dependence graphs.
Autom. Softw. Eng. 16(2): 263-290 (2009) |
| 2008 |
| 5 |  | Daniel Wasserrab,
Andreas Lochbihler:
Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL.
TPHOLs 2008: 294-309 |
| 4 |  | Kousha Etessami,
Andreas Lochbihler:
The computational complexity of evolutionarily stable strategies.
Int. J. Game Theory 37(1): 93-113 (2008) |
| 2007 |
| 3 |  | Andreas Lochbihler,
Gregor Snelting:
On Temporal Path Conditions in Dependence Graphs.
SCAM 2007: 49-58 |
| 2 |  | Andreas Lochbihler:
Jinja with Threads.
Archive of Formal Proofs 2007: (2007) |
| 2004 |
| 1 |  | Kousha Etessami,
Andreas Lochbihler:
The computational complexity of Evolutionarily Stable Strategies
Electronic Colloquium on Computational Complexity (ECCC)(055): (2004) |