default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTachio Terauchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Fuga Kawamata
, Hiroshi Unno, Taro Sekiyama, Tachio Terauchi:
Answer Refinement Modification: Refinement Type System for Algebraic Effects and Handlers. Proc. ACM Program. Lang. 8(POPL): 115-147 (2024)- [i11]Taisei Nogami, Tachio Terauchi:
Regular Expressions with Backreferences on Multiple Context-Free Languages, and the Closed-Star Condition. CoRR abs/2406.18918 (2024) - 2023
- [j10]Nariyoshi Chida, Tachio Terauchi:
On Lookaheads in Regular Expressions with Backreferences. IEICE Trans. Inf. Syst. 106(5): 959-975 (2023) - [j9]Nariyoshi Chida, Tachio Terauchi:
Repairing Regular Expressions for Extraction. Proc. ACM Program. Lang. 7(PLDI): 1633-1656 (2023) - [j8]Hiroshi Unno, Tachio Terauchi, Yu Gu, Eric Koskinen:
Modular Primal-Dual Fixpoint Logic Solving for Temporal Verification. Proc. ACM Program. Lang. 7(POPL): 2111-2140 (2023) - [c31]Taisei Nogami, Tachio Terauchi:
On the Expressive Power of Regular Expressions with Backreferences. MFCS 2023: 71:1-71:15 - [i10]Taisei Nogami, Tachio Terauchi:
On the Expressive Power of Regular Expressions with Backreferences. CoRR abs/2307.08531 (2023) - [i9]Fuga Kawamata, Hiroshi Unno, Taro Sekiyama, Tachio Terauchi:
Answer Refinement Modification: Refinement Type System for Algebraic Effects and Handlers. CoRR abs/2307.15463 (2023) - 2022
- [c30]Nariyoshi Chida, Tachio Terauchi:
On Lookaheads in Regular Expressions with Backreferences. FSCD 2022: 15:1-15:18 - [c29]Nariyoshi Chida, Tachio Terauchi:
Repairing DoS Vulnerability of Real-World Regexes. SP 2022: 2060-2077 - 2021
- [c28]Hiroshi Unno, Tachio Terauchi, Eric Koskinen:
Constraint-Based Relational Verification. CAV (1) 2021: 742-766 - [i8]Hiroshi Unno, Tachio Terauchi, Eric Koskinen:
Constraint-based Relational Verification. CoRR abs/2106.02628 (2021) - 2020
- [j7]Tachio Terauchi, Timos Antonopoulos:
Bucketing and information flow analysis for provable timing attack mitigation. J. Comput. Secur. 28(6): 607-634 (2020) - [i7]Hiroshi Unno, Yuki Satake, Tachio Terauchi, Eric Koskinen:
Program Verification via Predicate Constraint Satisfiability Modulo Theories. CoRR abs/2007.03656 (2020) - [i6]Nariyoshi Chida, Tachio Terauchi:
Automatic Repair of Vulnerable Regular Expressions. CoRR abs/2010.12450 (2020)
2010 – 2019
- 2019
- [c27]Timos Antonopoulos, Tachio Terauchi:
Games for Security Under Adaptive Adversaries. CSF 2019: 216-229 - [c26]Tachio Terauchi, Timos Antonopoulos:
A Formal Analysis of Timing Channel Security via Bucketing. POST 2019: 29-50 - 2018
- [j6]Hiroshi Unno, Yuki Satake, Tachio Terauchi:
Relatively complete refinement type system for verification of higher-order non-deterministic programs. Proc. ACM Program. Lang. 2(POPL): 12:1-12:29 (2018) - [c25]Yoji Nanjo, Hiroshi Unno, Eric Koskinen, Tachio Terauchi:
A Fixpoint Logic and Dependent Effects for Temporal Property Verification. LICS 2018: 759-768 - [i5]Roberto Giacobazzi, Dusko Pavlovic, Tachio Terauchi:
Intensional and extensional aspects of computation: From computability and complexity to program analysis and security (NII Shonan Meeting 2018-1). NII Shonan Meet. Rep. 2018 (2018) - 2017
- [c24]Timos Antonopoulos, Paul Gazzillo, Michael Hicks, Eric Koskinen, Tachio Terauchi, Shiyi Wei:
Decomposition instead of self-composition for proving the absence of timing channels. PLDI 2017: 362-375 - [c23]Arthur Blot, Masaki Yamamoto, Tachio Terauchi:
Compositional Synthesis of Leakage Resilient Programs. POST 2017: 277-297 - 2016
- [c22]Akihiro Murase, Tachio Terauchi, Naoki Kobayashi, Ryosuke Sato, Hiroshi Unno:
Temporal verification of higher-order functional programs. POPL 2016: 57-68 - [i4]Arthur Blot, Masaki Yamamoto, Tachio Terauchi:
Compositional Synthesis of Leakage Resilient Programs. CoRR abs/1610.05603 (2016) - 2015
- [c21]Tachio Terauchi, Hiroshi Unno:
Relaxed Stratification: A New Approach to Practical Complete Predicate Refinement. ESOP 2015: 610-633 - [c20]Tachio Terauchi:
Explaining the Effectiveness of Small Refinement Heuristics in Program Verification with CEGAR. SAS 2015: 128-144 - [c19]Hiroshi Unno, Tachio Terauchi:
Inferring Simple Solutions to Recursion-Free Horn Clauses via Sampling. TACAS 2015: 149-163 - [i3]Marco Gaboardi, Vivek Nigam, Tachio Terauchi:
Logic and Verification Methods in Security and Privacy (NII Shonan Meeting 2015-16). NII Shonan Meet. Rep. 2015 (2015) - 2014
- [j5]Hirotoshi Yasuoka, Tachio Terauchi:
Quantitative information flow as safety and liveness hyperproperties. Theor. Comput. Sci. 538: 167-182 (2014) - [c18]Eric Koskinen, Tachio Terauchi:
Local temporal reasoning. CSL-LICS 2014: 59:1-59:10 - [c17]Takuya Kuwahara, Tachio Terauchi, Hiroshi Unno, Naoki Kobayashi:
Automatic Termination Verification for Higher-Order Functional Programs. ESOP 2014: 392-411 - 2013
- [c16]Hiroshi Unno, Tachio Terauchi, Naoki Kobayashi:
Automating relatively complete verification of higher-order functional programs. POPL 2013: 75-86 - 2012
- [c15]Tachio Terauchi:
Automated Verification of Higher-Order Functional Programs. FLOPS 2012: 2 - [c14]Hirotoshi Yasuoka, Tachio Terauchi:
Quantitative Information Flow as Safety and Liveness Hyperproperties. QAPL 2012: 77-91 - 2011
- [j4]Hirotoshi Yasuoka, Tachio Terauchi:
On bounding problems of quantitative information flow. J. Comput. Secur. 19(6): 1029-1082 (2011) - [i2]Hirotoshi Yasuoka, Tachio Terauchi:
On Bounding Problems of Quantitative Information Flow. CoRR abs/1112.4237 (2011) - 2010
- [c13]Hirotoshi Yasuoka, Tachio Terauchi:
Quantitative Information Flow - Verification Hardness and Possibilities. CSF 2010: 15-27 - [c12]Hirotoshi Yasuoka, Tachio Terauchi:
On Bounding Problems of Quantitative Information Flow. ESORICS 2010: 357-372 - [c11]Tachio Terauchi:
Dependent types from counterexamples. POPL 2010: 119-130 - [i1]Hirotoshi Yasuoka, Tachio Terauchi:
Quantitative Information Flow - Verification Hardness and Possibilities. CoRR abs/1004.0062 (2010)
2000 – 2009
- 2009
- [c10]Hirotoshi Yasuoka, Tachio Terauchi:
Polymorphic Fractional Capabilities. SAS 2009: 36-51 - 2008
- [j3]Tachio Terauchi, Alex Aiken:
Witnessing side effects. ACM Trans. Program. Lang. Syst. 30(3): 15:1-15:42 (2008) - [j2]Tachio Terauchi, Alex Aiken:
A capability calculus for concurrency and determinism. ACM Trans. Program. Lang. Syst. 30(5): 27:1-27:30 (2008) - [c9]Tachio Terauchi:
A Type System for Observational Determinism. CSF 2008: 287-300 - [c8]Tachio Terauchi, Adam Megacz:
Inferring Channel Buffer Bounds Via Linear Programming. ESOP 2008: 284-298 - [c7]Tachio Terauchi:
Checking race freedom via linear programming. PLDI 2008: 1-10 - 2006
- [c6]Tachio Terauchi, Alex Aiken:
A Capability Calculus for Concurrency and Determinism. CONCUR 2006: 218-232 - [c5]Tachio Terauchi, Alex Aiken:
On Typability for Rank-2 Intersection Types with Polymorphic Recursion. LICS 2006: 111-122 - 2005
- [c4]Tachio Terauchi, Alex Aiken:
Witnessing side-effects. ICFP 2005: 105-115 - [c3]Tachio Terauchi, Alex Aiken:
Secure Information Flow as a Safety Problem. SAS 2005: 352-367 - 2003
- [c2]Alex Aiken, Jeffrey S. Foster, John Kodumal, Tachio Terauchi:
Checking and inferring local non-aliasing. PLDI 2003: 129-140 - 2002
- [c1]Jeffrey S. Foster, Tachio Terauchi, Alex Aiken:
Flow-Sensitive Type Qualifiers. PLDI 2002: 1-12
1990 – 1999
- 1999
- [j1]Tobias Höllerer, Steven Feiner, Tachio Terauchi, Gus Rashid, Drexel Hallaway:
Exploring MARS: developing indoor and outdoor user interfaces to a mobile augmented reality system. Comput. Graph. 23(6): 779-785 (1999)
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-10-07 22:20 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:
