| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| SS | 2024-03-07 11:25 |
Okinawa | (Primary: On-site, Secondary: Online) |
Development of a Framework for Implementing OTP Applications with Rust Reiji Okamoto, Yoshiaki Takata (KUT)  SS2023-51 |
Concurrent programming with the green threads in the programming language Rust is very costly for reasons such as the po... [more] | SS2023-51 pp.13-18 |
| SS, DC | 2023-10-12 10:00 |
Nagano | (Primary: On-site, Secondary: Online) |
A game-theoretic approach to indistinguishability of winning objectives as user privacy Rindo Nakanishi (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) SS2023-27 DC2023-33 |
We propose a new game-theoretic framework for studying the privacy protection of a user who interactively uses a softwa... [more] |
SS2023-27 DC2023-33 pp.32-37 |
| MSS, SS | 2023-01-10 14:30 |
Osaka | (Primary: On-site, Secondary: Online) |
Toward Automatic Generation of an Optimal Supervision Tree in Erlang Shoichi Sasaki, Yoshiaki Takata (KUT) MSS2022-46 SS2022-31 |
Erlang is a concurrency-oriented functional programming language that comes standard with lightweight processes that are... [more] | MSS2022-46 SS2022-31 pp.7-12 |
| DC, SS | 2022-10-25 11:15 |
Fukushima | (Primary: On-site, Secondary: Online) |
SS2022-24 DC2022-30 |
Nominal set plays a central role in a group-theoretic extension of finite automata to those over an infinite set of data... [more] | SS2022-24 DC2022-30 pp.16-21 |
| SS, DC | 2021-10-19 15:25 |
Online | Online | A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Register Automata Akira Onishi, Ryoma Senda (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) SS2021-17 DC2021-22 |
Register automaton (abbreviated as RA) is an extension of finite automaton by adding registers storing data values. RA ... [more] |
SS2021-17 DC2021-22 pp.23-28 |
| SS | 2021-03-03 10:25 |
Online | Online | A Subclass of LTL with the Freeze Quantifier Translatable into Register Automata Akira Onishi, Ryoma Senda (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) SS2020-29 |
Register automaton (abbreviated as RA) is an extension of finite automaton by adding registers storing data values. RA ... [more] |
SS2020-29 pp.7-12 |
| MSS, SS | 2021-01-27 15:25 |
Online | Online | Pumping Lemmas for Languages Expressed by Computational Models with Registers Rindo Nakanishi, Ryoma Senda (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) MSS2020-41 SS2020-26 |
Register automaton (RA), register context-free grammar (RCFG), and register tree automaton (RTA) are computational model... [more] | MSS2020-41 SS2020-26 pp.72-77 |
| DC, SS | 2020-10-19 13:25 |
Online | Online | LTL Model Checking for Register Pushdown Systems Ryoma Senda (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) SS2020-6 DC2020-23 |
A pushdown system (PDS) is known as an abstract model of recursive programs. For PDS, model checking methods have been ... [more] |
SS2020-6 DC2020-23 pp.7-12 |
| DC, SS | 2019-10-24 14:30 |
Kumamoto | Kumamoto Univ. | Computing Optimal Weight in Weighted Register Automata and Related Decision Problems Reo Yoshimura (Nagoya Univ.), Yoshiaki Takata (Kochi-tech.), Hiroyuki Seki (Nagoya Univ.) SS2019-16 DC2019-44 |
Register automaton (RA) is a computational model that can handle data values by adding registers to finite automaton. Re... [more] | SS2019-16 DC2019-44 pp.19-24 |
| MSS, SS | 2017-01-26 16:20 |
Kyoto | Kyoto Institute of Technology | A system for autocompleting a partial Web GUI testing code with user interaction capturing Manabu Nakajima, Yoshiaki Takata (Kochi Univ. of Tech.) MSS2016-66 SS2016-45 |
Programmable testing and capture-replay testing are two main categories of Web GUI testing. In the programmable testing,... [more] | MSS2016-66 SS2016-45 pp.53-57 |
| SS | 2013-01-11 10:15 |
Okinawa | Detection of refactoring targets using a design pattern detection tool Yasuo Yamasaki, Yoshiaki Takata (KUT) |
Refactoring of object-oriented source code using design patterns is one of the promising methods to improve its maintain... [more] | SS2012-55 pp.55-60 |
|
| SS | 2012-05-11 10:00 |
Ehime | Ehime Univ. | A Weighted-Pushdown-System-Based Formal Model for Information-Based Access Control Pablo Lamilla Alvarez, Yoshiaki Takata (Kochi Univ. of Tech.) SS2012-7 |
Information-Based Access Control (IBAC) has been proposed as an improvement to History-Based Access Control (HBAC) model... [more] | SS2012-7 pp.37-42 |
| SS, MSS | 2012-01-26 10:00 |
Kochi | Kochi City Culture-Plaza Cul-Port | A smartphone-based programming environment for a physical computing platform Yuka Kamimura, Yoshiaki Takata (KUT) MSS2011-55 SS2011-40 |
Physical computing, which is an approach to educating computers and studying human-computer interaction through develo... [more] |
MSS2011-55 SS2011-40 pp.3-8 |
| SS | 2009-08-07 09:00 |
Hokkaido | Kitami Institute of Technology | Automatic Generation of Access Control Command from Information Flow Specification Yoshimasa Morita, Yoshiaki Takata (Kochi Univ. of Tech.), Hiroyuki Seki (NAIST) SS2009-23 |
Stack inspection is an access control mechanism that prevents untrusted modules from accessing important resources. In t... [more] | SS2009-23 pp.65-70 |
| SS | 2008-12-19 11:15 |
Kochi | Kochi Univiersity of Technology | XML Processing Techniqes Based on Tree Automata Yoshiaki Takata (Kochi Univ. of Tech.), Hiroyuki Seki (Nara Inst. of Scei and Tech.) SS2008-46 |
Tree automata, which are finite automata over trees, have been investigated in various research areas for a long time. ... [more] | SS2008-46 pp.43-50 |
| SS | 2007-02-01 13:40 |
Aichi | Aichi Prefectural Univ. | Information flow analysis using model checking for history-based access control programs Jing Wang, Nobuhiro Itoh, Yoshiaki Takata, Hiroyuki Seki (NAIST) |
[more] | SS2006-72 pp.7-12 |
| SS | 2006-08-04 11:00 |
Hokkaido | Hokkaido University | An Efficient Model Checking Method for Programs with History-based Access Control Jing Wang, Yoshiaki Takata, Hiroyuki Seki (NAIST) |
我々は、実行履歴に基づくアクセス制御を含む再帰プログラムの形式モデルHBACプログラムを提案し、HBACプログラムのモデル検査法について考察してきた。本発表では、提案するモデル検査法におけるいくつかの最適化手法を述べる。また、実装した検証ツ... [more] | SS2006-38 pp.23-28 |
| SS | 2005-10-14 10:00 |
Saitama | Jumonji University | A New Architecture for Trust Management with User Presence Jun Noda (NEC), Hisashi Mouri (NAIST), Yoshiaki Takata, Hiroyuki Seki (NEC/NAIST), Daigo Taguchi, Mie Takahashi, Itaru Hosomi (NEC) |
This paper proposes a flexible trust management method that assigns a trust to the user based on digital certificates as... [more] | SS2005-50 pp.13-18 |
| SS | 2005-06-24 09:00 |
Nagano | Shinshu Univ. Ohta-Kokusai-Kinenkan | A Static Analysis using Tree Automata for XML Access Control Isao Yagi, Yoshiaki Takata, Hiroyuki Seki (NAIST) |
Recently, an access control for XML database is one of the key issues in database security. Given an access control po... [more] |
SS2005-18 pp.1-6 |
| SS | 2005-06-24 10:00 |
Nagano | Shinshu Univ. Ohta-Kokusai-Kinenkan | A Formal Model for Stateful Trust Management Systems Hisashi Mouri, Yoshiaki Takata, Hiroyuki Seki (NAIST) |
[more] | SS2005-20 pp.13-18 |
[Return to Top Page]