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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Jørgen Staunstrup

dblp:s/JorgenStaunstrup · DBLP profile ↗
← Back
10ranked-venue papers
4as first author
0since 2021 · last 1995
—ORCID · none

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

Systems, architecture and hardware · 4 · 1 first-authorTheory of computation · 4 · 2 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-author

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
Concurrent programming · 50% Program verification · 50%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Concurrent programming › synchronization
mutual exclusion		 0.011978
Specification and Implementation of Mutual Exclusion · IEEE Trans. Software Eng. 1978
YearPublicationVenuePosition
1995 Localized Verification of Modular Designs
Jørgen Staunstrup, Niels Mellergaard
 Formal Methods Syst. Des.1
1993 Delay-insensitive multi-ring structures
Jens Sparsø, Jørgen Staunstrup
 Integr.2
1989 The Behavior of Shared Objects: Concepts, Pitfalls, and a New Model
Jørgen Staunstrup, Jürg Nievergelt
 Inf. Process. Lett.1
1987 VLSI with a very low scale investment
Mark R. Greenstreet, Peter Møller-Nielsen, Jørgen Staunstrup
 Integr.3
1987 Problem-heap: A paradigm for multiprocesor algorithms
Peter Møller-Nielsen, Jørgen Staunstrup
 Parallel Comput.2
1985 Physical datarepresentation in a multiprocessor database machine
Jørgen Staunstrup, Jens Ove Jespersen, Ole V. Johansen
 Parallel Comput.1
1984 Experiments With a Fast String Searching Algorithm
Peter Møller-Nielsen, Jørgen Staunstrup
 Inf. Process. Lett.2
1982 Concurrent Algorithms for Root Searching
Ole Eriksen, Jørgen Staunstrup
 Acta Informatica2
1982 Message Passing Communication Versus Procedure Call Communication
abstract
Abstract Communication by message passing or by procedure calls in one of the key issues when discussing languages for multiprogramming. The two languages Platon and Concurrent Pascal represent the different approaches which are contrasted by presenting a few programs written in both languages.
Jørgen Staunstrup
 Softw. Pract. Exp.1
1978 Specification and Implementation of Mutual Exclusion
abstract
This paper presents a constructive approach to the problem of specifying, implementing, and verifying operations that will give concurrent processes exclusive access to a resource. The method eliminates the need for auxiliary variables and establishes the correctness of a whole class of solutions to the same problem. The solutions are derived directly from the specifications using a language construct called guarded regions. Several new solutions to well-known exclusion problems are presented.
Per Brinch Hansen, Jørgen Staunstrup
 IEEE Trans. Software Eng.2