Kurt Sieber

17 papers A* 1B 1C 1Misc 1Journal 7Unranked 3
YearRankTypeTitle / Venue / Authors
2020 J jnl
Grammar-Based Compression of Unranked Trees.
Theory Comput. Syst.
Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber
2020 C conf
Navigating Forest Straight-Line Programs in Constant Time.
SPIRE
Carl Philipp Reh, Kurt Sieber
2019 J jnl
Size-optimal top dag compression.
Inf. Process. Lett.
Markus Lohrey, Carl Philipp Reh, Kurt Sieber
2018 Misc conf
Grammar-Based Compression of Unranked Trees.
CSR
Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber
2018 J jnl
Grammar-based Compression of Unranked Trees.
CoRR
Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber
2017 J jnl
Optimal top dag compression.
CoRR
Markus Lohrey, Carl Philipp Reh, Kurt Sieber
2010 J jnl
Preface.
J. Log. Algebraic Methods Program.
Kurt Sieber
1996 J jnl
Full Abstraction for the Second Order Subset of an Algol-Like Language.
Theor. Comput. Sci.
Kurt Sieber
1994 J jnl
A Process Oriented Semantics of the PRAM-Language FORK.
Comput. Lang.
Gudula Rünger, Kurt Sieber
1994 B conf
Full Abstraction for the Second Order Subset of an Algol-Like Language.
MFCS
Kurt Sieber
1993 — conf
Call-by-Value and Nondeterminism.
TLCA
Kurt Sieber
1990 — conf
Relating Full Abstraction Results for Different Programming Languages.
FSTTCS
Kurt Sieber
1988 A* conf
Towards Fully Abstract Semantics for Local Variables.
POPL
Albert R. Meyer, Kurt Sieber
1987 — book
The Foundations of Program Verification, 2nd ed.
Jacques Loeckx, Kurt Sieber
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 — book
The Foundations of Program Verification, 1st ed.
Jacques Loeckx, Kurt Sieber
1983 — conf
Weakest expressible preconditions: a new tool for proving completeness results about Hoare calculi.
Theoretical Computer Science
Kurt Sieber