The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Naoki Kobayashi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Atsushi Igarashi, Naoki Kobayashi
    Resource Usage Analysis. [Citation Graph (0, 0)][DBLP]
    APLAS, 2001, pp:147-158 [Conf]
  2. Naoki Kobayashi
    Useless Code Elimination and Programm Slicing for the Pi-Calculus. [Citation Graph (0, 0)][DBLP]
    APLAS, 2003, pp:55-72 [Conf]
  3. Naoki Kobayashi, Keita Shirane
    Type-Based Information Analysis for Low-Level Languages. [Citation Graph (0, 0)][DBLP]
    APLAS, 2002, pp:302-316 [Conf]
  4. Koichi Kodama, Kohei Suenaga, Naoki Kobayashi
    Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type. [Citation Graph (0, 0)][DBLP]
    APLAS, 2004, pp:41-56 [Conf]
  5. Akihito Nagata, Naoki Kobayashi, Akinori Yonezawa
    Region-Based Memory Management for a Dynamically-Typed Language. [Citation Graph (0, 0)][DBLP]
    APLAS, 2004, pp:229-245 [Conf]
  6. Naoki Kobayashi
    A New Type System for Deadlock-Free Processes. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:233-247 [Conf]
  7. Naoki Kobayashi, Shin Saito, Eijiro Sumii
    An Implicitly-Typed Deadlock-Free Process Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2000, pp:489-503 [Conf]
  8. Haruo Hosoya, Naoki Kobayashi, Akinori Yonezawa
    Partial Evaluation Scheme for Concurrent Languages and Its Correctness. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. I, 1996, pp:625-632 [Conf]
  9. Naoki Kobayashi, Akinori Yonezawa
    Distributed and concurrent objects based on linear logic (Invited Talk). [Citation Graph (0, 0)][DBLP]
    FMOODS, 1999, pp:- [Conf]
  10. Naoki Kobayashi
    Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:365-389 [Conf]
  11. Reynald Affeldt, Naoki Kobayashi
    Formalization and Verification of a Mail Server in Coq. [Citation Graph (0, 0)][DBLP]
    ISSS, 2002, pp:217-233 [Conf]
  12. Etsuya Shibayama, Shigeki Hagihara, Naoki Kobayashi, Shin-ya Nishizaki, Kenjiro Taura, Takuo Watanabe
    AnZenMail: A Secure and Certified E-mail System. [Citation Graph (0, 0)][DBLP]
    ISSS, 2002, pp:201-216 [Conf]
  13. Naoki Kobayashi
    A Partially Deadlock-Free Typed Process Calculus. [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:128-139 [Conf]
  14. Kohei Suenaga, Naoki Kobayashi, Akinori Yonezawa
    Extension of Type-Based Approach to Generation of Stream-Processing Programs by Automatic Insertion of Buffering Primitives. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2005, pp:98-114 [Conf]
  15. Naoki Kobayashi, Akinori Yonezawa
    Type-Theoretic Foundations for Concurrent Object-Oriented Programming. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 1994, pp:31-45 [Conf]
  16. Futoshi Iwama, Atsushi Igarashi, Naoki Kobayashi
    Resource usage analysis for a functional language with exceptions. [Citation Graph (0, 0)][DBLP]
    PEPM, 2006, pp:38-47 [Conf]
  17. Futoshi Iwama, Naoki Kobayashi
    A new type system for JVM lock primitives. [Citation Graph (0, 0)][DBLP]
    ASIA-PEPM, 2002, pp:71-82 [Conf]
  18. Naoki Kobayashi
    Type-Based Useless Variable Elimination. [Citation Graph (0, 0)][DBLP]
    PEPM, 2000, pp:84-93 [Conf]
  19. Eijiro Sumii, Naoki Kobayashi
    Online-and-Offline Partial Evaluation: A Mixed Approach (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PEPM, 2000, pp:12-21 [Conf]
  20. Atsushi Igarashi, Naoki Kobayashi
    A generic type system for the Pi-calculus. [Citation Graph (0, 0)][DBLP]
    POPL, 2001, pp:128-141 [Conf]
  21. Atsushi Igarashi, Naoki Kobayashi
    Resource usage analysis. [Citation Graph (0, 0)][DBLP]
    POPL, 2002, pp:331-342 [Conf]
  22. Naoki Kobayashi
    Quasi-Linear Types. [Citation Graph (0, 0)][DBLP]
    POPL, 1999, pp:29-42 [Conf]
  23. Naoki Kobayashi, Benjamin C. Pierce, David N. Turner
    Linearity and the Pi-Calculus. [Citation Graph (0, 0)][DBLP]
    POPL, 1996, pp:358-371 [Conf]
  24. Naoki Kobayashi, Akinori Yonezawa
    Asynchronous Communication Model Based on Linear Logic. [Citation Graph (0, 0)][DBLP]
    Parallel Symbolic Computing, 1992, pp:331-336 [Conf]
  25. Naoki Kobayashi, Motoki Nakade, Akinori Yonezawa
    Static Analysis of Communication for Asynchronous Concurrent Programming Languages [Citation Graph (0, 0)][DBLP]
    SAS, 1995, pp:225-242 [Conf]
  26. Atsushi Igarashi, Naoki Kobayashi
    Type-Based Analysis of Communication for Concurrent Programming Languages. [Citation Graph (0, 0)][DBLP]
    SAS, 1997, pp:187-201 [Conf]
  27. Naoki Kobayashi, Akinori Yonezawa
    ACL - A Concurrent Linear Logic Programming Paradigm. [Citation Graph (0, 0)][DBLP]
    ILPS, 1993, pp:279-294 [Conf]
  28. Naoki Kobayashi
    Time regions and effects for resource usage analysis. [Citation Graph (0, 0)][DBLP]
    TLDI, 2003, pp:50-61 [Conf]
  29. Naoki Kobayashi
    Type-Based Analysis of Concurrent Programs. [Citation Graph (0, 0)][DBLP]
    Types in Compilation, 1998, pp:272- [Conf]
  30. Naoki Kobayashi
    Time regions and effects for resource usage analysis. [Citation Graph (0, 0)][DBLP]
    TLDI, 2003, pp:50-61 [Conf]
  31. Naoki Kobayashi, Akinori Yonezawa
    Higher-Order Concurrent Linear Logic Programming. [Citation Graph (0, 0)][DBLP]
    Theory and Practice of Parallel Programming, 1994, pp:137-166 [Conf]
  32. Naoki Kobayashi
    Type Systems for Concurrent Programs. [Citation Graph (0, 0)][DBLP]
    10th Anniversary Colloquium of UNU/IIST, 2002, pp:439-453 [Conf]
  33. Naoki Kobayashi, Kohei Suenaga, Lucian Wischik
    Resource Usage Analysis for the pi-Calculus. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2006, pp:298-312 [Conf]
  34. Naoki Kobayashi
    Type-based information flow analysis for the pi-calculus. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2005, v:42, n:4-5, pp:291-347 [Journal]
  35. Reynald Affeldt, Naoki Kobayashi
    Partial Order Reduction for Verification of Spatial Properties of Pi-Calculus Processes. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:128, n:2, pp:151-168 [Journal]
  36. Eijiro Sumii, Naoki Kobayashi
    A Generalized Deadlock-Free Process Calculus. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:16, n:3, pp:- [Journal]
  37. Naoki Kobayashi, Akinori Yonezawa
    Asynchronous Communication Model Based on Linear Logic. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1995, v:7, n:2, pp:113-149 [Journal]
  38. Naoki Kobayashi
    A Type System for Lock-Free Processes. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:177, n:2, pp:122-159 [Journal]
  39. Atsushi Igarashi, Naoki Kobayashi
    Type Reconstruction for Linear -Calculus with I/O Subtyping. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:161, n:1, pp:1-44 [Journal]
  40. Naoki Kobayashi, Benjamin C. Pierce
    Information and Computation special issue from TACS 2001. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:186, n:2, pp:163-164 [Journal]
  41. Naoki Kobayashi
    Type-Based Useless-Variable Elimination. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2001, v:14, n:2-3, pp:221-260 [Journal]
  42. Eijiro Sumii, Naoki Kobayashi
    A Hybrid Approach to Online and Offline Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    Higher-Order and Symbolic Computation, 2001, v:14, n:2-3, pp:101-142 [Journal]
  43. Naoki Kobayashi, Kohei Suenaga, Lucian Wischik
    Resource Usage Analysis for the p-Calculus. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2006, v:2, n:3, pp:- [Journal]
  44. Naoki Kobayashi, Akinori Yonezawa
    Towards Foundations of Concurrent Object-Oriented Programming-Types and Language Design. [Citation Graph (0, 0)][DBLP]
    TAPOS, 1995, v:1, n:4, pp:243-268 [Journal]
  45. Atsushi Igarashi, Naoki Kobayashi
    A generic type system for the Pi-calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:311, n:1-3, pp:121-163 [Journal]
  46. Naoki Kobayashi, Toshihiro Shimizu, Akinori Yonezawa
    Distributed Concurrent Linear Logic Programming. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:227, n:1-2, pp:185-220 [Journal]
  47. Atsushi Igarashi, Naoki Kobayashi
    Resource usage analysis. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2005, v:27, n:2, pp:264-313 [Journal]
  48. Naoki Kobayashi
    A Partially Deadlock-Free Typed Process Calculus. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1998, v:20, n:2, pp:436-482 [Journal]
  49. Naoki Kobayashi, Benjamin C. Pierce, David N. Turner
    Linearity and the pi-calculus. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1999, v:21, n:5, pp:914-947 [Journal]
  50. Naoki Kobayashi, Takaaki Hosoya, Michito Adachi, Tamami Haku, Koichi Yamaguchi
    Virtual MR microscopy for unruptured aneurysm. [Citation Graph (0, 0)][DBLP]
    Computer Methods and Programs in Biomedicine, 2001, v:66, n:1, pp:99-103 [Journal]
  51. Kohei Suenaga, Naoki Kobayashi
    Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts. [Citation Graph (0, 0)][DBLP]
    ESOP, 2007, pp:490-504 [Conf]
  52. Naoki Kobayashi, Takashi Suto
    Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the pi -Calculus. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:740-751 [Conf]
  53. Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
    Environmental Bisimulations for Higher-Order Languages. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:293-302 [Conf]
  54. Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
    Logical Bisimulations and Functional Languages. [Citation Graph (0, 0)][DBLP]
    FSEN, 2007, pp:364-379 [Conf]
  55. Naoki Kobayashi, Kohei Suenaga, Lucian Wischik
    Resource Usage Analysis for the Pi-Calculus [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  56. Types and Recursion Schemes for Higher-Order Program Verification. [Citation Graph (, )][DBLP]


  57. Fractional Ownerships for Safe Memory Deallocation. [Citation Graph (, )][DBLP]


  58. Type-Based Verification of Correspondence Assertions for Communication Protocols. [Citation Graph (, )][DBLP]


  59. Higher-Order Program Verification and Language-Based Security. [Citation Graph (, )][DBLP]


  60. A Hybrid Type System for Lock-Freedom of Mobile Processes. [Citation Graph (, )][DBLP]


  61. Linear Declassification. [Citation Graph (, )][DBLP]


  62. Type-Based Automated Verification of Authenticity in Cryptographic Protocols. [Citation Graph (, )][DBLP]


  63. Substructural Type Systems for Program Analysis. [Citation Graph (, )][DBLP]


  64. On-Demand Refinement of Dependent Types. [Citation Graph (, )][DBLP]


  65. Untyped Recursion Schemes and Infinite Intersection Types. [Citation Graph (, )][DBLP]


  66. Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus. [Citation Graph (, )][DBLP]


  67. A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes. [Citation Graph (, )][DBLP]


  68. Combining type-based analysis and model checking for finding counterexamples against non-interference. [Citation Graph (, )][DBLP]


  69. Types and higher-order recursion schemes for verification of higher-order programs. [Citation Graph (, )][DBLP]


  70. Higher-order multi-parameter tree transducers and recursion schemes for program verification. [Citation Graph (, )][DBLP]


  71. Model-checking higher-order functions. [Citation Graph (, )][DBLP]


  72. Dependent type inference with interpolants. [Citation Graph (, )][DBLP]


  73. Tree Automata for Non-linear Arithmetic. [Citation Graph (, )][DBLP]


  74. On the Complexity of Termination Inference for Processes. [Citation Graph (, )][DBLP]


  75. A Coq Library for Verification of Concurrent Programs. [Citation Graph (, )][DBLP]


Search in 0.220secs, Finished in 0.224secs
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