( en | de | ru )

 

Disambiguation of "Kobayashi, Naoki"

Author of the publication

copydeleteadd this publication to your clipboard
Decision Algorithms for Checking Definability of Order-2 Finitary PCF.

, , and . APLAS, volume 9458 of Lecture Notes in Computer Science, page 313-331. Springer, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Naoki Yoshida

Naoki Ueda

Naoki Tamura

Naoki Fukuzawa

Naoki Saito

 

Other publications of authors with the same name

Higher-Order Model Checking in Direct Style., , and . APLAS, volume 10017 of Lecture Notes in Computer Science, page 295-313. (2016)Verification of Tree-Processing Programs via Higher-Order Model Checking., , and . APLAS, volume 6461 of Lecture Notes in Computer Science, page 312-327. Springer, (2010)Dependent type inference with interpolants., and . PPDP, page 277-288. ACM, (2009)Model-checking higher-order functions.. PPDP, page 25-36. ACM, (2009)A ZDD-Based Efficient Higher-Order Model Checking Algorithm., and . APLAS, volume 8858 of Lecture Notes in Computer Science, page 354-371. Springer, (2014)Practical Alternating Parity Tree Automata Model Checking of Higher-Order Recursion Schemes., , and . APLAS, volume 8301 of Lecture Notes in Computer Science, page 17-32. Springer, (2013)Extension of Type-Based Approach to Generation of Stream-Processing Programs by Automatic Insertion of Buffering Primitives., , and . LOPSTR, volume 3901 of Lecture Notes in Computer Science, page 98-114. Springer, (2005)Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts., and . ESOP, volume 4421 of Lecture Notes in Computer Science, page 490-504. Springer, (2007)An Intersection Type System for Deterministic Pushdown Automata., and . IFIP TCS, volume 7604 of Lecture Notes in Computer Science, page 357-371. Springer, (2012)A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes.. FoSSaCS, volume 6604 of Lecture Notes in Computer Science, page 260-274. Springer, (2011)