Hitoshi Ohsaki

Publication Activity (10 Years)

Years Active: 1996-2014
Publications (10 Years): 0

Top Topics

Formal Language

Owl Dl Ontology

Formal Semantics

Top Venues

Formal Aspects Comput.

Publications

Eun-Hye Choi, Hideaki Nishihara, Takahiro Ando, Nguyen Van Tang, Masahiro Aoki, Keiichi Yoshisaka, Osamu Mizuno, Hitoshi Ohsaki
Formal Specification Based Automatic Test Generation for Embedded Network Systems. J. Appl. Math. 2014 (2014)
Yoriyuki Yamagata, Weiqiang Kong, Akira Fukuda, Nguyen Van Tang, Hitoshi Ohsaki, Kenji Taguchi
A formal semantics of extended hierarchical state transition matrices using CSP#. Formal Aspects Comput. 26 (5) (2014)
Thi Bich Ngoc Do, Takashi Kitamura, Nguyen Van Tang, Goro Hatayama, Shinya Sakuragi, Hitoshi Ohsaki
Constructing test cases for n-wise testing from tree-based test models. SoICT (2013)
Yoriyuki Yamagata, Weiqiang Kong, Akira Fukuda, Nguyen Van Tang, Hitoshi Ohsaki, Kenji Taguchi
Formal semantics of extended hierarchical state transition matrix by CSP. ACM SIGSOFT Softw. Eng. Notes 37 (4) (2012)
Weiqiang Kong, Leyuan Liu, Yoriyuki Yamagata, Kenji Taguchi, Hitoshi Ohsaki, Akira Fukuda
On Accelerating SMT-based Bounded Model Checking of HSTM Designs. APSEC (2012)
Nguyen Van Tang, Hitoshi Ohsaki
On Model Checking for Visibly Pushdown Automata. LATA (2012)
Ling Fang, Takashi Kitamura, Thi Bich Ngoc Do, Hitoshi Ohsaki
Formal Model-Based Test for AUTOSAR Multicore RTOS. ICST (2012)
Nguyen Van Tang, Daisuke Souma, Goro Hatayama, Hitoshi Ohsaki
Modeling and Validating the Train Fare Calculation and Adjustment System Using VDM++. VSTTE (2012)
Takashi Kitamura, Thi Bich Ngoc Do, Hitoshi Ohsaki, Ling Fang, Shunsuke Yatabe
Test-Case Design by Feature Trees. ISoLA (1) (2012)
Nguyen Van Tang, Hitoshi Ohsaki
Checking On-the-Fly Universality and Inclusion Problems of Visibly Pushdown Automata. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (12) (2011)
Naoki Kobayashi, Hitoshi Ohsaki
Tree Automata for Non-linear Arithmetic. RTA (2008)
Joe Hendrix, Hitoshi Ohsaki
Combining Equational Tree Automata over AC and ACI Theories. RTA (2008)
Hitoshi Ohsaki, Hiroyuki Seki
Languages Modulo Normalization. FroCoS (2007)
Joe Hendrix, José Meseguer, Hitoshi Ohsaki
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms. IJCAR (2006)
Joe Hendrix, Hitoshi Ohsaki, Mahesh Viswanathan
Propositional Tree Automata. RTA (2006)
Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos
Monotone AC-Tree Automata. LPAR (2005)
Hitoshi Ohsaki, Toshinori Takai
ACTAS : A System Design for Associative and Commutative Tree Automata Theory. Electron. Notes Theor. Comput. Sci. 124 (1) (2005)
Hitoshi Ohsaki, Hiroyuki Seki, Toshinori Takai
Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism. RTA (2003)
Hitoshi Ohsaki, Toshinori Takai
Decidability and Closure Properties of Equational Tree Languages. RTA (2002)
Hitoshi Ohsaki
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories. CSL (2001)
Aart Middeldorp, Hitoshi Ohsaki
Type Introduction for Equational Rewriting. Acta Informatica 36 (12) (2000)
Hitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl
Equational Termination by Semantic Labelling. CSL (2000)
Hitoshi Ohsaki, Aart Middeldorp
Type Introduction for Equational Rewriting. LFCS (1997)
Aart Middeldorp, Hitoshi Ohsaki, Hans Zantema
Transforming Termination by Self-Labelling. CADE (1996)