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

Norihisa Doi

dblp:92/5313 · DBLP profile ↗
← Back
13ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · none

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

Software engineering, systems software and programming languages · 5 · 1 first-authorSecurity and privacy · 3Theory of computation · 2Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 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
3 papers
Runtime systems and virtual machines · 48% Compilers and program optimization · 29% Operating systems · 19%

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

TopicWeightPapersLastEvidence papers
Runtime systems and virtual machines
garbage collection
0.011995
SPiCE: A System for Translating Smalltalk Programs Into a C Environment · IEEE Trans. Software Eng. 1995
Compilers and program optimization › program transformation
source-to-source transformation
0.011995
SPiCE: A System for Translating Smalltalk Programs Into a C Environment · IEEE Trans. Software Eng. 1995
Operating systems › resource management › process management
thread management
0.011992
The Design and Implementation of HoME · PLDI 1992
Requirements engineering and software design
requirements specification
0.011982
Requirement Specification Description System in Japanese Language - JISDOS · ICSE 1982

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

semi-conservative garbage collection · 0.0runtime replacement classes · 0.0mach threads · 0.0
YearPublicationVenuePosition
2015 Cryptography and Algorithmic Randomness
Kohtaro Tadaki, Norihisa Doi
Theory Comput. Syst.2
2012 Scheme overcoming incompatibility of privacy and utilization of personal data
Shigeo Tsujii, Kohtaro Tadaki, Ryou Fujita, Hiroshi Yamaguchi, Masahito Gotaishi, Yukiyasu Tsunoo, Takahiko Syouji, Norihisa Doi
ISITA8
2005 An efficient and generic reversible debugger using the virtual machine based approach
abstract
The reverse execution of programs is a function where pro-grams are executed backward in time. A reversible debugger is a debugger that provides such a functionality. In this pa-per, we propose a novel reversible debugger that enables reverse execution of programs written in the C language. Our approach takes the virtual machine based approach. In this approach, the target program is executed on a special virtual machine. Our contribution in this paper is two-fold. First, we propose an approach that can address problems of (1) compatibility and (2) efficiency that exist in previous works. By compatibility, we mean that previous debuggers are not generic, i.e., they support only a special language or special intermediate code. Second, our approach provides two execution modes: the native mode, where the debuggee is directly executed on a real CPU, and the virtual ma-chine mode, where the debuggee is executed on a virtual machine. Currently, our debugger provides four types of trade-off settings (designated by unit and optimization) to consider trade-offs between granularity, accuracy, overhead and memory requirement. The user can choose the appro-priate setting flexibly during debugging without finishing and restarting the debuggee.
Toshihiko Koju, Shingo Takada 0001, Norihisa Doi
VEE3
2003 Regression Test Selection based on Intermediate Code for Virtual Machines
abstract
Regression testing is testing applied to software that has been modified. It basically entails re-testing the software with previous test cases to confirm that the modifications made to the software do not have an adverse effect. But re-executing all test cases is normally cost prohibitive, and thus much research has been done on selecting test cases from a test suite without compromising the reliability of the software. These regression test selection techniques find test cases that will not detect any bugs in the modified software, and delete those from the next regression test suite. However, these techniques are based on analysis of source code. Recent programming environments have seen a proliferation of virtual machines. For example, programs written in Java and with the Microsoft .Net Framework are compiled into a platform-independent intermediate code which is executed. Such code could also be used for regression test selection. This especially holds for the Microsoft .Net Framework which handles various programming languages, such as Visual Basic and C++. Thus, this paper presents a safe regression test selection technique for virtual machine based programs. We especially target the Microsoft .Net Framework. Evaluation on 10 different examples resulted in an average of a 40.4% decrease in the cost of regression testing.
Toshihiko Koju, Shingo Takada 0001, Norihisa Doi
ICSM3
2000 Conference Key Agreement Protocol Using Oblivious Transfer
Ari Moesriami Barmawi, Shingo Takada 0001, Norihisa Doi
DBSec3
1999 Robust Protocol for Generating Shared RSA Parameters
Ari Moesriami Barmawi, Shingo Takada 0001, Norihisa Doi
IMACC3
1999 Effects of IP packet loss and picture frame reduction on MPEG1 subjective quality
abstract
This paper evaluates the effects of IP packet loss and picture frame reduction on MPEG1 subjective quality in order to clarify how to apply quality-guaranteed techniques such as RSVP (resource reservation protocol) to the Internet. Subjective assessment tests showed that IP packet loss was the dominant factor in MPEG1 audio-visual quality degradation compared with picture frame reduction. Moreover, there was no difference between individual audio-visual quality contributions to the overall MPEG1 quality.
Shin'ichiro Yamasaki, Naoto Morita, Hitoshi Aida, Masato Takeichi, Norihisa Doi
MMSP6
1997 Augmented encrypted key exchange using RSA encryption
abstract
The augmented encrypted key exchange (A-EKE) uses a shared secret key for encryption. The A-EKE uses the hash of sender's password as the shared secret key. By using Simmon's attack the sender's password can be broken. If this is accomplished, the attacker is able to know the communicating parties session key used after authentication as well as in the authentication of the sender. Furthermore, using the broken session key and the password, the attacker can impersonate the real sender. To prevent this from happening, we propose a method to keep the session key and sender's password secret even if the attacker can break the shared secret key. This is accomplished by using RSA encryption. In our proposed scheme we use public keys which will be kept by the communicating parties and will be exchanged indirectly, i.e. instead of sending the whole public key the two parties will send the number which determines their public key, along with the shared key.
Ari Musriami Barmawi, Shingo Takada 0001, Norihisa Doi
PIMRC3
1995 SPiCE: A System for Translating Smalltalk Programs Into a C Environment
abstract
Smalltalk-80 (hereafter referred to as Smalltalk), which is one of the most productive programming languages/environments, is very well suited for prototyping of applications but it is less well suited for delivering applications because applications can neither run in isolation from the Smalltalk environment nor be combined with other programs written in other languages. One way to make Smalltalk suitable for delivering applications is to translate Smalltalk into a compiler language such as C. By translating Smalltalk code into portable and interoperable C code, it is possible to deliver a stand-alone version of Smalltalk applications, and to develop an application partly in Smalltalk and partly in C. However, there are some difficulties in translating Smalltalk code into such a C code. First, the execution model of Smalltalk, which creates activation records as objects, is very different from that of C, and second, Smalltalk and C have very different approaches to storage management. We have implemented SPiCE, a system for translating Smalltalk into C. Our approach to the translation is to create runtime replacement classes implementing the same functionality of Smalltalk classes that are inherently part of the Smalltalk execution model, and to provide semi-conservative real-time compacting garbage collection that works without language support.>
Kazuki Yasumatsu, Norihisa Doi
IEEE Trans. Software Eng.2
1994 Centering in Japanese: A Step Towards Better Interpretation of Pronouns and Zero-Pronouns
Shingo Takada 0001, Norihisa Doi
COLING2
1992 The Design and Implementation of HoME
abstract
HoME is a version of Smalltalk which can be efficiently executed on a multiprocessor and can be executed in parallel by combining a Smalltalk process with a Mach thread and executing the process on the thread. HoME is nearly the same as ordinary Smalltalk except that multiple processes may execute in parallel. Thus, almost all applications running on ordinary Smalltalk can be executed on HoME without changes in their code.
Kazuhiro Ogata 0001, Satoshi Kurihara, Mikio Inari, Norihisa Doi
PLDI4
1988 An Implementation of an Operating System Kernel Using Concurrent Object-Oriented Language ABCL/c+
Norihisa Doi, Yasushi Kodama, Ken Hirose
ECOOP1
1982 Requirement Specification Description System in Japanese Language - JISDOS
Jun Murai, Nobuo Saito, Norihisa Doi, M. Morohashi, T. Fujisaki
ICSE3