- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j18 |      | Naoki Nishida, Masahiko Sakai, Toshiki Sakabe: Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity. Logical Methods in Computer Science 8(3) (2012) |
| j17 | | Masanori Nagashima, Masahiko Sakai, Toshiki Sakabe: Determinization of conditional term rewriting systems. Theor. Comput. Sci. 464: 72-89 (2012) |
| c9 | | Minami Niwa, Naoki Nishida, Masahiko Sakai: Improving Determinization of Grammar Programs for Program Inversion. LOPSTR 2012: 155-175 |
| 2011 | ||
| c8 | | Florent Jacquemard, Yoshiharu Kojima, Masahiko Sakai: Controlled Term Rewriting. FroCoS 2011: 179-194 |
| c7 | | Naoki Nishida, Masahiko Sakai, Toshiki Sakabe: Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity. RTA 2011: 267-282 |
| i1 | | Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai, Frédéric Blanqui: Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems. CoRR abs/1109.5468 (2011) |
| 2010 | ||
| j16 | | Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe: Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs. IEICE Transactions 93-D(5): 953-962 (2010) |
| j15 | | Masahiko Sakai, Mizuhito Ogawa: Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent. Inf. Process. Lett. 110(18-19): 810-814 (2010) |
| c6 | | Naoki Nishida, Masahiko Sakai: Proving Injectivity of Functions via Program Inversion in Term Rewriting. FLOPS 2010: 288-303 |
| 2009 | ||
| j14 | | Naoki Nishida, Masahiko Sakai: Completion after Program Inversion of Injective Functions. Electr. Notes Theor. Comput. Sci. 237: 39-56 (2009) |
| j13 | | Keiichirou Kusakari, Masahiko Sakai: Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques. IEICE Transactions 92-D(2): 235-247 (2009) |
| j12 | | Keiichirou Kusakari, Yasuo Isogai, Masahiko Sakai, Frédéric Blanqui: Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems. IEICE Transactions 92-D(10): 2007-2015 (2009) |
| 2008 | ||
| j11 | | Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe: Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems. Electr. Notes Theor. Comput. Sci. 204: 21-34 (2008) |
| j10 | | Masahiko Sakai, Yi Wang: Undecidable Properties on Length-Two String Rewriting Systems. Electr. Notes Theor. Comput. Sci. 204: 53-69 (2008) |
| c5 | | Yoshiharu Kojima, Masahiko Sakai: Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems. RTA 2008: 187-201 |
| 2007 | ||
| j9 | | Keiichirou Kusakari, Masahiko Sakai: Enhancing dependency pair method using strong computability in simply-typed term rewriting. Appl. Algebra Eng. Commun. Comput. 18(5): 407-431 (2007) |
| j8 | | Naoki Nishida, Tomohiro Mizutani, Masahiko Sakai: Transformation for Refining Unraveled Conditional Term Rewriting Systems. Electr. Notes Theor. Comput. Sci. 174(10): 75-95 (2007) |
| 2006 | ||
| c4 | | |
| 2005 | ||
| j7 | | Masahiko Sakai, Keiichirou Kusakari: On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems. IEICE Transactions 88-D(3): 583-593 (2005) |
| j6 | | Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe: Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting. IEICE Transactions 88-D(12): 2715-2726 (2005) |
| c3 | | Naoki Nishida, Masahiko Sakai, Toshiki Sakabe: Partial Inversion of Constructor Term Rewriting Systems. RTA 2005: 264-278 |
| 2003 | ||
| j5 | | Naoki Nishida, Masahiko Sakai, Toshiki Sakabe: Narrowing-based simulation of term rewriting systems with extra variables. Electr. Notes Theor. Comput. Sci. 86(3): 52-69 (2003) |
| 2002 | ||
| c2 | | Hideto Kasuya, Masahiko Sakai, Kiyoshi Agusa: Descendants and Head Normalization of Higher-Order Rewrite Systems. FLOPS 2002: 198-211 |
| 1998 | ||
| j4 | | Masahiko Sakai, Yoshihito Toyama: Semantics and Strong Sequentiality of Priority Term Rewriting Systems. Theor. Comput. Sci. 208(1-2): 87-110 (1998) |
| 1997 | ||
| j3 | | Takeshi Hamaguchi, Masahiko Sakai, Shinichirou Yamamoto, Kiyoshi Agusa: Algebraic specification with provision for the automatic addition of error descriptions. Systems and Computers in Japan 28(1): 1-9 (1997) |
| 1996 | ||
| j2 | | Takeshi Hamaguchi, Shinichirou Yamamoto, Kiyoshi Agusa, Masahiko Sakai: Error description on algebraic specification and its automatic addition. Systems and Computers in Japan 27(10): 59-67 (1996) |
| c1 | | Masahiko Sakai, Yoshihito Toyama: Semantics and Strong Sequentiality of Priority Term Rewriting Systems. RTA 1996: 377-391 |
| 1992 | ||
| j1 | | Masahiko Sakai, Toshiki Sakabe, Yasuyoshi Inagaki: Algebraic specification and automatic generation of compilers. Systems and Computers in Japan 23(2): 1-13 (1992) |
Colors in the list of coauthors
Last update Mon May 20 00:15:40 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page