Proof-Checking Protocols Using Bisimulations. - Christine Röckl; Javier Esparza (CONCUR, 1999)

First-Order Proofs for Higher-Order Languages. - Christine Röckl (FBT, 1999)

A pi-calculus Process Semantics of Concurrent Idealised ALGOL. - Christine Röckl; Davide Sangiorgi (FoSSaCS, 1999)

Proving Write Invalidate Cache Coherence with Bisimulations in Isabelle/HOL. - Christine Röckl (FBT, 2000)

Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the pi-Calculus and Mechanizing the Theory of Contexts. - Christine Röckl; Daniel Hirschkoff; Stefan Berghofer (FoSSaCS, 2001)

A First-Order Syntax for the Pi-Calculus in Isabelle/HOL using Permutations. - Christine Röckl (MERLIN, 2001)

On the mechanized validation of infinite-state and parameterized reactive and mobile systems. - Christine Röckl (2001)

A Nominal Theory of Objects with Dependent Types. - Martin Odersky; Vincent Cremet; Christine Röckl; Matthias Zenger (ECOOP, 2003)

A fully adequate shallow embedding of the [pi]-calculus in Isabelle/HOL with mechanized syntax analysis. - Christine Röckl; Daniel Hirschkoff (J. Funct. Program., 2003)