#### Filter Results:

- Full text PDF available (116)

#### Publication Year

1980

2017

- This year (8)
- Last 5 years (48)
- Last 10 years (89)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Atsushi Igarashi, Naoki Kobayashi
- Theor. Comput. Sci.
- 2001

We propose a general, powerful framework of type systems for the &pi;-calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial properties like deadlock-freedom and race-freedom. A key idea is to express types and type environments as abstract processes: We can check various properties of a process by… (More)

- Naoki Kobayashi, Benjamin C. Pierce, David N. Turner
- ACM Trans. Program. Lang. Syst.
- 1996

The economy and flexibility of the pi-calculus make it an attractive object of theoretical study and a clean basis for concurrent language design and implementation. However, such generality has a cost: encoding higher-level features like functional computation in pi-calculus throws away potentially useful information. We show how a linear type system can… (More)

- Atsushi Igarashi, Naoki Kobayashi
- ACM Trans. Program. Lang. Syst.
- 2001

It is an important criterion of program correctness that a program accesses resources in a valid manner. For example, a memory region that has been allocated should eventually be deallocated, and after the deallocation, the region should no longer be accessed. A file that has been opened should be eventually closed. So far, most of the methods to analyze… (More)

- Naoki Kobayashi
- Inf. Comput.
- 2002

Interpretation. An alternative way to analyze the behavior of a concurrent program would be to use abstract interpretation [4, 5]. Actually, from a very general viewpoint, our type-based analysis of locks can be seen as a kind of abstract interpretation. We can read a type judgment Γ ⊢ P as “Γ is an abstraction of a concrete process P .” (The relation “⊢”… (More)

- Naoki Kobayashi
- POPL
- 2009

We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the model-checking problem for higher-order recursion schemes (HORS's). A program is transformed to an HORS that generates a tree representing all the possible event sequences of the program,… (More)

- Naoki Kobayashi
- PPDP
- 2009

We propose a novel type-based model checking algorithm for higher-order recursion schemes. As shown by Kobayashi, verification problems of higher-order functional programs can easily be translated into model checking problems of recursion schemes. Thus, the model checking algorithm serves as a basis for verification of higher-order functional programs. To… (More)

- Naoki Kobayashi, Ryosuke Sato, Hiroshi Unno
- PLDI
- 2011

Higher-order model checking (more precisely, the model checking of higher-order recursion schemes) has been extensively studied recently, which can automatically decide properties of programs written in the simply-typed λ-calculus with recursion and <i>finite</i> data domains. This paper formalizes predicate abstraction and counterexample-guided… (More)

- Naoki Kobayashi, C.-H. Luke Ong
- 2009 24th Annual IEEE Symposium on Logic In…
- 2009

The model checking of higher-order recursion schemes has important applications in the verification of higher-order programs. Ong has previously shown that the modal mu-calculus model checking of trees generated by order-n recursion scheme is n-EXPTIME complete, but his algorithm and its correctness proof were rather complex. We give an alternative,… (More)

- Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
- 22nd Annual IEEE Symposium on Logic in Computer…
- 2007

Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulation proof method with “up-to context” techniques, and (2) obtaining definitions and results that scale to languages with different features.
To meet these challenges, we… (More)

- Naoki Kobayashi, Akinori Yonezawa
- Formal Aspects of Computing
- 1992

We propose a new framework called ACL for concurrent computation based on linear logic. ACL is a kind oflinear logic programming framework, where its operational semantics is described in terms ofproof construction in linear logic. We also give a model-theoretic semantics based onphase semantics, a model of linear logic. Our framework well captures… (More)