default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHitoshi Ohsaki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j5]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): 943-962 (2014)- [j4]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: 909762:1-909762:21 (2014) - 2013
- [c19]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: 275-284 - 2012
- [j3]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): 1-8 (2012) - [c18]Weiqiang Kong, Leyuan Liu, Yoriyuki Yamagata, Kenji Taguchi, Hitoshi Ohsaki, Akira Fukuda:
On Accelerating SMT-based Bounded Model Checking of HSTM Designs. APSEC 2012: 614-623 - [c17]Ling Fang, Takashi Kitamura, Thi Bich Ngoc Do, Hitoshi Ohsaki:
Formal Model-Based Test for AUTOSAR Multicore RTOS. ICST 2012: 251-259 - [c16]Takashi Kitamura, Thi Bich Ngoc Do, Hitoshi Ohsaki, Ling Fang, Shunsuke Yatabe:
Test-Case Design by Feature Trees. ISoLA (1) 2012: 458-473 - [c15]Nguyen Van Tang, Hitoshi Ohsaki:
On Model Checking for Visibly Pushdown Automata. LATA 2012: 408-419 - [c14]Nguyen Van Tang, Daisuke Souma, Goro Hatayama, Hitoshi Ohsaki:
Modeling and Validating the Train Fare Calculation and Adjustment System Using VDM++. VSTTE 2012: 163-178 - 2011
- [j2]Nguyen Van Tang, Hitoshi Ohsaki:
Checking On-the-Fly Universality and Inclusion Problems of Visibly Pushdown Automata. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(12): 2794-2801 (2011)
2000 – 2009
- 2008
- [c13]Joe Hendrix, Hitoshi Ohsaki:
Combining Equational Tree Automata over AC and ACI Theories. RTA 2008: 142-156 - [c12]Naoki Kobayashi, Hitoshi Ohsaki:
Tree Automata for Non-linear Arithmetic. RTA 2008: 291-305 - 2007
- [c11]Hitoshi Ohsaki, Hiroyuki Seki:
Languages Modulo Normalization. FroCoS 2007: 221-236 - 2006
- [c10]Joe Hendrix, José Meseguer, Hitoshi Ohsaki:
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms. IJCAR 2006: 151-155 - [c9]Joe Hendrix, Hitoshi Ohsaki, Mahesh Viswanathan:
Propositional Tree Automata. RTA 2006: 50-65 - 2005
- [c8]Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos:
Monotone AC-Tree Automata. LPAR 2005: 337-351 - 2004
- [c7]Hitoshi Ohsaki, Toshinori Takai:
ACTAS : A System Design for Associative and Commutative Tree Automata Theory. RULE@RDP 2004: 97-111 - 2003
- [c6]Hitoshi Ohsaki, Hiroyuki Seki, Toshinori Takai:
Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism. RTA 2003: 483-498 - 2002
- [c5]Hitoshi Ohsaki, Toshinori Takai:
Decidability and Closure Properties of Equational Tree Languages. RTA 2002: 114-128 - 2001
- [c4]Hitoshi Ohsaki:
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories. CSL 2001: 539-553 - 2000
- [j1]Aart Middeldorp, Hitoshi Ohsaki:
Type Introduction for Equational Rewriting. Acta Informatica 36(12): 1007-1029 (2000) - [c3]Hitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl:
Equational Termination by Semantic Labelling. CSL 2000: 457-471
1990 – 1999
- 1997
- [c2]Hitoshi Ohsaki, Aart Middeldorp:
Type Introduction for Equational Rewriting. LFCS 1997: 283-293 - 1996
- [c1]Aart Middeldorp, Hitoshi Ohsaki, Hans Zantema:
Transforming Termination by Self-Labelling. CADE 1996: 373-387
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
