Toshinobu Kashiwabara - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2010

Approximate Model Checking Using a Subset of First-order LogicKiyoharu Hamaguchi, Kazuya Masuda, Toshinobu Kashiwabara. ipsj, 3:268-282, 2010. [doi]

Approximate Invariant Property Checking Using Term-Height Reduction for a Subset of First-Order LogicHiroaki Shimizu, Kiyoharu Hamaguchi, Toshinobu Kashiwabara. ipsj, 3:105-117, 2010. [doi]

2009

Checker Generation of Assertions with Local Variables for Model CheckingSho Takeuchi, Kiyoharu Hamaguchi, Toshinobu Kashiwabara. ipsj, 2:80-92, 2009. [doi]

2008

Approximate Invariant Property Checking Using Term-Height Reduction for a Subset of First-Order LogicHiroaki Shimizu, Kiyoharu Hamaguchi, Toshinobu Kashiwabara. ATVA 2008: 318-331 [doi]

2007

Satisfiability Checking for Logic with Equality and Uninterpreted Functions under Equivalence ConstraintsHiroaki Kozawa, Kiyoharu Hamaguchi, Toshinobu Kashiwabara. ieicet, 90-A(12):2778-2789, 2007. [doi]

2006

Expressive Power of Quantum Pushdown Automata with Classical Stack Operations under the Perfect-Soundness ConditionMasaki Nakanishi, Kiyoharu Hamaguchi, Toshinobu Kashiwabara. ieicet, 89-D(3):1120-1127, 2006. [doi]

2005

Automatic monitor generation from regular expression based specifications for module interface verificationY. Kakiuchi, A. Kitajima, Kiyoharu Hamaguchi, Toshinobu Kashiwabara. iscas 2005: 3555-3558 [doi]

2004

Validity Checking for Quantifier-Free First-Order Logic with Equality Using Substitution of Boolean FormulasAtsushi Moritomo, Kiyoharu Hamaguchi, Toshinobu Kashiwabara. ATVA 2004: 108-119 [doi]

2002

On-Line Edge-Coloring Algorithms for Degree-Bounded Bipartite GraphsMasakuni Taki, Mikihito Sugiura, Toshinobu Kashiwabara. ieiceta, 85-A(5):1062-1065, 2002. [doi]

2000

Symbolic Checking of Signal-Transition Consistency for Verifying High-Level DesignsKiyoharu Hamaguchi, Hidekazu Urushihara, Toshinobu Kashiwabara. FMCAD 2000: 455-469 [doi]

Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width RestrictionMasaki Nakanishi, Kiyoharu Hamaguchi, Toshinobu Kashiwabara. cocoon 2000: 467-476 [doi]

1992

Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc GraphToshinobu Kashiwabara, Sumio Masuda, Kazuo Nakajima, Toshio Fujisawa. jal, 13(1):161-174, 1992.

1991

Polynomial time algorithms on circular-arc overlap graphsToshinobu Kashiwabara, Sumio Masuda, Kazuo Nakajima, Toshio Fujisawa. networks, 21(2):195-203, 1991. [doi]

1990

Crossing Minimization in Linear Embeddings of GraphsSumio Masuda, Kazuo Nakajima, Toshinobu Kashiwabara, Thio Fujisawa. TC, 39(1):124-127, 1990.

Efficient algorithms for finding maximum cliques of an overlap graphSumio Masuda, Kazuo Nakajima, Toshinobu Kashiwabara, Toshio Fujisawa. networks, 20(2):157-171, 1990. [doi]

1989

Exact algorithms for multilayer topological via minimizationChong S. Rim, Toshinobu Kashiwabara, Kazuo Nakajima. tcad, 8(11):1165-1173, 1989. [doi]

1981

On Minimal Augmentation of a Graph to Obtain an Interval GraphTatsuo Ohtsuki, Hajimu Mori, Toshinobu Kashiwabara, Toshio Fujisawa. jcss, 22(1):60-97, 1981.

1980

Algorithms for some intersection graphsToshinobu Kashiwabara. gta 1981: 171-181

1979

One-dimensional logic gate assignment and interval graphsTatsuo Ohtsuki, Hajimu Mori, Ernest S. Kuh, Toshinobu Kashiwabara, Toshio Fujisawa. compsac 1979: 101-106 [doi]

Sign in or sign up to see more results.

runs on WebDSL