Kurt Sieber

According to our database, Kurt Sieber authored at least 14 papers between 1983 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2020

Grammar-Based Compression of Unranked Trees.

Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber

Theory Comput. Syst., 2020

Navigating Forest Straight-Line Programs in Constant Time.

Carl Philipp Reh, Kurt Sieber

Proceedings of the String Processing and Information Retrieval, 2020

2019

Size-optimal top dag compression.

Markus Lohrey, Carl Philipp Reh, Kurt Sieber

Inf. Process. Lett., 2019

2017

Optimal top dag compression.

Markus Lohrey, Carl Philipp Reh, Kurt Sieber

CoRR, 2017

2010

Preface.

Kurt Sieber

J. Log. Algebraic Methods Program., 2010

1996

Full Abstraction for the Second Order Subset of an Algol-Like Language.

Kurt Sieber

Theor. Comput. Sci., 1996

1994

A Process Oriented Semantics of the PRAM-Language FORK.

Gudula Rünger, Kurt Sieber

Comput. Lang., 1994

1993

Call-by-Value and Nondeterminism.

Kurt Sieber

Proceedings of the Typed Lambda Calculi and Applications, 1993

1990

Relating Full Abstraction Results for Different Programming Languages.

Kurt Sieber

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

1988

Towards Fully Abstract Semantics for Local Variables.

Albert R. Meyer, Kurt Sieber

Proceedings of the Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, 1988

1987

The Foundations of Program Verification, 2nd ed.

Jacques Loeckx, Kurt Sieber

Wiley-Teubner, ISBN: 0-471-91282-4, 1987

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

PhD thesis, 1984

The Foundations of Program Verification, 1st ed.

Jacques Loeckx, Kurt Sieber

Wiley-Teubner, ISBN: 0-471-90323-X, 1984

1983

Weakest expressible preconditions: a new tool for proving completeness results about Hoare calculi.

Kurt Sieber

Proceedings of the Theoretical Computer Science, 1983