Weakest expressible preconditions: a new tool for proving completeness results about Hoare calculi. - Kurt Sieber (Theoretical Computer Science, 1983)

The Foundations of Program Verification, 1st ed. - Jacques Loeckx; Kurt Sieber (Wiley-Teubner, 1984)

Die "Modale Logik der Prozeduren": e. Erweiterung der Hoare-Logik, die es ermöglicht, Korrektheitsbeweise im Sinne des "stepwise refinement" zu führen. - Kurt Sieber (1984)

The Foundations of Program Verification, 2nd ed. - Jacques Loeckx; Kurt Sieber (Wiley-Teubner, 1987)

Towards Fully Abstract Semantics for Local Variables. - Albert R. Meyer; Kurt Sieber (POPL, 1988)

Relating Full Abstraction Results for Different Programming Languages. - Kurt Sieber (FSTTCS, 1990)

Call-by-Value and Nondeterminism. - Kurt Sieber (TLCA, 1993)

A Process Oriented Semantics of the PRAM-Language FORK. - Gudula Rünger; Kurt Sieber (Comput. Lang., 1994)

Full Abstraction for the Second Order Subset of an Algol-Like Language. - Kurt Sieber (Theor. Comput. Sci., 1996)

Preface. - Kurt Sieber (J. Log. Algebraic Methods Program., 2010)

Optimal top dag compression. - Markus Lohrey; Carl Philipp Reh; Kurt Sieber (CoRR, 2017)

Size-optimal top dag compression. - Markus Lohrey; Carl Philipp Reh; Kurt Sieber (Inf. Process. Lett., 2019)

Navigating Forest Straight-Line Programs in Constant Time. - Carl Philipp Reh; Kurt Sieber (SPIRE, 2020)

Grammar-Based Compression of Unranked Trees. - Adrià Gascón; Markus Lohrey; Sebastian Maneth; Carl Philipp Reh; Kurt Sieber (Theory Comput. Syst., 2020)