Tachio Terauchi

According to our database1, Tachio Terauchi authored at least 33 papers between 1999 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Bucketing and information flow analysis for provable timing attack mitigation.
J. Comput. Secur., 2020

Automatic Repair of Vulnerable Regular Expressions.
CoRR, 2020

Program Verification via Predicate Constraint Satisfiability Modulo Theories.
CoRR, 2020

2019
A Formal Analysis of Timing Channel Security via Bucketing.
Proceedings of the Principles of Security and Trust - 8th International Conference, 2019

Games for Security Under Adaptive Adversaries.
Proceedings of the 32nd IEEE Computer Security Foundations Symposium, 2019

2018
Relatively complete refinement type system for verification of higher-order non-deterministic programs.
Proc. ACM Program. Lang., 2018

A Fixpoint Logic and Dependent Effects for Temporal Property Verification.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017
Compositional Synthesis of Leakage Resilient Programs.
Proceedings of the Principles of Security and Trust - 6th International Conference, 2017

Decomposition instead of self-composition for proving the absence of timing channels.
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

2016
Temporal verification of higher-order functional programs.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

2015
Logic and Verification Methods in Security and Privacy (NII Shonan Meeting 2015-16).
NII Shonan Meet. Rep., 2015

Inferring Simple Solutions to Recursion-Free Horn Clauses via Sampling.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

Explaining the Effectiveness of Small Refinement Heuristics in Program Verification with CEGAR.
Proceedings of the Static Analysis - 22nd International Symposium, 2015

Relaxed Stratification: A New Approach to Practical Complete Predicate Refinement.
Proceedings of the Programming Languages and Systems, 2015

2014
Quantitative information flow as safety and liveness hyperproperties.
Theor. Comput. Sci., 2014

Automatic Termination Verification for Higher-Order Functional Programs.
Proceedings of the Programming Languages and Systems, 2014

Local temporal reasoning.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
Automating relatively complete verification of higher-order functional programs.
Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

2012
Automated Verification of Higher-Order Functional Programs.
Proceedings of the Functional and Logic Programming - 11th International Symposium, 2012

2011
On bounding problems of quantitative information flow.
J. Comput. Secur., 2011

2010
Dependent types from counterexamples.
Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2010

Quantitative Information Flow - Verification Hardness and Possibilities.
Proceedings of the 23rd IEEE Computer Security Foundations Symposium, 2010

2009
Polymorphic Fractional Capabilities.
Proceedings of the Static Analysis, 16th International Symposium, 2009

2008
A capability calculus for concurrency and determinism.
ACM Trans. Program. Lang. Syst., 2008

Witnessing side effects.
ACM Trans. Program. Lang. Syst., 2008

Checking race freedom via linear programming.
Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation, 2008

Inferring Channel Buffer Bounds Via Linear Programming.
Proceedings of the Programming Languages and Systems, 2008

A Type System for Observational Determinism.
Proceedings of the 21st IEEE Computer Security Foundations Symposium, 2008

2006
On Typability for Rank-2 Intersection Types with Polymorphic Recursion.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

2005
Secure Information Flow as a Safety Problem.
Proceedings of the Static Analysis, 12th International Symposium, 2005

2003
Checking and inferring local non-aliasing.
Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation 2003, 2003

2002
Flow-Sensitive Type Qualifiers.
Proceedings of the 2002 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2002

1999
Exploring MARS: developing indoor and outdoor user interfaces to a mobile augmented reality system.
Comput. Graph., 1999


  Loading...