C. Röckl.
Proof tableaux for basic parallel processes.
Technical report, TU München, Dept. of Computer Science, 1995.
Term project. [gzipped Postscript ] [software ] [Abstract]

C. Röckl.
Charakterisierung von Halbordnungssemantiken durch Beweissysteme.
Master's thesis, TU München, Dept. of Computer Science, 1996.
In German. [gzipped Postscript ] [Abstract]

C. Röckl.
How to make substitution preserve strong bisimilarity.
SFB-Bericht 342/11/97, TU München, Dept. of Computer Science, 1997. [gzipped Postscript ] [Abstract]

C. Röckl.
First-order proofs for higher-order languages.
In Proc. of FBT'99, pages 193-202. Utz, 1999. [gzipped Postscript ] [Abstract]

C. Röckl.
Proving write invalidate cache coherence with bisimulations in Isabelle/HOL.
In Proc. of FBT'00, pages 69-78. Shaker, 2000. [gzipped Postscript ] [Abstract]

C. Röckl and J. Esparza.
Proof-checking protocols using bisimulations.
In J. C. M. Baeten and S. Mauw, editors, Proc. of CONCUR'99, number 1664 in Lecture Notes in Computer Science, pages 525-540. Springer-Verlag, 1999. [gzipped Postscript ] [Abstract]

C. Röckl and J. Esparza.
On the mechanized verification of infinite systems.
In A. Bode and T. Ludwig, editors, Proc. SFB 342 Final Colloquium, pages 31-52. Technische Universität München, 2000.
Published as Technical Report. [gzipped Postscript ]

C. Röckl, D. Hirschkoff, and S. Berghofer.
Higher-order abstract syntax with induction in isabelle/hol: Formalizing the -calculus and mechanizing the theory of contexts.
In F. Honsell and M. Miculan, editors, Proc. of FOSSACS'01. Springer-Verlag, 2001.
To appear. [gzipped Postscript ]

C. Röckl and D. Sangiorgi.
A -calculus process semantics of concurrent idealised ALGOL.
In Proc. of FOSSACS'99, number 1578 in Lecture Notes in Computer Science, pages 306-321. Springer-Verlag, 1999. [gzipped Postscript ] [Abstract]