To promote and further develop RST-style discourse parsing models, we ne...
We consider the reachability problem for higher-order functional program...
Tensor shape mismatch is a common source of bugs in deep learning progra...
We propose an automated method for checking the validity of a formula of...
In this article, we give an overview of our project on higher-order prog...
We propose an automated method for proving termination of π-calculus
pro...
Despite the recent advance of automated program verification, reasoning ...
We address the problem of analysing the complexity of concurrent program...
We propose a novel framework of program and invariant synthesis called n...
We introduce PHFL, a probabilistic extension of higher-order fixpoint lo...
A cyclic proof system allows us to perform inductive reasoning without
e...
We propose a new approach for universal lossless text compression, based...
Reduction to the satisfiability problem for constrained Horn clauses (CH...
We present ConSORT, a type system for safety verification in the presenc...
Higher-order modal fixpoint logic (HFL) is a higher-order extension of t...
In the last two decades, there has been much progress on model checking ...
It is well known that the length of a beta-reduction sequence of a simpl...
There are two kinds of higher-order extensions of model checking: HORS m...