◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Tachio Terauchi

Waseda University

14 papers hereh-index 202.3k citations62 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author4
  • last author10

Across the 14 of 14 papers where every author was matched, so the position is known.

fields
  • cs.CR4
  • cs.PL4
  • cs.FL3
  • cs.CC1
  • cs.LO1
  • cs.SE1
affiliations
  • Waseda University
Homepage
same name
  • Tachio Terauchi — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20102026
most citedProgram Verification via Predicate Constraint Satisfiability Modulo Theories

6 citations · 9 across the 12 of their papers we have counts for

collaborators
Showing cs.PLShow all

4 papers · 1 filter

cs.PL2023

Answer Refinement Modification: Refinement Type System for Algebraic Effects and Handlers

Fuga Kawamata, Hiroshi Unno, Taro Sekiyama +1

Algebraic effects and handlers are a mechanism to structure programs with computational effects in a modular way. They are recently gaining popularity and being adopted in practica…

cs.PL2021

Constraint-based Relational Verification

Hiroshi Unno, Tachio Terauchi, Eric Koskinen

In recent years they have been numerous works that aim to automate relational verification. Meanwhile, although Constrained Horn Clauses (CHCs) empower a wide range of verification…

cs.PL2020

Repairing DoS Vulnerability of Real-World Regexes

Nariyoshi Chida, Tachio Terauchi

There has been much work on synthesizing and repairing regular expressions (regexes for short) from examples. These programming-by-example (PBE) methods help the users write regexe…

cs.PL2020★ 6 cited

Program Verification via Predicate Constraint Satisfiability Modulo Theories

Hiroshi Unno, Yuki Satake, Tachio Terauchi +1

This paper presents a verification framework based on a new class of predicate Constraint Satisfaction Problems called pCSP where constraints are represented as clauses modulo firs…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.