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.

Kiyoshi Agusa

dblp:58/2352 · DBLP profile ↗
← Back
14ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none

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

Software engineering, systems software and programming languages · 9 · 1 first-authorSystems, architecture and hardware · 3Artificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 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
Software maintenance and evolution · 54% Requirements engineering and software design · 46%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 77% Processor architecture and microarchitecture · 23%

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

TopicWeightPapersLastEvidence papers
Software maintenance and evolution
software reuse
0.011988
A Programming Environment Supporting Reuse of Object-Oriented Software · ICSE 1988
Requirements engineering and software design › formal specification
formal requirements specification
0.011982
Verification System for Formal Requirements Description · ICSE 1982
Requirements engineering and software design
requirements verification
0.011982
Verification System for Formal Requirements Description · ICSE 1982
Parallel and multicore computing
concurrent programming
0.011981
Concurrent LISP on a Multi-Micro-Processor System · IJCAI 1981
Processor architecture and microarchitecture › multiprocessor architecture
multimicroprocessor system
0.011981
Concurrent LISP on a Multi-Micro-Processor System · IJCAI 1981

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

concurrent LISP · 0.0
YearPublicationVenuePosition
2013 Grouping Objects for Execution Trace Analysis Based on Design Patterns
abstract
To comprehend an object-oriented software, visualizing object interactions performed as a UML sequence diagram is a promising technique for helping developers. However such UML sequence diagrams are typically too huge to comprehend behavior. In this paper, we propose a novel technique to generate abstracted sequence diagrams based on the information of applied GoF design patterns in a source code. We discuss effectiveness of our approach through a case study applying our implemented tool to an open source software.
Tatsuya Toda, Takashi Kobayashi 0001, Noritoshi Atsumi, Kiyoshi Agusa
APSEC (2)4
2011 An XML C Source Code Interchange Format for CASE Tools
abstract
We propose an XML C source code representation to support developing CASE tools. Since source code is a main artifact of software development, most CASE tools have some features related to source code editor, static analyzer, profiler, etc. To develop such tools, detailed information related to source code is needed. However, it is quite difficult to reuse program analysis features because they do not have common interfaces even for parsing and data/control-flow analysis that are most common features for such CASE tools. To address this issue, we focus on XML as an intermediate representation for source code information. Existing XML representations only represent structure of syntax trees and lack some important information required for CASE tools. We propose two models for representing source code, one is for intra-file information, which consists of syntax structure, flow, and type information, the other is for inter-file relation, which is cross-reference information. We also introduce CASE tools with our representation and demonstrate the efficacy in CASE tool development. To evaluate the efficacy, we show that a coding rule checker and a cross-referencer can be easily implemented using common XML processing libraries such as XSLT and XPath.
Noritoshi Atsumi, Takashi Kobayashi 0001, Shinichiro Yamamoto, Kiyoshi Agusa
COMPSAC4
2011 Software Metrics Based on Coding Standards Violations
abstract
Software metrics is one of promise technique to capture the size and quality of products, development process in order to assess a software development. Many software metrics based on various aspects of a product and/or a process have been proposed. There is some research which discuss the relation between software metrics and faults to use these metrics as the indicator of quality. Most of these software metrics are based on structural features of products or process information related to explicit fault. In this paper, we focus on latent faults detected by static analysis techniques. The coding checker is widely used to find coding standards violations which are strongly relating to latent faults. In this paper, we propose new software metrics based on coding standards violations to capture latent faults in a development. We analyze two open source projects by using proposed metrics and discuss the effectiveness.
Yasunari Takai, Takashi Kobayashi 0001, Kiyoshi Agusa
IWSM/Mensura3
2009 Sequence Diagram Slicing
abstract
Software visualization with sequence diagrams is one of the promising techniques aimed at helping developers comprehend the behavior of object-oriented systems effectively. However, it is still difficult to understand this behavior, because the size of automatically generated sequence diagrams tends to be beyond the developer's capacity. In this paper, we propose a sequence diagram slicing method, which is an extension of our previous method based on a dynamic slicing technique using static information. Our proposed method is capable of accurate slice calculation based on high-precision data dependency and can support various programs, including exceptions and multithreading. In addition, our proposed new tool performs slice calculations on the Eclipse platform and we demonstrate the applicability of this method by applying the tool to two Java programs as case studies. The results confirm the effectiveness of our proposed method for understanding the behavior of object-oriented systems.
Kunihiro Noda, Takashi Kobayashi 0001, Kiyoshi Agusa, Shinichiro Yamamoto
APSEC3
2007 A Synchronization Flow Analysis of Concurrent Objects in AIBO OPEN-R Programs Based on Communicating Processes
abstract
We propose a compositional analysis method for synchronization flow in AIBO OPEN-R programs based on communicating processes. Concurrent objects of AIBO programs with the OPEN-RAPI are synchronized by two types of signals: ready and notify. Focusing on these signals, we describe abstract behavior of AIBO programs in the pi-calculus preserving the source code structure. We model-check deadlock freeness and interactions order of AIBO programs based on this abstract behavior. Since a primary issue in model-checking is the state space explosion in the behavioral model, we present a decomposing method to reduce the combination of states of concurrent objects. Since our translation to the pi-calculus preserves the syntactical structure of source code, when a counter-example is pointed out, our method enables not only to detect the violation of property of the whole system, but also to point out which component may cause the violation. We developed a prototype translator from AIBO OPEN-R programs to abstract description in the pi-calculus. We show that an application of our decomposing method enables to practically model- check properties by existing tools in two examples of AIBO programs.
Ryo Suetsugu, Shoji Yuen, Kiyoshi Agusa
APSEC3
2005 Towards assuring quality attributes of client dynamic Web applications: Identifying and addressing the challenges
Mohamed Sharaf Aun, Shoji Yuen, Kiyoshi Agusa
J. Web Eng.3
2005 Image retrieval by pattern categorization using wavelet domain perceptual features with LVQ neural network
Md. Khayrul Bashar, Noboru Ohnishi, Tetsuya Matsumoto, Yoshinori Takeuchi, Hiroaki Kudo, Kiyoshi Agusa
Pattern Recognit. Lett.6
1993 CARD: a software requirements definition environment
abstract
Computer-aided requirements definition methods/environment are presented. A composite requirements model (requirements frame) is proposed, and several supporting methods of software requirements definition based on the model are developed. They are: analysis of requirements; describing requirements; verification of an SRS (software requirements specification); SRS execution; and software preliminary design. With these methods, it is possible to obtain an SRS of good quality (correctness, testability, traceability, feasibility, and usability). The authors have been developing an environment of requirements definition, named CARD, by using these methods. They present some examples of experimental uses of CARD.>
Atsushi Ohnishi, Kiyoshi Agusa
RE2
1988 A Programming Environment Supporting Reuse of Object-Oriented Software
H. Tarumi, Kiyoshi Agusa, Yutaka Ohno
ICSE2
1983 A Multi-Microprocessor System for Concurrent LISP
Shigeo Sugimoto, Kiyoshi Agusa, Koichi Tabata, Yutaka Ohno
ICPP2
1982 A parallel processor system dedicated to SIMD and its application to three-dimensional color graphics
Masatoshi Kubo, E. Toshima, N. Mori, H. Hoshino, Kiyoshi Agusa, Yutaka Ohno
ICDCS5
1982 Verification System for Formal Requirements Description
Kiyoshi Agusa, Atsushi Ohnishi, Yutaka Ohno
ICSE1
1981 Concurrent LISP on a Multi-Micro-Processor System
Shigeo Sugimoto, Koichi Tabata, Kiyoshi Agusa, Yutaka Ohno
IJCAI3
1981 SAFE: A stand alone fast editor
Tibor Gal, Kiyoshi Agusa, Yutaka Ohno
Microprocessing and Microprogramming2