Travelled to:1 × Austria
1 × Canada
1 × Denmark
1 × France
1 × Germany
2 × Spain
3 × USA
Collaborated with:J.Hendrix T.Takai A.Middeldorp N.V.Tang N.Kobayashi ∅ J.Meseguer M.Viswanathan H.Seki J.Giesl H.Zantema L.Fang T.Kitamura T.B.N.Do
Talks about:tree (6) automata (5) equat (4) languag (2) theori (2) termin (2) linear (2) model (2) label (2) membership (1)
Person: Hitoshi Ohsaki
DBLP: Ohsaki:Hitoshi
Contributed to:
2012
2012
2008
2006200620032002
20012000
1996Wrote 11 papers:
- ICST-2012-FangKDO #formal method #manycore #modelling
- Formal Model-Based Test for AUTOSAR Multicore RTOS (LF, TK, TBND, HO), pp. 251–259.
- LATA-2012-TangO #automaton #model checking #on the
- On Model Checking for Visibly Pushdown Automata (NVT, HO), pp. 408–419.
- RTA-2008-HendrixO #automaton #equation
- Combining Equational Tree Automata over AC and ACI Theories (JH, HO), pp. 142–156.
- RTA-2008-KobayashiO #automaton
- Tree Automata for Non-linear Arithmetic (NK, HO), pp. 291–305.
- IJCAR-2006-HendrixMO #axiom #linear #order #specification
- A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms (JH, JM, HO), pp. 151–155.
- RTA-2006-HendrixOV #automaton
- Propositional Tree Automata (JH, HO, MV), pp. 50–65.
- RTA-2003-OhsakiST
- Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism (HO, HS, TT), pp. 483–498.
- RTA-2002-OhsakiT #decidability #equation
- Decidability and Closure Properties of Equational Tree Languages (HO, TT), pp. 114–128.
- CSL-2001-Ohsaki #automaton #commutative #equation
- Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories (HO), pp. 539–553.
- CSL-2000-OhsakiMG #equation #semantics #termination
- Equational Termination by Semantic Labelling (HO, AM, JG), pp. 457–471.
- CADE-1996-MiddeldorpOZ #self #termination
- Transforming Termination by Self-Labelling (AM, HO, HZ), pp. 373–387.