default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKeiko Nakata 0001
Person information
- affiliation: FireEye, Dresden, Germany
- affiliation: Tallinn University of Technology
Other persons with the same name
- Keiko Nakata 0002 — NTT Information and Communication Systems Laboratories, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c16]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: 69-84- [c15]Marc Bezem, Thierry Coquand, Keiko Nakata, Erik Parmann:
Realizability at Work: Separating Two Constructive Notions of Finiteness. TYPES 2016: 6:1-6:23 - 2015
- [j5]Keiko Nakata, Tarmo Uustalu:
A Hoare logic for the coinductive trace-based big-step semantics of While. Log. Methods Comput. Sci. 11(1) (2015) - [c14]Richard Bubel, Crystal Chang Din, Reiner Hähnle, Keiko Nakata:
A Dynamic Logic with Traces and Coinduction. TABLEAUX 2015: 307-322 - [i5]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) - 2013
- [j4]Willard Rafnsson, Keiko Nakata, Andrei Sabelfeld:
Securing Class Initialization in Java-like Languages. IEEE Trans. Dependable Secur. Comput. 10(1): 1-13 (2013) - [c13]Keiko Nakata, Andri Saar:
Compiling Cooperative Task Management to Continuations. FSEN 2013: 95-110 - [c12]Hyeonseung Im, Keiko Nakata, Sungwoo Park:
Contractive Signatures with Recursive Types, Type Parameters, and Abstract Types. ICALP (2) 2013: 299-311 - [c11]Danko Ilik, Keiko Nakata:
A Direct Version of Veldman's Proof of Open Induction on Cantor Space via Delimited Control Operators. TYPES 2013: 188-201 - [i4]Ichiro Hasuo, Keiko Nakata, Tarmo Uustalu:
Coinduction for Computation Structures and Programming Languages (NII Shonan Meeting 2013-11). NII Shonan Meet. Rep. 2013 (2013) - 2012
- [j3]Marc Bezem, Keiko Nakata, Tarmo Uustalu:
On streams that are finitely red. Log. Methods Comput. Sci. 8(4) (2012) - [c10]Zena M. Ariola, Paul Downen, Hugo Herbelin, Keiko Nakata, Alexis Saurin:
Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts. FLOPS 2012: 32-46 - [i3]Danko Ilik, Keiko Nakata:
A Constructive Proof of Open Induction Using Delimited Control Operators. CoRR abs/1209.2229 (2012) - 2011
- [j2]Jacques Garrigue, Keiko Nakata:
Path resolution for nested recursive modules. High. Order Symb. Comput. 24(3): 207-237 (2011) - [c9]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: 353-368 - [c8]Hyeonseung Im, Keiko Nakata, Jacques Garrigue, Sungwoo Park:
A syntactic type system for recursive modules. OOPSLA 2011: 993-1012 - [c7]Keiko Nakata:
Resumption-based big-step and small-step interpreters for While with interactive I/O. DSL 2011: 226-235 - 2010
- [c6]Keiko Nakata, Tarmo Uustalu:
A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While. ESOP 2010: 488-506 - [c5]Keiko Nakata:
Denotational Semantics for Lazy Initialization of letrec. FICS 2010: 61-67 - [c4]Keiko Nakata, Andrei Sabelfeld:
Securing Class Initialization. IFIPTM 2010: 48-62 - [c3]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: 57-75
2000 – 2009
- 2009
- [j1]Keiko Nakata, Masahito Hasegawa:
Small-step and big-step semantics for call-by-need. J. Funct. Program. 19(6): 699-722 (2009) - [c2]Keiko Nakata, Tarmo Uustalu:
Trace-Based Coinductive Operational Semantics for While. TPHOLs 2009: 375-390 - [i2]Keiko Nakata, Masahito Hasegawa:
Small-step and big-step semantics for call-by-need. CoRR abs/0907.4640 (2009) - [i1]Keiko Nakata:
Lazy mixin modules and disciplined effects. CoRR abs/0908.3650 (2009) - 2006
- [c1]Keiko Nakata, Jacques Garrigue:
Recursive modules for programming. ICFP 2006: 74-86
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
