Papers - NITTA Naoya
-
Development of a 3D game engine Radish and its application to architecture comparisons
新田 直也, 久野 剛司, 久米 出
Journal of digital games research 4 ( 1 ) 1 - 12 2010
-
3Dゲーム開発プロジェクト演習の実践とその評価
新田直也, 久野剛司
甲南大学紀要 知能情報学部編 2 ( 2 ) 225 - 232 2009.11
Joint Work
Authorship：Lead author
-
A Practice of Collaborative Project-Based Learning for Mutual Edification between Programming Skill and Artistic Craftsmanship Reviewed
Naoya Nitta, Izuru Kume, Yasuhiro Takemura
Proceedings of the 39th ASEE/IEEE Frontiers in Education Conference 2009.10
Joint Work
Authorship：Lead author
-
エンピリカルなソフトウェア工学教育を目的とした3Dゲーム用アプリケーションフレームワークの開発
新田直也, 久米出, 武村泰宏
甲南大学紀要 知能情報学部編 1 ( 2 ) 181 - 195 2008.11
Joint Work
Authorship：Lead author
-
An Extension of Object Oriented Programming for Structural Changes in System Design
Naoya Nitta, Izuru Kume, Yasuhiro Takemura
日本情報経営学会誌 28 ( 2 ) 43 - 53 2007.12
Joint Work
Authorship：Lead author
-
An Experiment to Explore Practical Training for Object-Oriented Design Novices
Izuru Kume, Naoya Nitta, Yasuhiro Takemura
Technical Report NAIST-IS-TR2007009, Nara Institute of Science and Technology 2007.5
Joint Work
-
A Method for Creating Teaching Materials of Practical Object-Oriented Methods Education Reviewed
Izuru Kume, Naoya Nitta,Yoshiaki Takemura
Proceedings of the 14th International Conference on Computers in Education 75 - 78 2006.12
Joint Work
-
A Method for Creating Teaching Materials of Practical Object-Oriented Methods Education.
Izuru Kume, Naoya Nitta, Yasuhiro Takemura
Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding, Proceeding of the 14th International Conference on Computers in Education, ICCE 2006, November 30 - December 4, 2006, Beijing, China 75 - 78 2006
Joint Work
Publisher：IOS Press
Other Link： http://dblp.uni-trier.de/db/conf/icce/icce2006.html#conf/icce/KumeNT06
-
An Efficient Method for Optimal Probe Deployment of Distributed IDS Reviewed
Jing Wang, Naoya Nitta, Hiroyuki Seki
IEICE Transactions on Information and Systems E88-D ( 8 ) 1948 - 1957 2005.8
Joint Work
-
An efficient method for optimal probe deployment of distributed IDS
J Wang, N Nitta, H Seki
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E88D ( 8 ) 1948 - 1957 2005.8
Joint Work
Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
A distributed network-oriented Intrusion Detection System (IDS) is a mechanism which detects misuse accesses to an intranetwork by distributed IDSs on the network with decomposed attack scenarios. However, there are only ad hoc algorithms for determining a deployment of distributed IDSs and a partition of the attack scenarios. In this paper, we formally define this problem as the IDS partition deployment problem and design an efficient algorithm for a simplified version of the problem by graph theoretical techniques.
-
LTL Model Checking for Extended Pushdown Systems with Regular Tree Valuations Reviewed
Naoya Nitta, Hiroyuki Seki
コンピュータソフトウェア 22 ( 3 ) 58 - 75 2005.7
Joint Work
Authorship：Lead author
-
Policy Controlled System and Its Model Checking Reviewed
Sigeta Kuninobu, Yoshiaki Takata, Naoya Nitta, Hiroyuki Sek
IEICE Transactions on Information and Systems E88-D ( 7 ) 1685 - 1696 2005.7
Joint Work
-
Policy controlled system and its model checking
S Kuninobu, Y Takata, N Nitta, H Seki
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS E88D ( 7 ) 1685 - 1696 2005.7
Joint Work
Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
A policy is an execution rule (or constraint) for objects in a system to retain security and integrity of the system. We introduce a simple policy specification language and define its operational semantics. A new NFA construction algorithm that works in linear time is proposed and a model checking method for policy controlled system (PCS) is presented. We conducted verification of a sample PCS for hotel reservation by our automatic verification tool and the experimental results showed the efficiency of the proposed method.
-
LTL Model Checking for Extended Pushdown Systems with Regular Tree Valuations
Naoya Nitta, Hiroyuki Seki
Computer Software 22 ( 3 ) 58 - 75 2005
Joint Work
Publisher：日本ソフトウェア科学会
In this paper, we show an algorithm of LTL (linear temporal logic) model checking for LL-GG-TRS with regular tree valuation. The class LL-GG-TRS is defined as a subclass of term rewriting systems, and extends the class of pushdown systems (PDS) in the sence that pushdown stack of PDS is extended to tree structure. By this extension, we can model recursive programs with exception handling. © 2005, Japan Society for Software Science and Technology. All rights reserved.
-
An Extension of Pushdown System and Its Model Checking Method Reviewed
Naoya Nitta, Hiroyuki Seki
Proceedings of the 14th International Conference on Concurrency Theory 281 - 295 2003.9
Joint Work
Authorship：Lead author
-
An Extension of Pushdown System and Its Model Checking Method
Naoya Nitta, Hiroyuki Seki
Technical Report NAIST-IS-TR2003007, Nara Institute of Science and Technology 2003.6
Single Work
Authorship：Lead author
-
An Extension of Pushdown System and Its Model Checking Method.
Naoya Nitta, Hiroyuki Seki
CONCUR 2003 - Concurrency Theory, 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings 278 - 292 2003
-
スタック検査機能を持つプログラムに対する効率のよいセキュリティ検証法 Reviewed
新田 直也, 高田 喜朗, 関 浩之
コンピュータソフトウェア 19 ( 3 ) 20 - 38 2002.5
Joint Work
Authorship：Lead author
-
スタック検査機能を持つプログラムに対するセキュリティ検証問題の決定可能性 Reviewed
新田 直也, 高田 喜朗, 関 浩之
電子情報通信学会論文誌(D-I) J85-D-I ( 4 ) 360 - 370 2002.4
Joint Work
Authorship：Lead author
-
Decidability of the Security Verification Problem for Programs with Stack Inspection
NITTA Naoya, TAKATA Yoshiaki, SEKI Hiroyuki
The Transactions of the Institute of Electronics,Information and Communication Engineers. 85 ( 4 ) 360 - 370 2002.4
Joint Work
Publisher：電子情報通信学会
Java development kit 1.2のように,プログラム実行時に制御スタックを検査することでアクセス制御を行うようなプログラム環境がある.Jensenらは,プログラム P 及び時相論理式を用いて記述された検証条件 ψ を与えたときに,P の到達可能な状態すべてが ψ を満たすかどうかを決定する問題として検証問題を定義し,相互再帰を含まないプログラムのクラスに対して検証問題が決定可能となることを示した. 本論文では,時相論理式よりも真に表現能力の大きい正規言語を用いて検証問題を定義する.そして,プログラムのトレース集合がインデックス言語となることを示し,その系としてプログラムが相互再帰を含む場合も含めて検証問題が一般に決定可能となることを示すことにより,Jensenらの結果を改善する.更に,自明なスタック検査のみを含むプログラムのクラスに対する検証問題が,プログラムサイズに対して多項式時間可解であることを示す.