2 citations · 4 across the 8 of their papers we have counts for
8 papers
Construction of a DFA for Computing Grundy Numbers in the Successful Derivation Games on Right-Linear Grammars
Yoshiaki Takata, Yusuke Inoue, Hiroyuki Seki
Inoue et al. have introduced the successful derivation game (SDG) on context-free grammars (CFGs), which is a generalization of classic heap-based games including subtraction games…
A game-theoretic approach to indistinguishability of winning objectives as user privacy
Rindo Nakanishi, Yoshiaki Takata, Hiroyuki Seki
Game theory on graphs is a basic tool in computer science. In this paper, we propose a new game-theoretic framework for studying the privacy protection of a user who interactively…
Reduction of Register Pushdown Systems with Freshness Property to Pushdown Systems in LTL Model Checking
Yoshiaki Takata, Ryoma Senda, Hiroyuki Seki
Pushdown systems (PDS) are known as an abstract model of recursive programs, and model checking methods for PDS have been studied. Register PDS (RPDS) are PDS augmented by register…
Complexity Results on Register Pushdown Automata
Ryoma Senda, Yoshiaki Takata, Hiroyuki Seki
Register pushdown automata (RPDA) is an extension of classical pushdown automata to handle data values in a restricted way. RPDA attracts attention as a model of a query language f…
On the Compositionality of Dynamic Leakage and Its Application to the Quantification Problem
Bao Trung Chu, Kenji Hashimoto, Hiroyuki Seki
Quantitative information flow (QIF) is traditionally defined as the expected value of information leakage over all feasible program runs and it fails to identify vulnerable program…
Quantifying Dynamic Leakage: Complexity Analysis and Model Counting-based Calculation
Bao Trung Chu, Kenji Hashimoto, Hiroyuki Seki
A program is non-interferent if it leaks no secret information to an observable output. However, non-interference is too strict in many practical cases and quantitative information…
An Extension of Proof Graphs for Disjunctive Parameterised Boolean Equation Systems
Yutaro Nagae, Masahiko Sakai, Hiroyuki Seki
A parameterised Boolean equation system (PBES) is a set of equations that defines sets as the least and/or greatest fixed-points that satisfy the equations. This system is regarded…
Node Query Preservation for Deterministic Linear Top-Down Tree Transducers
Kazuki Miyahara, Kenji Hashimoto, Hiroyuki Seki
This paper discusses the decidability of node query preservation problems for XML document transformations. We assume a transformation given by a deterministic linear top-down data…