Kohei Honda

According to our database1, Kohei Honda
  • authored at least 83 papers between 1989 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Monitoring networks through multiparty session types.
Theor. Comput. Sci., 2017

2016
On asynchronous eventful session semantics.
Mathematical Structures in Computer Science, 2016

Multiparty Asynchronous Session Types.
J. ACM, 2016

2015
Practical interruptible conversations: distributed dynamic verification with multiparty session types and Python.
Formal Methods in System Design, 2015

2014
An observationally complete program logic for imperative higher-order functions.
Theor. Comput. Sci., 2014

Process Types as a Descriptive Tool for Interaction - Control and the Pi-Calculus.
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

Structuring Communication with Session Types.
Proceedings of the Concurrent Objects and Beyond, 2014

2013
Practical Interruptible Conversations - Distributed Dynamic Verification with Session Types and Python.
Proceedings of the Runtime Verification - 4th International Conference, 2013

Monitoring Networks through Multiparty Session Types.
Proceedings of the Formal Techniques for Distributed Systems, 2013

2012
Structured Communication-Centered Programming for Web Services.
ACM Trans. Program. Lang. Syst., 2012

Multiparty Session C: Safe Parallel Programming with Message Optimisation.
Proceedings of the Objects, Models, Components, Patterns - 50th International Conference, 2012

Verification of MPI Programs Using Session Types.
Proceedings of the Recent Advances in the Message Passing Interface, 2012

Session Types and Distributed Computing.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Intensional and Extensional Characterisation of Global Progress in the π-Calculus.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

Nested Protocols in Session Types.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

Specifying Stateful Asynchronous Properties for Distributed Programs.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011
A Unified Theory of Program Logics: An Approach based on the π-Calculus.
Comput. J., 2011

Understanding Distributed Services through the π-Calculus.
Proceedings of the Web Services and Formal Methods - 8th International Workshop, 2011

Asynchronous Distributed Monitoring for Multiparty Session Enforcement.
Proceedings of the Trustworthy Global Computing - 6th International Symposium, 2011

Scribbling Interactions with a Formal Foundation.
Proceedings of the Distributed Computing and Internet Technology, 2011

On Asynchronous Session Semantics.
Proceedings of the Formal Techniques for Distributed Systems, 2011

Full Abstraction in a Subtyped pi-Calculus with Linear Types.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010
An exact correspondence between a typed pi-calculus and polarised proof-nets.
Theor. Comput. Sci., 2010

Multiparty Symmetric Sum Types
Proceedings of the Proceedings 17th International Workshop on Expressiveness in Concurrency, 2010

Type-Safe Eventful Sessions in Java.
Proceedings of the ECOOP 2010, 2010

A Theory of Design-by-Contract for Distributed Multiparty Interactions.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009
Type-Directed Compilation for Multicore Programming.
Electr. Notes Theor. Comput. Sci., 2009

Asynchronous Session Types: Exceptions and Multiparty Interactions.
Proceedings of the Formal Methods for Web Services, 2009

Global Principal Typing in Partially Commutative Asynchronous Sessions.
Proceedings of the Programming Languages and Systems, 2009

2008
Logical Reasoning for Higher-Order Functions with Local State.
Logical Methods in Computer Science, 2008

Theoretical Aspects of Communication-Centred Programming.
Electr. Notes Theor. Comput. Sci., 2008

Logical Reasoning for Higher-Order Functions with Local State
CoRR, 2008

Multiparty asynchronous session types.
Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2008

Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Session-Based Compilation Framework for Multicore Programming.
Proceedings of the Formal Methods for Components and Objects, 7th International Symposium, 2008

Session-Based Distributed Programming in Java.
Proceedings of the ECOOP 2008, 2008

Structured Interactional Exceptions in Session Types.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

A Unified Theory of Program Logics: An Approach based on the n-Calculus.
Proceedings of the Visions of Computer Science, 2008

2007
A uniform type structure for secure information flow.
ACM Trans. Program. Lang. Syst., 2007

Linearity and bisimulation.
J. Log. Algebr. Program., 2007

A logical analysis of aliasing in imperative higher-order functions.
J. Funct. Program., 2007

A Calculus of Global Interaction based on Session Types.
Electr. Notes Theor. Comput. Sci., 2007

Web Services, Mobile Processes and Types.
Bulletin of the EATCS, 2007

Logical Reasoning for Higher-Order Functions with Local State.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

Structured Communication-Centred Programming for Web Services.
Proceedings of the Programming Languages and Systems, 2007

2006
Process Algebras in the Age of Ubiquitous Computing.
Electr. Notes Theor. Comput. Sci., 2006

Descriptive and Relative Completeness of Logics for Higher-Order Functions.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Noninterference through flow analysis.
J. Funct. Program., 2005

Genericity and the pi-calculus.
Acta Inf., 2005

An Observationally Complete Program Logic for Imperative Higher-Order Frame Rules.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

A logical analysis of aliasing in imperative higher-order functions.
Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, 2005

2004
Strong normalisation in the pi -calculus.
Inf. Comput., 2004

A compositional logic for polymorphic higher-order functions.
Proceedings of the 6th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2004

From process logic to program logic.
Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming, 2004

2003
Genericity and the pi-Calculus.
Proceedings of the Foundations of Software Science and Computational Structures, 2003

2002
Processes and Games.
Electr. Notes Theor. Comput. Sci., 2002

A uniform type structure for secure information flow.
Proceedings of the Conference Record of POPL 2002: The 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2002

Linearity and Bisimulation.
Proceedings of the Foundations of Software Science and Computation Structures, 2002

2001
Sequentiality and the pi-Calculus.
TLCA, 2001

Strong Normalisation in the pi-Calculus.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

2000
Elementary structures in process theory (1): Sets with renaming.
Mathematical Structures in Computer Science, 2000

The Two-Phase Commitment Protocol in an Extended pi-Calculus.
Electr. Notes Theor. Comput. Sci., 2000

Secure Information Flow as Typed Process Behaviour.
Proceedings of the Programming Languages and Systems, 2000

1999
Game-Theoretic Analysis of Call-by-Value Computation.
Theor. Comput. Sci., 1999

Semantics Study and Reality of Computing.
ACM Comput. Surv., 1999

1998
Recursive Types in Games: Axiomatics and Process Representation.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

A Fully Abstract Game Semantics for General References.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

Language Primitives and Type Discipline for Structured Communication-Based Programming.
Proceedings of the Programming Languages and Systems - ESOP'98, 7th European Symposium on Programming, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28, 1998

1997
Game Theoretic Analysis of Call-by-Value Computation.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
Abstract Process Structures.
Electr. Notes Theor. Comput. Sci., 1996

Composing Processes.
Proceedings of the Conference Record of POPL'96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1996

1995
On Reduction-Based Process Semantics.
Theor. Comput. Sci., 1995

1994
Notes on P-Algebra 1: Process Structure.
Proceedings of the Theory and Practice of Parallel Programming, 1994

Replication in Concurrent Combinators.
Proceedings of the Theoretical Aspects of Computer Software, 1994

Combinatory Representation of Mobile Processes.
Proceedings of the Conference Record of POPL'94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1994

An Interaction-based Language and its Typing System.
Proceedings of the PARLE '94: Parallel Architectures and Languages Europe, 1994

1993
On Reduction-Based Semantics.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

Principal Typing Schemes in a Polyadic pi-Calculus.
Proceedings of the CONCUR '93, 1993

Types for Dyadic Interaction.
Proceedings of the CONCUR '93, 1993

1991
A small calculus for concurrent objects.
OOPS Messenger, 1991

On Asynchronous Communication Semantics.
Proceedings of the Object-Based Concurrent Computing, 1991

An Object Calculus for Asynchronous Communication.
Proceedings of the ECOOP'91 European Conference on Object-Oriented Programming, 1991

1989
The Computational Field Model for Open Distributed Environments.
Proceedings of the Concurrency: Theory, 1989


  Loading...