research
∙
10/15/2022
A Simple and Strong Baseline for End-to-End Neural RST-style Discourse Parsing
To promote and further develop RST-style discourse parsing models, we ne...
share
research
∙
03/16/2022
On Higher-Order Reachability Games vs May Reachability
We consider the reachability problem for higher-order functional program...
research
∙
03/16/2022
Gradual Tensor Shape Checking
Tensor shape mismatch is a common source of bugs in deep learning progra...
research
∙
03/15/2022
Automatic HFL(Z) Validity Checking for Program Verification
We propose an automated method for checking the validity of a formula of...
research
∙
09/10/2021
An Overview of the HFL Model Checking Project
In this article, we give an overview of our project on higher-order prog...
research
∙
09/01/2021
Termination Analysis for the π-Calculus by Reduction to Sequential Program Termination
We propose an automated method for proving termination of π-calculus pro...
research
∙
08/17/2021
Symbolic Automatic Relations and Their Applications to SMT and CHC Solving
Despite the recent advance of automated program verification, reasoning ...
research
∙
04/15/2021
Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes
We address the problem of analysing the complexity of concurrent program...
research
∙
03/17/2021
Toward Neural-Network-Guided Program Synthesis and Verification
We propose a novel framework of program and invariant synthesis called n...
research
∙
11/29/2020
A Probabilistic Higher-order Fixpoint Logic
We introduce PHFL, a probabilistic extension of higher-order fixpoint lo...
research
∙
10/28/2020
A Cyclic Proof System for HFLN
A cyclic proof system allows us to perform inductive reasoning without e...
research
∙
03/18/2020
Grammar compression with probabilistic context-free grammar
We propose a new approach for universal lossless text compression, based...
research
∙
02/20/2020
RustHorn: CHC-based Verification for Rust Programs (full version)
Reduction to the satisfiability problem for constrained Horn clauses (CH...
research
∙
02/18/2020
ConSORT: Context- and Flow-Sensitive Ownership Refinement Types for Imperative Programs
We present ConSORT, a type system for safety verification in the presenc...
research
∙
08/27/2019
A Type-Based HFL Model Checking Algorithm
Higher-order modal fixpoint logic (HFL) is a higher-order extension of t...
research
∙
11/06/2018
On the Termination Problem for Probabilistic Higher-Order Recursive Programs
In the last two decades, there has been much progress on model checking ...
research
∙
01/11/2018
Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence
It is well known that the length of a beta-reduction sequence of a simpl...
research
∙
10/24/2017
