The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Masahiko Sakai: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hideto Kasuya, Masahiko Sakai, Kiyoshi Agusa
    Descendants and Head Normalization of Higher-Order Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2002, pp:198-211 [Conf]
  2. Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
    Partial Inversion of Constructor Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2005, pp:264-278 [Conf]
  3. Masahiko Sakai, Yoshihito Toyama
    Semantics and Strong Sequentiality of Priority Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 1996, pp:377-391 [Conf]
  4. Yi Wang, Masahiko Sakai
    Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2006, pp:343-356 [Conf]
  5. Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
    Narrowing-based simulation of term rewriting systems with extra variables. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:86, n:3, pp:- [Journal]
  6. Masahiko Sakai, Keiichirou Kusakari
    On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    IEICE Transactions, 2005, v:88, n:3, pp:583-593 [Journal]
  7. Takeshi Hamaguchi, Masahiko Sakai, Shinichirou Yamamoto, Kiyoshi Agusa
    Algebraic specification with provision for the automatic addition of error descriptions. [Citation Graph (0, 0)][DBLP]
    Systems and Computers in Japan, 1997, v:28, n:1, pp:1-9 [Journal]
  8. Masahiko Sakai, Yoshihito Toyama
    Semantics and Strong Sequentiality of Priority Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:208, n:1-2, pp:87-110 [Journal]
  9. Naoki Nishida, Tomohiro Mizutani, Masahiko Sakai
    Transformation for Refining Unraveled Conditional Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:174, n:10, pp:75-95 [Journal]

  10. Proving Injectivity of Functions via Program Inversion in Term Rewriting. [Citation Graph (, )][DBLP]


  11. Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems. [Citation Graph (, )][DBLP]


  12. Enhancing dependency pair method using strong computability in simply-typed term rewriting. [Citation Graph (, )][DBLP]


  13. Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems. [Citation Graph (, )][DBLP]


  14. Undecidable Properties on Length-Two String Rewriting Systems. [Citation Graph (, )][DBLP]


  15. Completion after Program Inversion of Injective Functions. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002