List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| On the expressive power of regular expressions with backreferences | 2024-12-03 | Paper |
| On lookaheads in regular expressions with backreferences | 2024-05-27 | Paper |
| A formal analysis of timing channel security via bucketing Lecture Notes in Computer Science | 2023-11-24 | Paper |
| Constraint-based relational verification (available as arXiv preprint) | 2022-03-25 | Paper |
| Quantitative information flow as safety and liveness hyperproperties | 2021-04-14 | Paper |
| A fixpoint logic and dependent effects for temporal property verification Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
| Compositional Synthesis of Leakage Resilient Programs Lecture Notes in Computer Science | 2020-08-03 | Paper |
| Inferring simple solutions to recursion-free Horn clauses via sampling Tools and Algorithms for the Construction and Analysis of Systems | 2019-09-17 | Paper |
| 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) | 2018-04-23 | Paper |
| Temporal verification of higher-order functional programs Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-10-24 | Paper |
| Relaxed stratification: a new approach to practical complete predicate refinement Programming Languages and Systems | 2016-04-26 | Paper |
| Dependent types from counterexamples Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-06-11 | Paper |
| Witnessing side-effects Proceedings of the tenth ACM SIGPLAN international conference on Functional programming | 2015-01-06 | Paper |
| Automating relatively complete verification of higher-order functional programs Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-11-27 | Paper |
| Quantitative information flow as safety and liveness hyperproperties Theoretical Computer Science | 2014-06-06 | Paper |
| Automatic Termination Verification for Higher-Order Functional Programs Programming Languages and Systems | 2014-04-16 | Paper |
| Polymorphic Fractional Capabilities Static Analysis | 2009-08-18 | Paper |
| Inferring Channel Buffer Bounds Via Linear Programming Programming Languages and Systems | 2008-04-11 | Paper |
| A Capability Calculus for Concurrency and Determinism CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
| Static Analysis Lecture Notes in Computer Science | 2006-10-31 | Paper |
Research outcomes over time
This page was built for person: Tachio Terauchi
