Keiko Nakata

Publication Activity (10 Years)

Years Active: 2006-2016
Publications (10 Years): 2

Top Topics

Sequent Calculi

Formal Analysis

Top Venues

NII Shonan Meet. Rep.

Log. Methods Comput. Sci.

Publications

Hanno Becker, Juan Manuel Crespo, Jacek Galowicz, Ulrich Hensel, Yoichi Hirai, César Kunz, Keiko Nakata, Jorge Luis Sacchini, Hendrik Tews, Thomas Tuerk
Combining Mechanized Proofs and Model-Based Testing in the Formal Analysis of a Hypervisor. FM (2016)
Marc Bezem, Thierry Coquand, Keiko Nakata, Erik Parmann
Realizability at Work: Separating Two Constructive Notions of Finiteness. TYPES (2016)
Richard Bubel, Crystal Chang Din, Reiner Hähnle, Keiko Nakata
A Dynamic Logic with Traces and Coinduction. TABLEAUX (2015)
Keiko Nakata, Tarmo Uustalu
A Hoare logic for the coinductive trace-based big-step semantics of While. Log. Methods Comput. Sci. 11 (1) (2015)
Cyrille Artho, Einar Broch Johnsen, Martin Leucker, Keiko Nakata
Static analysis meets runtime verification (NII Shonan Meeting 2015-5). NII Shonan Meet. Rep. 2015 (2015)
Keiko Nakata, Andri Saar
Compiling Cooperative Task Management to Continuations. FSEN (2013)
Willard Rafnsson, Keiko Nakata, Andrei Sabelfeld
Securing Class Initialization in Java-like Languages. IEEE Trans. Dependable Secur. Comput. 10 (1) (2013)
Danko Ilik, Keiko Nakata
A Direct Version of Veldman's Proof of Open Induction on Cantor Space via Delimited Control Operators. TYPES (2013)
Ichiro Hasuo, Keiko Nakata, Tarmo Uustalu
Coinduction for Computation Structures and Programming Languages (NII Shonan Meeting 2013-11). NII Shonan Meet. Rep. 2013 (2013)
Hyeonseung Im, Keiko Nakata, Sungwoo Park
Contractive Signatures with Recursive Types, Type Parameters, and Abstract Types. ICALP (2) (2013)
Danko Ilik, Keiko Nakata
A Constructive Proof of Open Induction Using Delimited Control Operators CoRR (2012)
Zena M. Ariola, Paul Downen, Hugo Herbelin, Keiko Nakata, Alexis Saurin
Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts. FLOPS (2012)
Marc Bezem, Keiko Nakata, Tarmo Uustalu
On streams that are finitely red Log. Methods Comput. Sci. 8 (4) (2012)
Hyeonseung Im, Keiko Nakata, Jacques Garrigue, Sungwoo Park
A syntactic type system for recursive modules. OOPSLA (2011)
Keiko Nakata, Tarmo Uustalu, Marc Bezem
A Proof Pearl with the Fan Theorem and Bar Induction - Walking through Infinite Trees with Mixed Induction and Coinduction. APLAS (2011)
Jacques Garrigue, Keiko Nakata
Path resolution for nested recursive modules. High. Order Symb. Comput. 24 (3) (2011)
Keiko Nakata
Resumption-based big-step and small-step interpreters for While with interactive I/O DSL (2011)
Keiko Nakata, Tarmo Uustalu
A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While. ESOP (2010)
Keiko Nakata, Andrei Sabelfeld
Securing Class Initialization. IFIPTM (2010)
Keiko Nakata, Tarmo Uustalu
Resumptions, Weak Bisimilarity and Big-Step Semantics for While with Interactive I/O: An Exercise in Mixed Induction-Coinduction SOS (2010)
Keiko Nakata
Denotational Semantics for Lazy Initialization of letrec. FICS (2010)
Keiko Nakata
Lazy mixin modules and disciplined effects CoRR (2009)
Keiko Nakata, Masahito Hasegawa
Small-step and big-step semantics for call-by-need. J. Funct. Program. 19 (6) (2009)
Keiko Nakata, Masahito Hasegawa
Small-step and big-step semantics for call-by-need CoRR (2009)
Keiko Nakata, Tarmo Uustalu
Trace-Based Coinductive Operational Semantics for While. TPHOLs (2009)
Keiko Nakata, Jacques Garrigue
Recursive modules for programming. ICFP (2006)