Toshinobu Kashiwabara

According to our database1, Toshinobu Kashiwabara authored at least 18 papers between 1979 and 2010.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2010
Approximate Invariant Property Checking Using Term-Height Reduction for a Subset of First-Order Logic.
IPSJ Trans. Syst. LSI Des. Methodol., 2010

Approximate Model Checking Using a Subset of First-order Logic.
IPSJ Trans. Syst. LSI Des. Methodol., 2010

2009
Checker Generation of Assertions with Local Variables for Model Checking.
IPSJ Trans. Syst. LSI Des. Methodol., 2009

2007
Satisfiability Checking for Logic with Equality and Uninterpreted Functions under Equivalence Constraints.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

2006
Expressive Power of Quantum Pushdown Automata with Classical Stack Operations under the Perfect-Soundness Condition.
IEICE Trans. Inf. Syst., 2006

2005
Automatic monitor generation from regular expression based specifications for module interface verification.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005

2004
Validity Checking for Quantifier-Free First-Order Logic with Equality Using Substitution of Boolean Formulas.
Proceedings of the Automated Technology for Verification and Analysis: Second International Conference, 2004

2002
On-Line Edge-Coloring Algorithms for Degree-Bounded Bipartite Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

2000
Symbolic Checking of Signal-Transition Consistency for Verifying High-Level Designs.
Proceedings of the Formal Methods in Computer-Aided Design, Third International Conference, 2000

Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1992
Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph.
J. Algorithms, 1992

1991
Polynomial time algorithms on circular-arc overlap graphs.
Networks, 1991

1990
Crossing Minimization in Linear Embeddings of Graphs.
IEEE Trans. Computers, 1990

Efficient algorithms for finding maximum cliques of an overlap graph.
Networks, 1990

1989
Exact algorithms for multilayer topological via minimization.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1989

1981
On Minimal Augmentation of a Graph to Obtain an Interval Graph.
J. Comput. Syst. Sci., 1981

1980
Algorithms for some intersection graphs.
Proceedings of the Graph Theory and Algorithms, 1980

1979
One-dimensional logic gate assignment and interval graphs.
Proceedings of the IEEE Computer Society's Third International Computer Software and Applications Conference, 1979


  Loading...