Keiko Nakata

Affiliations:
  • FireEye, Dresden, Germany
  • Tallinn University of Technology


According to our database1, Keiko Nakata authored at least 24 papers between 2006 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
Realizability at Work: Separating Two Constructive Notions of Finiteness.
Proceedings of the 22nd International Conference on Types for Proofs and Programs, 2016

Combining Mechanized Proofs and Model-Based Testing in the Formal Analysis of a Hypervisor.
Proceedings of the FM 2016: Formal Methods, 2016

2015
Static analysis meets runtime verification (NII Shonan Meeting 2015-5).
NII Shonan Meet. Rep., 2015

A Hoare logic for the coinductive trace-based big-step semantics of While.
Log. Methods Comput. Sci., 2015

A Dynamic Logic with Traces and Coinduction.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2015

2013
Securing Class Initialization in Java-like Languages.
IEEE Trans. Dependable Secur. Comput., 2013

Coinduction for Computation Structures and Programming Languages (NII Shonan Meeting 2013-11).
NII Shonan Meet. Rep., 2013

A Direct Version of Veldman's Proof of Open Induction on Cantor Space via Delimited Control Operators.
Proceedings of the 19th International Conference on Types for Proofs and Programs, 2013

Contractive Signatures with Recursive Types, Type Parameters, and Abstract Types.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Compiling Cooperative Task Management to Continuations.
Proceedings of the Fundamentals of Software Engineering - 5th International Conference, 2013

2012
On streams that are finitely red
Log. Methods Comput. Sci., 2012

A Constructive Proof of Open Induction Using Delimited Control Operators
CoRR, 2012

Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts.
Proceedings of the Functional and Logic Programming - 11th International Symposium, 2012

2011
Path resolution for nested recursive modules.
High. Order Symb. Comput., 2011

Resumption-based big-step and small-step interpreters for While with interactive I/O
Proceedings of the Proceedings IFIP Working Conference on Domain-Specific Languages, 2011

A syntactic type system for recursive modules.
Proceedings of the 26th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2011

A Proof Pearl with the Fan Theorem and Bar Induction - Walking through Infinite Trees with Mixed Induction and Coinduction.
Proceedings of the Programming Languages and Systems - 9th Asian Symposium, 2011

2010
Resumptions, Weak Bisimilarity and Big-Step Semantics for While with Interactive I/O: An Exercise in Mixed Induction-Coinduction
Proceedings of the Proceedings Seventh Workshop on Structural Operational Semantics, 2010

Securing Class Initialization.
Proceedings of the Trust Management IV - 4th IFIP WG 11.11 International Conference, 2010

Denotational Semantics for Lazy Initialization of letrec.
Proceedings of the 7th Workshop on Fixed Points in Computer Science, 2010

2009
Small-step and big-step semantics for call-by-need.
J. Funct. Program., 2009

Lazy mixin modules and disciplined effects
CoRR, 2009

Trace-Based Coinductive Operational Semantics for While.
Proceedings of the Theorem Proving in Higher Order Logics, 22nd International Conference, 2009

2006
Recursive modules for programming.
Proceedings of the 11th ACM SIGPLAN International Conference on Functional Programming, 2006


  Loading...