Travelled to:
1 × Canada
1 × Germany
1 × Poland
1 × USA
Collaborated with:
∅ R.Sato T.Tsukada K.Watanabe É.Lozes Florian Bruse Naoki Iwayama Takashi Suwa A.Igarashi Hiroki Oshikawa Akihiro Murase T.Terauchi H.U.0001
Talks about:
higher (11) order (11) check (7) model (6) verif (5) program (4) type (3) function (2) practic (2) scheme (2)
Person: Naoki Kobayashi 0001
DBLP: 0001:Naoki_Kobayashi
Contributed to:
Wrote 12 papers:
- LICS-2013-Kobayashi #type system
- Pumping by Typing (NK0), pp. 398–407.
- FoSSaCS-2011-Kobayashi #algorithm #automaton #higher-order #linear #model checking #recursion
- A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes (NK0), pp. 260–274.
- LICS-2011-Kobayashi #higher-order #model checking #theory and practice
- Higher-Order Model Checking: From Theory to Practice (NK0), pp. 219–224.
- LICS-1997-Kobayashi #calculus #concurrent #process
- A Partially Deadlock-Free Typed Process Calculus (NK0), pp. 128–139.
- ESOP-2017-Sato0 #composition #functional #higher-order #source code #verification
- Modular Verification of Higher-Order Functional Programs (RS, NK0), pp. 831–854.
- ESOP-2018-0001TW #higher-order #model checking #verification
- Higher-Order Program Verification via HFL Model Checking (NK0, TT, KW), pp. 711–738.
- POPL-2016-MuraseT0SU #functional #higher-order #source code #verification
- Temporal verification of higher-order functional programs (AM, TT, NK0, RS, HU0), pp. 57–68.
- PEPM-2017-SuwaT0I #code generation #higher-order #model checking #verification
- Verification of code generators via higher-order model checking (TS, TT, NK0, AI), pp. 59–70.
- POPL-2017-KobayashiLB #fixpoint #higher-order #logic #on the #recursion
- On the relationship between higher-order recursion schemes and higher-order fixpoint logic (NK0, ÉL, FB), pp. 246–259.
- PEPM-2019-SatoI0 #higher-order #model checking #refinement #type inference
- Combining higher-order model checking with refinement type inference (RS, NI, NK0), pp. 47–53.
- PEPM-2019-WatanabeTO0 #higher-order #reduction #source code #verification
- Reduction from branching-time property verification of higher-order programs to HFL validity checking (KW, TT, HO, NK0), pp. 22–34.
- PPDP-2019-Kobayashi #higher-order #model checking
- 10 Years of the Higher-Order Model Checking Project (Extended Abstract) (NK0), p. 2.