Hitoshi Ohsaki

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