Provably Correct Compiler Development and Implementation. - Bettina Buth; Karl-Heinz Buth; Martin Fränzle; Burghard von Karger; Yassine Lakhnech; Hans Langmaack; Markus Müller-Olm (CC, 1992)

Plotkin, Hoare and Smyth Order: On Observational Models for CSP. - Burghard von Karger (PROCOMET, 1994)

Formal Derivation of CSP Programs From Temporal Specifications. - Rudolf Berghammer; Burghard von Karger (MPC, 1995)

An Algebraic Approach to Temporal Logic. - Burghard von Karger (TAPSOFT, 1995)

Sequential Calculus. - Burghard von Karger; C. A. R. Hoare (Inf. Process. Lett., 1995)

Realtion-Algebraic Analysis of Petri Nets with RELVIEW. - Rudolf Berghammer; Burghard von Karger; Christiane Ulke (TACAS, 1996)

Towards a Design Calculus for CSP. - Rudolf Berghammer; Burghard von Karger (Sci. Comput. Program., 1996)

Relational Semantics of Functional Programs. - Rudolf Berghammer; Burghard von Karger (Relational Methods in Computer Science, 1997)

Algorithms from Relational Specifications. - Rudolf Berghammer; Burghard von Karger (Relational Methods in Computer Science, 1997)

Computing Kernels in Bicromatic Directed Relations (Abstract). - Rudolf Berghammer; Burghard von Karger (RelMiCS, 1997)

Computing Kernels in Directed Bichromatic Graphs. - Burghard von Karger; Rudolf Berghammer (Inf. Process. Lett., 1997)

Computation calculus = sequential calculus + discreteness and termination. - Burghard von Karger (RelMiCS, 1998)

Relation-Algebraic Derivation of Spanning Tree Algorithms. - Rudolf Berghammer; Burghard von Karger; Andreas Wolf 004 (MPC, 1998)

A Proof Rule for Control Loops. - Burghard von Karger (MPC, 1998)

On the Union of Well-Founded Relations. - Henk Doornbos; Burghard von Karger (Log. J. IGPL, 1998)

A Relational Model for Temporal Logic. - Burghard von Karger; Rudolf Berghammer (Log. J. IGPL, 1998)

Temporal Algebra. - Burghard von Karger (Math. Struct. Comput. Sci., 1998)

A calculational approach to reactive systems. - Burghard von Karger (Sci. Comput. Program., 2000)