Research Interests:
Research Interests:
Research Interests:
ABSTRACT Almost all, if not all, software development and maintenance activities require some abstract representations for target programs in order to grasp necessary information about the programs and ignore unnecessary information. This... more
ABSTRACT Almost all, if not all, software development and maintenance activities require some abstract representations for target programs in order to grasp necessary information about the programs and ignore unnecessary information. This paper presents the role of unified program representations in distributed software development, basic considerations on constructing an integrated environment for supporting distributed software development based on unified program representation, and the design and implementation of an integrated environment we are developing
Research Interests:
In addition to the usual control and data dependences proposed and studied for sequential and centralized programs, this paper introduces three new types of primary program dependences in concurrent and distributed programs, named the... more
In addition to the usual control and data dependences proposed and studied for sequential and centralized programs, this paper introduces three new types of primary program dependences in concurrent and distributed programs, named the selection dependence, synchronization dependence, and communication dependence, and a new program representation for concurrent and distributed programs, named the process dependence net (PDN), which is an arc-classified digraph to explicitly represent the five types of primary program dependences in the programs. The paper also shows some applications of the representation
Research Interests:
A discovery agent, which may be a human or a computing system to conduct and perform knowledge discovery from scientific data or from databases, makes extensive use of domain knowledge in order to increase the efficiency and effectiveness... more
A discovery agent, which may be a human or a computing system to conduct and perform knowledge discovery from scientific data or from databases, makes extensive use of domain knowledge in order to increase the efficiency and effectiveness of the discovery process. This knowledge accumulates and becomes huge with the lapse of time or with the evolution of the discovery
Research Interests:
Network normal operation baselining for automatic detection of anomalies is addressed. A model for network traffic is presented in which studied variables are modeled as a finite mixture model. Based on stochastic approximation of the... more
Network normal operation baselining for automatic detection of anomalies is addressed. A model for network traffic is presented in which studied variables are modeled as a finite mixture model. Based on stochastic approximation of the maximum likelihood function, we propose a baseline of network normal operation as the asymptotic distribution of the difference between successive estimates of model parameters. The baseline multivariate random variable is shown to be stationary, with mean zero under normal operation. Performance problems are characterized by sudden jumps in the mean. Detection is formulated as an online change point problem, where the task is to process residuals and raise alarms as soon as anomalies occur. An analytical expression of false alarm rate allows us to choose the threshold, automatically. Extensive experimental results on a real network showed that the monitoring agent is able to detect even slight changes in the characteristics of the network, and adapt t...
Research Interests:
Wos proposed 33 basic research problems for automated reasoning field, one of them is the problem of automated theorem finding. The problem has not been solved until now. The problem implicitly requires some metrics to be used for... more
Wos proposed 33 basic research problems for automated reasoning field, one of them is the problem of automated theorem finding. The problem has not been solved until now. The problem implicitly requires some metrics to be used for measuring interestingness of found theorems. We have proposed some metrics to measure interestingness of theorems found by using forward reasoning approach. We have measured interestingness of the theorems of NBG set theory by using those metrics. To confirm the generality of the proposed metrics, we have to apply them in other mathematical fields. This paper presents a case study in Peano’s arithmetic to show the generality of proposed metrics. We evaluate the interestingness of theorems of Peano’s arithmetic obtained by using forward reasoning approach, and confirm the effectiveness of the metrics.
Research Interests:
Almost all existing methodologies for representing and reasoning about spatial knowledge are somehow based on classical mathematical logic or its various conservative extensions. This approach, however, may be suitable to searching and... more
Almost all existing methodologies for representing and reasoning about spatial knowledge are somehow based on classical mathematical logic or its various conservative extensions. This approach, however, may be suitable to searching and describing a formal proof of a previously specified statement, under the condition that we have complete and consistent knowledge, but not necessarily suitable to forming a new concept and discovering a new statement, in particular, in the case that our knowledge is incomplete and inconsistent. This paper proposes a new approach: representing and reasoning about spatial knowledge based on spatial relevant logic.
Research Interests:
This paper proposes a new hybrid method to formally verify whether the security specification of a target information system satisfies security functional requirements defined in ISO/IEC 15408 evaluation criteria for security. We classify... more
This paper proposes a new hybrid method to formally verify whether the security specification of a target information system satisfies security functional requirements defined in ISO/IEC 15408 evaluation criteria for security. We classify at first the security functional requirements of ISO/IEC 15408 into two classes: static requirements concerning static properties and dynamic requirements concerning dynamic behavior of target systems, and then formalize the static requirements with Z notation and the dynamic requirements with temporal logic. Thus, we can verify static properties using theorem-proving and dynamic behavior using model-checking. As a result, developers can easily use the method to verify whether the security specification of a target information system satisfies both static and dynamic security functional requirements defined in ISO/IEC 15408. The new method is an evolution and improvement of our early verification method where only Z notation was adapted and to verify dynamic behavior of target systems is difficult.
Research Interests:
Formal analysis is used to find out flaws of cryptographic protocols. A formal analysis method with reasoning for cryptographic protocols has been proposed. In the method, behaviors of participants and behaviors of an intruder are used as... more
Formal analysis is used to find out flaws of cryptographic protocols. A formal analysis method with reasoning for cryptographic protocols has been proposed. In the method, behaviors of participants and behaviors of an intruder are used as premises of forward reasoning to deduce formulas, then analysts check whether the deduced formulas are related to flaws. However, the method only can detect the flaws related to confidentiality and authentication but is unable to detect the flaws related to non-repudiation and fairness. This paper proposes an extension of the formal analysis method with reasoning, which can deal with the flaws related to non-repudiation and fairness. This paper also shows a case study of flaw detection for non-repudiation and fairness in ISI protocol with the proposed method. The result shows that the proposed method is effective to find out flaws that related to the two security properties above.
Research Interests:
From the viewpoint of logic, we have qualitatively shown that classical mathematical logic, its various classical conservative extensions, and traditional relevant logics are not suitable to underlying forward reasoning and/or deduction... more
From the viewpoint of logic, we have qualitatively shown that classical mathematical logic, its various classical conservative extensions, and traditional relevant logics are not suitable to underlying forward reasoning and/or deduction for discovery because their logical theorems include a lot of paradoxes of conditional, and shown that strong relevant logics are more hopeful candidates for the purpose. But, it is not clear that how ’bad’ the classical mathematical logic, its various classical conservative extensions, and traditional relevant logics are, and how ’good’ strong relevant logics are, since no quantitative analysis and discussion is reported until now. As the result of a comparative study, in this paper, we present a quantitative analysis and discussion on paradoxical conditionals in classical mathematical logic and strong relevant logics. Our study shows that the problem of paradox is very critical to the development of forward reasoning and/or deduction engines useful...
To specify, verify, and reason about information security and information assurance, we need a right fundamental logic system to provide us with a logical validity criterion of normative reasoning as well as a formal representation and... more
To specify, verify, and reason about information security and information assurance, we need a right fundamental logic system to provide us with a logical validity criterion of normative reasoning as well as a formal representation and specification language. The fundamental logic must be able to underlie truth-preserving and relevant reasoning in the sense of conditional, ampliative reasoning, paracomplete reasoning, paraconsistent reasoning, and normative reasoning. This paper discusses why classical mathematical logic, its various classical conservatives extensions, or its non-classical alternatives are not suitable candidates for the fundamental logic, shows that deontic relevant logic is a hopeful candidate for the fundamental logic we need.
Research Interests:
A protection profile is a security specification template that defines an implementation-independent set of IT security requirements for a category of information systems. The protection profiles have also been certified to satisfy the... more
A protection profile is a security specification template that defines an implementation-independent set of IT security requirements for a category of information systems. The protection profiles have also been certified to satisfy the international standard ISO/IEC 15408 security criteria. However, because the protection profiles are complicated and their classifications are not clear, they are not widely used. This paper proposes
Research Interests:
Persistent computing systems are an infrastructure of computing anticipatory systems. The reactability of a persistent computing system, which is how many reactions of the system are active at a certain time, is the most important... more
Persistent computing systems are an infrastructure of computing anticipatory systems. The reactability of a persistent computing system, which is how many reactions of the system are active at a certain time, is the most important property to characterize the system. On the other hand, to be anticipatory, the reactability of a computing anticipatory system must be continuous. This paper proposes the first method to measure the continuous reactability of a persistent computing system in a unified way. The continuous reactability of a persistent computing system is a new concept of computing systems, so that it will be raise new research problems of computing anticipatory systems as well as persistent computing systems.
A common inadequacy of current knowledge-based systems is that they cannot reason about those situations and/or problems that have not been considered by their developers. A major cause of this inadequacy is that the system cannot... more
A common inadequacy of current knowledge-based systems is that they cannot reason about those situations and/or problems that have not been considered by their developers. A major cause of this inadequacy is that the system cannot automatically generate new and valid reasoning rules from those existing rules and facts that re programmed or inputted in the systems by their developers or users. On the other hand, the lack of formal and rigorous verification technique is a major reason of that many experimental knowledge-based systems cannot be reliably used in practices for solving business and industrial problems. Both reasoning rule generation and reasoning rule verification require a domain-independent fundamental theory to underlie justifications. This paper investigates the issues of reasoning rule generation and verification in knowledge-based systems from a logical viewpoint. The paper points out that various existent logic systems fail to serve as the fundamental theory underl...
Research Interests:
Research Interests:
Formal analysis of cryptographic protocols is to find out flaws in the protocols by various formal methods. Some supporting tools for formal analysis of cryptographic protocols have been proposed and applied, but the tools failed to... more
Formal analysis of cryptographic protocols is to find out flaws in the protocols by various formal methods. Some supporting tools for formal analysis of cryptographic protocols have been proposed and applied, but the tools failed to support the whole processes of formal analysis automatically. Therefore, a supporting environment which can support formal analysis automatically is needed for analysts. This paper presents the first supporting environment for formal analysis of cryptographic protocols.
Research Interests:
The most important component of an anticipatory reasoning-reacting system is its anticipatory reasoning engine (ARE). This paper presents requirements for ARE and our prototype implementation of an ARE. First we explain anticipatory... more
The most important component of an anticipatory reasoning-reacting system is its anticipatory reasoning engine (ARE). This paper presents requirements for ARE and our prototype implementation of an ARE. First we explain anticipatory reasoning. Next, we analyze the requirements for ARE, design the functions of ARE, discuss implementation issues, and present our implementation techniques. Finally we show some current experimental results. We also discuss how an anticipatory reasoning-reacting system get effective prediction with the ARE.
E-voting is an electronic way to provide voting processes beginning from preparing ballots, following by authenticating voters and candidate registrations, through casting votes, and ending to tallying and declaring collected answers.... more
E-voting is an electronic way to provide voting processes beginning from preparing ballots, following by authenticating voters and candidate registrations, through casting votes, and ending to tallying and declaring collected answers. Nowadays, there are many kinds of e-voting systems implemented to provide e-voting services over the Internet. However, there is no ad hoc method to cover the gap caused by difficult communications. QSL is a specification language for e-questionnaire systems that serves as a communication tool for specifying e-questionnaires and e-questionnaire systems. QSL is an ideal candidate because of similar processes between e-questionnaire and e-voting. The current version of QSL is reckoned without e-voting and e-voting systems. This paper proposes an extension of QSL for specifying e-voting and e-voting systems, and presents two cases using QSL for e-voting systems to show its effectiveness.
Research Interests:
In order to provide scientists with a computational methodology and some computational tools to program their epistemic processes in scientific discovery, we are establishing a novel programming paradigm, named ‘Epistemic Programming’,... more
In order to provide scientists with a computational methodology and some computational tools to program their epistemic processes in scientific discovery, we are establishing a novel programming paradigm, named ‘Epistemic Programming’, which regards conditionals as the subject of computing, takes primary epistemic operations as basic operations of computing, and regards epistemic processes as the subject of programming. This paper presents our fundamental observations and assumptions on scientific discovery processes and their automation, research problems on modeling, automating, and programming epistemic processes, and an outline of our research project of epistemic Programming.
Research Interests:
In order to provide scientists with a computational methodology and some computational tools to program their epistemic processes in scientific discovery, we are establishing a novel programming paradigm, named 'Epistemic... more
In order to provide scientists with a computational methodology and some computational tools to program their epistemic processes in scientific discovery, we are establishing a novel programming paradigm, named 'Epistemic Programming', which regards conditionals as the subject of computing, takes primary epistemic operations as basic operations of computing, and regards epistemic processes as the subject of programming. This paper presents our fundamental observations and assumptions on scientific discovery processes and their automation, research problems on modeling, automating, and programming epistemic processes, and an outline of our research project of Epistemic Programming.
Research Interests:
ABSTRACT ISO/IEC 15408, one of international security standards, plays an important role to ensure whole security of information/software systems. Software supportable tasks related with ISO/IEC 15408 have been analyzed as a basic to... more
ABSTRACT ISO/IEC 15408, one of international security standards, plays an important role to ensure whole security of information/software systems. Software supportable tasks related with ISO/IEC 15408 have been analyzed as a basic to construct an information security engineering environment (ISEE). However, it does not clarify what kinds of supporting tools are necessary for those software supportable tasks. In order to provide practical support, it is necessary to provide various supporting tools for the tasks. This paper analyzes deeply the software supportable tasks related with ISO/IEC 15408, analyzed requirements of supporting tools, and proposes a series of supporting tools for the tasks as the core of ISEE. These tools can be integrated to provide comprehensives facilities to perform the tasks consistently and continuously related with ISO/IEC 15408.
Research Interests:
With the scale-spreading and diversification of information systems, security requirements for the systems are being more and more complicated. It is desirable to apply database technologies to information security engineering in order to... more
With the scale-spreading and diversification of information systems, security requirements for the systems are being more and more complicated. It is desirable to apply database technologies to information security engineering in order to manage the security requirements in design and development of the systems. This paper proposes a security requirement management database based on the international standard ISO/IEC 15408 that
Research Interests:
Research Interests:
In many applications in computer science and artificial intelligence, logical formulas are used as a formal representation to represent and/or specify various objects and relationships among them. Transforming logical formulas into... more
In many applications in computer science and artificial intelligence, logical formulas are used as a formal representation to represent and/or specify various objects and relationships among them. Transforming logical formulas into informal propositional statements, e.g., declarative sentences and mathematical formulas, is important as well as transforming informal propositional statements into logical formulas. When people obtain new logical formulas as results of deduction/reasoning based on logic, investigating the obtained formulas is also not an easy task for them. Although information systems with proving, e.g., automated theorem proving systems, formal verification systems, etc., are used in various field, in the future, information systems with reasoning, e.g., automated theorem finding systems, will also be developed and used in various fields. Thus, a tool to support bidirectional transformation between informal propositional statements and logical formulas will be demanded at that time. This paper presents an implementation of a bidirectional transformation supporting tool for formalization with logical formulas. The paper also shows application of the tool in a case study of automated theorem finding with forward reasoning.
Research Interests:
In many applications in computer science and artificial intelligence, logical formulas are used as a formal representation to represent and/or specify various objects and relationships among them. However, transforming the informal... more
In many applications in computer science and artificial intelligence, logical formulas are used as a formal representation to represent and/or specify various objects and relationships among them. However, transforming the informal propositional statements, e.g., declarative sentences and mathematical formulas, into logical formulas is not an easy task for most people. Moreover, when people obtain new logical formulas as results of deduction/reasoning based on logic, investigating the obtained formulas is also not an easy task for them. Although a tool to support transformation from the informal propositional statements of a target domain into logical formulas, and vice versa, is demanded, there is no such tool until now. This paper presents a bidirectional transformation method for formalization with logical formulas, and its supporting tool we are developing.
Research Interests:
Research Interests: Computer Science, Software Engineering, Software Maintenance, Logic Programming, Parallel Programming, and 10 moreSoftware Testing, Flow Control, Software Measurement, Program Slicing, Software Metrics, Parallel & Distributed Computing, Formal Model, Dependence Analysis, Debugging, and Application Software
The problem of automated theorem finding is one of 33 basic research problems in automated reasoning which was originally proposed by Wos in 1988, and it is still an open problem. The problem implicitly requires some metrics to be used... more
The problem of automated theorem finding is one of 33 basic research problems in automated reasoning which was originally proposed by Wos in 1988, and it is still an open problem. The problem implicitly requires some metrics to be used for measuring interestingness of found theorems. However, no one addresses that requirement until now. This paper proposes the first set of metrics for measuring interestingness of theorems. The paper also presents a case study in NBG set theory, in which we use the proposed metrics to measure the interestingness of the theorems of NBG set theory obtained by using forward reasoning approach and confirms the effectiveness of the metrics.
Research Interests:
A common inadequacy of current knowledge-based systems is that they cannot reason about those situations and/orproblems that have not been considered by their developers. A major cause of this inadequacy is that the system... more
A common inadequacy of current knowledge-based systems is that they cannot reason about those situations and/orproblems that have not been considered by their developers. A major cause of this inadequacy is that the system cannotautomatically generate new and valid reasoning rules from those existing rules and facts that are programmed or inputted inthe systems by their developers or users. On
Research Interests:
In many applications in computer science and artificial intelligence, in order to represent, specify, verify, and reason about various objects and relationships among them, we often need a right fundamental logic system to provide us with... more
In many applications in computer science and artificial intelligence, in order to represent, specify, verify, and reason about various objects and relationships among them, we often need a right fundamental logic system to provide us with a criterion of logical validity for ...
Research Interests:
Any scientific discovery must include an epistemic process to gain knowledge of or to ascertain the existence of some empirical and/or logical entailments previously unknown or unrecognized. The epistemic operation of deduction in an... more
Any scientific discovery must include an epistemic process to gain knowledge of or to ascertain the existence of some empirical and/or logical entailments previously unknown or unrecognized. The epistemic operation of deduction in an epistemic process of an agent is to find new and valid entailments logically from some premises which are known facts and/or assumed hypothesis. Automated theorem finding
Research Interests:
The hot controversy about the role of logic in AI has been repeated so far and probably will continue on as usual. An important fact is that the "logic" as the center of the controversy is classical mathematical logic and/or its... more
The hot controversy about the role of logic in AI has been repeated so far and probably will continue on as usual. An important fact is that the "logic" as the center of the controversy is classical mathematical logic and/or its various extensions, though there are some "more logical" logic systems. Until recently, what is debated by the researchers working
Research Interests:
ISO/IEC 15408 and ISO/IEC 18045 are a pair of international standards for security evaluation and certification of IT systems. However, security evaluation based on this pair of standards is not an easy work. There are many activities and... more
ISO/IEC 15408 and ISO/IEC 18045 are a pair of international standards for security evaluation and certification of IT systems. However, security evaluation based on this pair of standards is not an easy work. There are many activities and documents in the whole evaluation process. Complicated tasks in evaluation process may cause people making mistakes in intermediate products and evaluation results. It is also difficult to ensure that evaluation is fair and transparent, although each evaluator tries to evaluate a target system earnestly, evaluation results may be different because of evaluators’ biases. Moreover, to manage a lot of intermediate products in evaluation process is not easy task even for experienced evaluators. This paper presents a supporting environment for IT system security evaluation based on ISO/IEC 15408 and ISO/IEC 18045 which can support all tasks related to security evaluation by guiding and helping evaluators to perform these tasks regularly, and also can support the management of all documents and intermediate products in the whole evaluation process.
Research Interests:
Any scientific discovery must include an epistemic process to gain knowledge of or to ascertain the existence of some empirical and/or logical entailments previously unknown or unrecognized. This paper proposes a new programming paradigm,... more
Any scientific discovery must include an epistemic process to gain knowledge of or to ascertain the existence of some empirical and/or logical entailments previously unknown or unrecognized. This paper proposes a new programming paradigm, named epistemic programming, which regards entailments as the subject of computing, takes three primary epistemic operations, i.e., epistemic deduction of knowledge, epistemic expansion of knowledge, and
Research Interests:
A good design, development, and maintenance methodology for concurrent systems must be based on a good recognition and/or understanding of the intrinsic characteristics of concurrent systems. Measuring and monitoring the behavior of a... more
A good design, development, and maintenance methodology for concurrent systems must be based on a good recognition and/or understanding of the intrinsic characteristics of concurrent systems. Measuring and monitoring the behavior of a complex concurrent system is an indispensable way to achieve the reliability of the system. Based on recognition and/or understanding of the wholeness principle of concurrent systems and
Research Interests:
The problem of automated theorem finding is one of 33 basic research problems in automated reasoning which was originally proposed by Wos. The problem is still an open problem until now. Specific knowledge is the power of any scientist,... more
The problem of automated theorem finding is one of 33 basic research problems in automated reasoning which was originally proposed by Wos. The problem is still an open problem until now. Specific knowledge is the power of any scientist, therefore, if a scientist in a particular area takes part in the process of automated theorem finding, then the scientist should certainly make some contributions for automated theorem finding in the target area. Epistemic programming was proposed as a novel program paradigm to program epistemic processes of scientific discovery, which regards conditionals as the subject of computing, takes primary epistemic operations as basic operations of computing, and regards epistemic processes as the subject of programming. Epistemic programming provides not only programming means but also interactive means for scientists to control cognitive processes. This paper proposes an epistemic programming approach for automated theorem finding following the epistemic programming paradigm and shows some examples to do automated theorem finding by using the approach.
Questionnaire is a general and indispensable method used frequently and widely in many academic, engineering, medical, commercial and political survey research activities to collect information about opinion or behavior of some groups of... more
Questionnaire is a general and indispensable method used frequently and widely in many academic, engineering, medical, commercial and political survey research activities to collect information about opinion or behavior of some groups of people. Today, many questionnaires are performed on the Internet by some ways of web applications. However, until now, there is no questionnaire specification language that can be used to specify various e-questionnaire systems. This paper proposes the first specification language named “QSL” for various e-questionnaire systems. QSL can be used to specify not only various questionnaires but also various e-questionnaire systems. The paper presents an analysis of the primitive elements of questionnaires and e-questionnaire systems, defines the specification language QSL, and discusses its completeness and effectiveness.
Research Interests:
Research Interests:
1. Introduction A fundamental logic is indispensable for knowledge engineering to make various activities of construction, maintenance, and application of knowledge-based systems achievable within a uniform formal framework. As a... more
1. Introduction A fundamental logic is indispensable for knowledge engineering to make various activities of construction, maintenance, and application of knowledge-based systems achievable within a uniform formal framework. As a conceptual tool underlying the activities, the logic should be as natural as possible for human logical thinking. iViany current theoretical research on knowledge engineering is based directly or indirectly on cassical mathematical logic or its various extensions. However, the mathematical logic is not a natural model of human IogicaI thinking. ~[his paper proposes a new research direction for knowledge engineering: using entailment logic as t]ae fundamental logic of knowledge engineering rather than mathematical logic. The paper discusses requirements for the fundamental logic f::om the viewpoint that logic should be used as a fundamental tool to reason new and valid l~nowledge from known or assumed premises, ~oints out some pragmatical problems in the raathematical logic, explains why those pragmatical problems do not exist in the entaihnent logic, and shows that the entailment logic is better than the mathematical logic as a fundamental logical tool of knowledge engineering. Some new, important and challenging research problems are also set out. Permission to copy without fee all or part of this material is granted pro-vid~t that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Asscciation for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. The role of logic in the field of artificial intelligence is a controversial problem. The "logic", which is the center of controversy, seems to be classical mathematical logic, though there are some "more logical" logic systems. Until now, what is debated by AI researchers is what role does the mathematical logic play in knowledge representation and reasoning [11,12,17]. What is logic? Logic deals with what entails what, in other words, what follows from what. It is a systematic study of fundamental principles underlying valid, necessary, and sufficient reasoning that is used to get new and valid knowledge from some known or assumed premises. As a fundamental tool of such reasoning, logic must abstract the form of the reasoning from its content. Therefore, the validity of reasoning depends neither on what the reasoning is about nor on whether the premises and conclusion of the reasoning is true …
Research Interests:
Intention (and its change, if any) is an indispensable step in the process from belief to action in various types of human behavior. Although the notion of intention has been originally investigated in philosophy and psychology at first,... more
Intention (and its change, if any) is an indispensable step in the process from belief to action in various types of human behavior. Although the notion of intention has been originally investigated in philosophy and psychology at first, and then was modeled and formalized in Artificial Intelligence, traditional research has focused so much attention on the static properties of intention, but its dynamic properties have received much less attention. However, in a changing world, intention of an agent may be changed before it leads into a real action and the last change and/or intention just before the real action is the most important in almost all cases. In order to provide a computational foundation for various advanced application systems where the key requirement is to accurately grasp intentions of agents/users just before their actions, this position paper proposes a new research direction: Computing intentions dynamically in a changing world by anticipatory relevant reasoning.