Hitoshi Ohsaki - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2014

2013

Constructing test cases for n-wise testing from tree-based test modelsThi Bich Ngoc Do, Takashi Kitamura, Nguyen Van Tang, Goro Hatayama, Shinya Sakuragi, Hitoshi Ohsaki. soict 2013: 275-284 [doi]

2012

Formal Model-Based Test for AUTOSAR Multicore RTOSLing Fang, Takashi Kitamura, Thi Bich Ngoc Do, Hitoshi Ohsaki. icst 2012: 251-259 [doi]

Test-Case Design by Feature TreesTakashi Kitamura, Thi Bich Ngoc Do, Hitoshi Ohsaki, Ling Fang, Shunsuke Yatabe. ISoLA 2012: 458-473 [doi]

On Accelerating SMT-based Bounded Model Checking of HSTM DesignsWeiqiang Kong, Leyuan Liu, Yoriyuki Yamagata, Kenji Taguchi 0001, Hitoshi Ohsaki, Akira Fukuda. apsec 2012: 614-623 [doi]

Modeling and Validating the Train Fare Calculation and Adjustment System Using VDM++Nguyen Van Tang, Daisuke Souma, Goro Hatayama, Hitoshi Ohsaki. vstte 2012: 163-178 [doi]

On Model Checking for Visibly Pushdown AutomataNguyen Van Tang, Hitoshi Ohsaki. LATA 2012: 408-419 [doi]

Formal semantics of extended hierarchical state transition matrix by CSPYoriyuki Yamagata, Weiqiang Kong, Akira Fukuda, Nguyen Van Tang, Hitoshi Ohsaki, Kenji Taguchi 0001. sigsoft, 37(4):1-8, 2012. [doi]

2011

Checking On-the-Fly Universality and Inclusion Problems of Visibly Pushdown AutomataNguyen Van Tang, Hitoshi Ohsaki. ieicet, 94-A(12):2794-2801, 2011. [doi]

2008

Combining Equational Tree Automata over AC and ACI TheoriesJoe Hendrix, Hitoshi Ohsaki. RTA 2008: 142-156 [doi]

Tree Automata for Non-linear ArithmeticNaoki Kobayashi, Hitoshi Ohsaki. RTA 2008: 291-305 [doi]

2007

Languages Modulo NormalizationHitoshi Ohsaki, Hiroyuki Seki. frocos 2007: 221-236 [doi]

2006

Propositional Tree AutomataJoe Hendrix, Hitoshi Ohsaki, Mahesh Viswanathan. RTA 2006: 50-65 [doi]

A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo AxiomsJoe Hendrix, José Meseguer, Hitoshi Ohsaki. cade 2006: 151-155 [doi]

2005

Monotone AC-Tree AutomataHitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos. lpar 2005: 337-351 [doi]

ACTAS : A System Design for Associative and Commutative Tree Automata TheoryHitoshi Ohsaki, Toshinori Takai. ENTCS, 124(1):97-111, 2005. [doi]

2003

Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting MechanismHitoshi Ohsaki, Hiroyuki Seki, Toshinori Takai. RTA 2003: 483-498 [doi]

2002

Decidability and Closure Properties of Equational Tree LanguagesHitoshi Ohsaki, Toshinori Takai. RTA 2002: 114-128 [doi]

2001

Beyond Regularity: Equational Tree Automata for Associative and Commutative TheoriesHitoshi Ohsaki. csl 2001: 539-553 [doi]

2000

Type Introduction for Equational RewritingAart Middeldorp, Hitoshi Ohsaki. ACTA, 36(12):1007-1029, 2000. [doi]

Equational Termination by Semantic LabellingHitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl. csl 2000: 457-471 [doi]

1997

Type Introduction for Equational RewritingHitoshi Ohsaki, Aart Middeldorp. lfcs 1997: 283-293

1996

Transforming Termination by Self-LabellingAart Middeldorp, Hitoshi Ohsaki, Hans Zantema. cade 1996: 373-387

Sign in or sign up to see more results.

runs on WebDSL