Updated on 2025/04/17

写真a

 
NAGATOU NAOYUKI
 
Organization
Center for Information Infrastructure Associate Professor for Institute Management
Title
Associate Professor for Institute Management
External link

Research Areas

  • Informatics / Software

Papers

  • A MODEL-CHECKING BASED APPROACH TO ROBUSTNESS ANALYSIS OF PROCEDURES UNDER HUMAN-MADE FAULTS Reviewed

    Naoyuki Nagatou, Takuo Watanabe

    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE   22 ( 4 )   494 - 508   2015

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:UNIV CINCINNATI INDUSTRIAL ENGINEERING  

    A model-checking approach to analyze the robustness of procedures that suffer from human-made faults is proposed. Many procedures executed by humans incorporate fault detection and recovery tasks to recover from human-made faults. Examining whether such recovery tasks work as expected is crucial to preserve the trust and reliability inherent in safety-critical domains. To achieve this, we have employed a fault-injection method that injects a set of human-made faults into a fault-free model for a given procedure. This fault set is selected according to Swain's discrete action classification. The proposed approach uses a model checker to determine paths to error states within the model, and its properties are formalized via calculus of communicating systems and linear temporal logic. The effectiveness of the proposed method is demonstrated by investigating the recoverability of a real-world procedure.

    Web of Science

    researchmap

  • A model-checking based approach to robustness analysis of procedures under human-made faults

    Naoyuki Nagatou, Takuo Watanabe

    International Journal of Industrial Engineering : Theory Applications and Practice   22 ( 4 )   494 - 508   2015

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:University of Cincinnati  

    A model-checking approach to analyze the robustness of procedures that suffer from human-made faults is proposed. Many procedures executed by humans incorporate fault detection and recovery tasks to recover from human-made faults. Examining whether such recovery tasks work as expected is crucial to preserve the trust and reliability inherent in safety-critical domains. To achieve this, we have employed a fault-injection method that injects a set of human-made faults into a fault-free model for a given procedure. This fault set is selected according to Swain's discrete action classification. The proposed approach uses a model checker to determine paths to error states within the model, and its properties are formalized via calculus of communicating systems and linear temporal logic. The effectiveness of the proposed method is demonstrated by investigating the recoverability of a real-world procedure.

    Scopus

    researchmap

  • A model-checking based approach to robustness analysis of procedures under human-made faults Reviewed

    Naoyuki Nagatou, Takuo Watanabe

    Lecture Notes in Business Information Processing   181   117 - 131   2014

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:Springer Verlag  

    We propose a model-checking approach for analyzing the robustness of procedures that suffer from human-made faults. Many procedures executed by humans incorporate fault detection and recovery tasks to recover from human-made faults. Examining whether such recovery tasks work as expected is crucial for preserving the trust and reliability inherent in safety-critical domains. To achieve this, we used a type of fault-injection method that injects a set of human-made faults into a fault-free model of a given procedure
    the fault set is selected according to Swain's discrete action classification. We use a model checker to determine paths to error states within the model and its properties formalized via CCS and LTL. We show the effectiveness of our method by investigating the recoverability of a real-world procedure. © Springer International Publishing Switzerland 2014.

    DOI: 10.1007/978-3-319-08222-6

    Scopus

    researchmap

  • Robustness Analysis on Human-made Fault in Procedural Manuals

    113 ( 71 )   61 - 66   2013.5

     More details

    Language:Japanese   Publisher:電子情報通信学会  

    researchmap

  • Revisiting Enforceable Security Policies Reviewed

    Naoyuki Nagatou

    CRISIS: 2008 THIRD INTERNATIONAL CONFERENCE ON RISKS AND SECURITY OF INTERNET AND SYSTEMS, PROCEEDINGS   227 - 234   2008

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    We algebraically characterize a class of enforceable security policies that by execution monitoring using a modal logic. We regard monitors as processes in Milner's CCS and security policies as formulas in the modal logic. We show that a set of processes occurring in a monitor must be within the greatest fixed point for the formula, following Schneider's definition on execution monitors. We also consider monitors that can derive some sequences from a single captured action sequence. To discuss such monitors, we introduce variables ranging over sets of processes in CCS. We then show that there is fixed points under the extension. This work may help its to understand such monitors to detect covert channels at run time and to analyze safety properties for multithreads, which need to examine multiple paths.

    DOI: 10.1109/CRISIS.2008.4757483

    Web of Science

    researchmap

  • Run-time detection of covert channels Reviewed

    Naoyuki Nagatou, Takuo Watanabe

    FIRST INTERNATIONAL CONFERENCE ON AVAILABILITY, RELIABILITY AND SECURITY, PROCEEDINGS   577 - +   2006

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE COMPUTER SOC  

    The authors are interested in the characterization of policies which are enforced by execution monitoring mechanisms with an extra structure that is an extension of Schneider's enforcement mechanism. This paper is a starting point for continuing in this area. We use an emulator as the extra structure, which emulates the behavior of a system by running a subsequence from an interleaved state sequence of processes, in order to detect several covert channels at run time. We then define a security automaton for this extended mechanism and show a class of properties which is enforced by the security automaton. Further, our mechanism can enforce information flow policies, which are specified by system developers, under an information flow property to be defined for the aim of this study. We show that the information flow property include O'Halloran's Noninference. In the last of this paper, we give a simple example for the policy and an outline of our mechanism.

    DOI: 10.1109/ARES.2006.114

    Web of Science

    researchmap

  • On Execution Monitoring using Program Analysis

    Nagatou Naoyuki, Watanabe Takuo

    Conference Proceedings of Japan Society for Software Science and Technology   21   67 - 67   2004

     More details

    Publisher:Japan Society for Software Science and Technology  

    It is known that the class of security policies enforced by a simple execution monitoring (EM) is included in the class of safety properties. The goal of this work is the characterization of enforceable policies using mechanisms in EM augmented with information obtained by program analysis. In this paper, we focus on confidentiality and availability enforced by the augmented EM.

    DOI: 10.11309/jssstconference.21.0.67.0

    researchmap

  • Specifying context-aware runtime security policies using an algebraic policy specification language Reviewed

    T Watanabe, K Yamada, N Nagatou

    PROCEEDINGS OF THE IASTED INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING   662 - 667   2004

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:ACTA PRESS  

    This paper reports our ongoing work towards a novel secure execution scheme of mobile objects that are especially utilized to extend, reconfigure or maintain a dynamically extensible and/or context-aware systems. The overall motivation is to develop a security architecture that protects the systems and the privacy of their users from potentially malicious mobile objects. Our security architecture, called Taurus-1, adopts monitored execution as a basic security enforcement mechanism. To describe security policies we designed an algebraic policy description language Polaris, in which we can specify a policy as a collection of hierarchically described process modules. We show how Taurus-1 can provide a security enhancement mechanism for such extensible and/or context-aware systems and then discuss how to specify security policies for them.

    Web of Science

    researchmap

  • Towards a specification scheme for context-aware security policies for networked appliances Reviewed

    T Watanabe, K Yamada, N Nagatou

    WSTFES 2003: IEEE WORKSHOP ON SOFTWARE TECHNOLOGIES FOR FUTURE EMBEDDED SYSTEMS, PROCEEDINGS   65 - 68   2003

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE COMPUTER SOC  

    This paper describes a secure execution scheme for mobile programs running in networked appliances. The potential threat we are considering is the malicious behaviour of the mobile programs. Our security architecture, called Taurus-1, adopts monitored execution as a basic mechanism for enforcing security policies at runtime. To describe a policy for this architecture, we designed an algebraic policy description language Polaris, in which we can specify a policy as a process consists of abstract events in a monitored program. The program is modified beforehand for effective detection of its malicious behaviour We discuss how Taurus-1 can provide a security enhancement mechanism for context-aware systems such as networked appliances, and discuss how to specify security policies for them.

    DOI: 10.1109/WSTFES.2003.1201363

    Web of Science

    researchmap

▼display all

MISC

  • Semantics of Human-Made Fault and Robustness Analysis

    30   633 - 640   2013.9

     More details

    Language:Japanese  

    CiNii Books

    researchmap

  • On Enforcement of Noninterference

    NAGATOU Naoyuki, WATANABE Takuo

    IPSJ SIG Notes   2006 ( 81 )   207 - 214   2006.7

     More details

    Language:Japanese   Publisher:社団法人情報処理学会  

    We discuss a characterization of security policies to be enforced with a monitor. The monitor is a enforcement mechanism that work by observing a behavior of a program and terminating its execution if it violates a security policy being enforced. Unfortunately, the monitors is able to enforce not all of security policies in order to limit to observe for a finite behavior and not to use future informations. F.B.Schneider show that policies having the trait become to satisfy Lamport's safety property. Also, there exist Buchi automata to recognize the safety properties and he calls them security automata. Therefore we introduce automata using more information and show that these automata can enforce information flow policies with respect to noninterference.

    researchmap

  • On Enforcement of Noninterference

    NAGATOU Naoyuki, WATANABE Takuo

    IEICE technical report. Social Implications of Technology and Information Ethics   106 ( 174 )   207 - 214   2006.7

     More details

    Language:Japanese   Publisher:社団法人電子情報通信学会  

    We discuss a characterization of security policies to be enforced with a monitor. The monitor is a enforcement mechanism that work by observing a behavior of a program and terminating its execution if it violates a security policy being enforced. Unfortunately, the monitors is able to enforce not all of security policies in order to limit to observe for a finite behavior and not to use future informations. F.B.Schneider show that policies having the trait become to satisfy Lamport's safety property. Also, there exist Biichi automata to recognize the safety properties and he calls them security automata. Therefore we introduce automata using more information and show that these automata can enforce information flow policies with respect to noninterference.

    researchmap

  • A Security Enforcement Method by Load - time Binary Translation

    WATANABE TAKUO, NAGATOU NAOYUKI, YAMADA KIYOSHI

    43 ( 3 )   94 - 94   2002.3

     More details

    Language:Japanese   Publisher:Information Processing Society of Japan (IPSJ)  

    Mobile code has been regarded as a convenient abstraction mechanism to construct flexible/evolvable distributed computing systems. It has now gained prominence, mainly due to the current shift from stationary to mobile/ubiquitous computing environment. Although designing a system using mobile code is appealing, its deployment is still a security risk. Further, a system using mobile code is inherently dynamic; we need an extensible/adaptable security model. In this talk, we first claim that application-dependent and special-purpose security policies are increasingly important especially for modern distributed computing environment. Then we present a set of techniques that may be used to enforce such policies on mobile objects (Java classes) . The main technique is a load-time bytecode modification that enforces user-defined policies via monitored execution. The policies are written in a language called Polaris, which is basically a finite process language enhanced to deal with data-dependencies among variables. Use of data-dependencies reduced the cost of monitoring. As an example, we show a code portion from our extensible e-mail client system. Web site of this project: http://www.psg.cs.titech.ac.jp/sc/

    CiNii Books

    researchmap

Research Projects

  • その他の研究制度 

      More details

    Grant type:Competitive

    researchmap

  • -

    The Other Research Programs 

      More details

    Grant type:Competitive

    researchmap