VLDB 2026 Research / reviewers in the wild / expert
Jean-Pierre Verjus
dblp:00/851
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 1987
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 1 · 1 first-authorTheory of computation · 1 · 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.
| Computer networks
1 paper |
Internet architecture and protocols · 100% | |
| Theoretical computer science
1 paper |
Distributed computing theory · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Programming languages and type systems · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet architecture and protocols › protocol specification
formal description techniques |
0.0 | 1 | 1987 | Some Comments on "Transition-Oriented" Versus "Structured" Specification of Distributed Algorithms and Protocols · IEEE Trans. Software Eng. 1987 |
Distributed computing theory
distributed algorithms |
0.0 | 1 | 1987 | Some Comments on "Transition-Oriented" Versus "Structured" Specification of Distributed Algorithms and Protocols · IEEE Trans. Software Eng. 1987 |
Programming languages and type systems
specification language |
0.0 | 1 | 1987 | Some Comments on "Transition-Oriented" Versus "Structured" Specification of Distributed Algorithms and Protocols · IEEE Trans. Software Eng. 1987 |
Methods — techniques the papers use, named apart from their topics
transformation rules · 0.0state transition model · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1987 | On the Proof of a Distributed Algorithm
Jean-Pierre Verjus |
Inf. Process. Lett. | 1 |
| 1987 | Some Comments on "Transition-Oriented" Versus "Structured" Specification of Distributed Algorithms and ProtocolsabstractFormal description techniques (FDT's) are being developed for the specification of communication protocols and other distributed systems. Some of them (namely SDL and Estelle) are based on an extended state transition model and promote a "transition-oriented" specification style. Another one (namely Lotos) and most highlevel programming languages promote a style which is called "structured." The correspondence compares these two specification styles in the framework of rendezvous interactions between different system modules. The advantages of each of the two styles are discussed in relation with an example of a virtual ring mutual exclusion protocol. Transformation rules between the two approaches are given. An extension to the state transition oriented FDT's is also suggested in order to allow for a structured specification style. Gregor von Bochmann, Jean-Pierre Verjus |
IEEE Trans. Software Eng. | 2 |