Hitoshi Ohsaki

According to our database, Hitoshi Ohsaki authored at least 23 papers between 1996 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2014

Formal Specification Based Automatic Test Generation for Embedded Network Systems.

Eun-Hye Choi, Hideaki Nishihara, Takahiro Ando, Nguyen Van Tang, Masahiro Aoki, Keiichi Yoshisaka, Osamu Mizuno, Hitoshi Ohsaki

J. Appl. Math., 2014

A formal semantics of extended hierarchical state transition matrices using CSP#.

Yoriyuki Yamagata, Weiqiang Kong, Akira Fukuda, Nguyen Van Tang, Hitoshi Ohsaki, Kenji Taguchi

Formal Aspects Comput., 2014

2013

Constructing test cases for n-wise testing from tree-based test models.

Thi Bich Ngoc Do, Takashi Kitamura, Nguyen Van Tang, Goro Hatayama, Shinya Sakuragi, Hitoshi Ohsaki

Proceedings of the 4th International Symposium on Information and Communication Technology, 2013

2012

Formal semantics of extended hierarchical state transition matrix by CSP.

Yoriyuki Yamagata, Weiqiang Kong, Akira Fukuda, Nguyen Van Tang, Hitoshi Ohsaki, Kenji Taguchi

ACM SIGSOFT Softw. Eng. Notes, 2012

Modeling and Validating the Train Fare Calculation and Adjustment System Using VDM++.

Nguyen Van Tang, Daisuke Souma, Goro Hatayama, Hitoshi Ohsaki

Proceedings of the Verified Software: Theories, Tools, Experiments, 2012

On Model Checking for Visibly Pushdown Automata.

Nguyen Van Tang, Hitoshi Ohsaki

Proceedings of the Language and Automata Theory and Applications, 2012

Test-Case Design by Feature Trees.

Takashi Kitamura, Thi Bich Ngoc Do, Hitoshi Ohsaki, Ling Fang, Shunsuke Yatabe

Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, 2012

Formal Model-Based Test for AUTOSAR Multicore RTOS.

Ling Fang, Takashi Kitamura, Thi Bich Ngoc Do, Hitoshi Ohsaki

Proceedings of the Fifth IEEE International Conference on Software Testing, 2012

On Accelerating SMT-based Bounded Model Checking of HSTM Designs.

Weiqiang Kong, Leyuan Liu, Yoriyuki Yamagata, Kenji Taguchi, Hitoshi Ohsaki, Akira Fukuda

Proceedings of the 19th Asia-Pacific Software Engineering Conference, 2012

2011

Checking On-the-Fly Universality and Inclusion Problems of Visibly Pushdown Automata.

Nguyen Van Tang, Hitoshi Ohsaki

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

2008

Tree Automata for Non-linear Arithmetic.

Naoki Kobayashi, Hitoshi Ohsaki

Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Combining Equational Tree Automata over AC and ACI Theories.

Joe Hendrix, Hitoshi Ohsaki

Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

2007

Languages Modulo Normalization.

Hitoshi Ohsaki, Hiroyuki Seki

Proceedings of the Frontiers of Combining Systems, 6th International Symposium, 2007

2006

Propositional Tree Automata.

Joe Hendrix, Hitoshi Ohsaki, Mahesh Viswanathan

Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms.

Joe Hendrix, José Meseguer, Hitoshi Ohsaki

Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

2005

Monotone AC-Tree Automata.

Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos

Proceedings of the Logic for Programming, 2005

2004

ACTAS : A System Design for Associative and Commutative Tree Automata Theory.

Hitoshi Ohsaki, Toshinori Takai

Proceedings of the 5th International Workshop on Rule-Based Programming, 2004

2003

Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism.

Hitoshi Ohsaki, Hiroyuki Seki, Toshinori Takai

Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

2002

Decidability and Closure Properties of Equational Tree Languages.

Hitoshi Ohsaki, Toshinori Takai

Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

2001

Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories.

Hitoshi Ohsaki

Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000

Type Introduction for Equational Rewriting.

Aart Middeldorp, Hitoshi Ohsaki

Acta Informatica, 2000

Equational Termination by Semantic Labelling.

Hitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl

Proceedings of the Computer Science Logic, 2000

1996

Transforming Termination by Self-Labelling.

Aart Middeldorp, Hitoshi Ohsaki, Hans Zantema

Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996