Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Kurt Sieber

dblp:48/6988 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 5 · 3 first-authorSoftware engineering, systems software and programming languages · 2Databases, data management, data science and information retrieval · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems › program equivalence
full abstraction
0.011988
Towards Fully Abstract Semantics for Local Variables · POPL 1988
Programming languages and type systems
language semantics
0.011988
Towards Fully Abstract Semantics for Local Variables · POPL 1988
Programming languages and type systems
local variables
0.011988
Towards Fully Abstract Semantics for Local Variables · POPL 1988

Methods — techniques the papers use, named apart from their topics

logical relations · 0.0locally complete partial orders · 0.0
YearPublicationVenuePosition
2020 Navigating Forest Straight-Line Programs in Constant Time
Carl Philipp Reh, Kurt Sieber
SPIRE2
2020 Grammar-Based Compression of Unranked Trees
Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber
Theory Comput. Syst.5
2019 Size-optimal top dag compression
Markus Lohrey, Carl Philipp Reh, Kurt Sieber
Inf. Process. Lett.3
1996 Full Abstraction for the Second Order Subset of an Algol-Like Language
Kurt Sieber
Theor. Comput. Sci.1
1994 Full Abstraction for the Second Order Subset of an Algol-Like Language
Kurt Sieber
MFCS1
1994 A Process Oriented Semantics of the PRAM-Language FORK
Gudula Rünger, Kurt Sieber
Comput. Lang.2
1990 Relating Full Abstraction Results for Different Programming Languages
Kurt Sieber
FSTTCS1
1988 Towards Fully Abstract Semantics for Local Variables
abstract
The Store Model of Halpern-Meyer-Trakhtenbrot is shown—after suitable repair—to be a fully abstract model for a limited fragment of ALGOL in which procedures do not take procedure parameters. A simple counter-example involving a parameter of program type shows that the model is not fully abstract in general. Previous proof systems for reasoning about procedures are typically sound for the HMT store model, so it follows that theorems about the counter-example are independent of such proof systems. Based on a generalization of standard cpo based models to structures called locally complete partial orders (lcpo's), improved models and stronger proof rules are developed to handle such examples.
Albert R. Meyer, Kurt Sieber
POPL2