VLDB 2026 Research / reviewers in the wild / expert
Yuji Sugiyama
dblp:25/4791
· DBLP profile ↗
9ranked-venue papers
0as first author
0since 2021 · last 2004
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 4Software engineering, systems software and programming languages · 4Theory of computation · 1
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
2 papers |
Programming languages and type systems · 93% Program analysis · 7% | |
| Computer networks
1 paper |
Internet architecture and protocols · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet architecture and protocols › link-layer protocols
HDLC |
0.0 | 1 | 1984 | An Algebraic Specification of HDLC Procedures and Its Verification · IEEE Trans. Software Eng. 1984 |
Internet architecture and protocols
link-layer protocols |
0.0 | 1 | 1984 | An Algebraic Specification of HDLC Procedures and Its Verification · IEEE Trans. Software Eng. 1984 |
Programming languages and type systems › specification language
algebraic specification |
0.0 | 1 | 1984 | An Algebraic Specification of HDLC Procedures and Its Verification · IEEE Trans. Software Eng. 1984 |
Programming languages and type systems
functional programming |
0.0 | 1 | 1984 | Functional Programming and Logical Programming for the Telegram Analysis Problem · ICSE 1984 |
Programming languages and type systems
logic programming |
0.0 | 1 | 1984 | Functional Programming and Logical Programming for the Telegram Analysis Problem · ICSE 1984 |
Programming languages and type systems
programming paradigms |
0.0 | 1 | 1984 | Functional Programming and Logical Programming for the Telegram Analysis Problem · ICSE 1984 |
Program analysis
static analysis |
0.0 | 1 | 1984 | Functional Programming and Logical Programming for the Telegram Analysis Problem · ICSE 1984 |
Methods — techniques the papers use, named apart from their topics
consistency proof · 0.0algebraic specification · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | A Group Signature Scheme with Efficient Membership Revocation for Reasonable Groups
Toru Nakanishi 0001, Yuji Sugiyama |
ACISP | 2 |
| 2004 | An Efficient Online Electronic Cash with Unlinkable Exact Payments
Toru Nakanishi 0001, Mitsuaki Shiota, Yuji Sugiyama |
ISC | 3 |
| 2002 | A Group Signature Scheme Committing the Group
Toru Nakanishi 0001, Masayuki Tao, Yuji Sugiyama |
ICICS | 3 |
| 2001 | Anonymous Statistical Survey of Attributes
Toru Nakanishi 0001, Yuji Sugiyama |
ACISP | 2 |
| 1989 | Quantifying a design process based on experiments
Hideo Kudo, Yuji Sugiyama, Mamoru Fujii, Koji Torii |
J. Syst. Softw. | 2 |
| 1987 | Logical Programming for the Telegram Analysis Problem
Koji Torii, Yuji Sugiyama, Mamoru Fujii, Tadao Kasami, Yoshitomi Morisawa |
Comput. Lang. | 2 |
| 1984 | Functional Programming and Logical Programming for the Telegram Analysis Problem
Koji Torii, Yoshitomi Morisawa, Yuji Sugiyama, Tadao Kasami |
ICSE | 3 |
| 1984 | An Algebraic Specification of HDLC Procedures and Its VerificationabstractIt is well known that algebraic specification methods are promising for specifying programs and for verifying their various properties formally. In this paper, an algebraic specification of information transfer procedures of high-level data link control (HDLC) procedures is presented and some of the main properties of the specification are shown. First, we introduce abstract states, state transition functions, and output functions corresponding to elementary notions extracted from the description of HDLC procedures in ISO 3309-1979 (E) and ISO 4335-1979 (E). Second, we show axioms which represent the relations between the values of functions before and after the state transitions. Then, it is proved that the specification is ``consistent,'' ``sufficiently complete,'' and ``nonredundant.'' Also it is shown that an implementation which realizes the specification is naturally derived. In the last section, verification of various properties of HDLC procedures is formulated in the same framework as the algebraic specification, and some verification examples are presented. Teruo Higashino, Masaaki Mori, Yuji Sugiyama, Kenichi Taniguchi, Tadao Kasami |
IEEE Trans. Software Eng. | 3 |
| 1979 | On equivalence of safe Petri nets
Kenichi Taniguchi, Toshio Matsuura, Yuji Sugiyama, Tadao Kasami |
FCT | 3 |