# Hitoshi Ohsaki

According to our database

Collaborative distances:

^{1}, Hitoshi Ohsaki authored at least 24 papers between 1996 and 2014.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2014

Formal Specification Based Automatic Test Generation for Embedded Network Systems.

J. Applied Mathematics, 2014

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

Formal Asp. Comput., 2014

2013

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

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

2012

Formal semantics of extended hierarchical state transition matrix by CSP.

ACM SIGSOFT Software Engineering Notes, 2012

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

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

On Model Checking for Visibly Pushdown Automata.

Proceedings of the Language and Automata Theory and Applications, 2012

Test-Case Design by Feature Trees.

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

Formal Model-Based Test for AUTOSAR Multicore RTOS.

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

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

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

2011

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

IEICE Transactions, 2011

2008

Tree Automata for Non-linear Arithmetic.

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

Combining Equational Tree Automata over AC and ACI Theories.

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

2007

Languages Modulo Normalization.

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

2006

Propositional Tree Automata.

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

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

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

2005

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

Electr. Notes Theor. Comput. Sci., 2005

Monotone AC-Tree Automata.

Proceedings of the Logic for Programming, 2005

2003

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

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

2002

Decidability and Closure Properties of Equational Tree Languages.

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

2001

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

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

2000

Type Introduction for Equational Rewriting.

Acta Inf., 2000

Equational Termination by Semantic Labelling.

Proceedings of the Computer Science Logic, 2000

1997

Type Introduction for Equational Rewriting.

Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

1996

Transforming Termination by Self-Labelling.

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