A number of models of linear logic are based on or closely related to li...
This paper shows that a variety of software model-checking algorithms ca...
We propose an automated method for proving termination of π-calculus
pro...
Loop-invariant synthesis is the basis of every program verification
proc...
We introduce PHFL, a probabilistic extension of higher-order fixpoint lo...
A cyclic proof system allows us to perform inductive reasoning without
e...
It has been well known that naively combining polymorphic effects and
po...
Reduction to the satisfiability problem for constrained Horn clauses (CH...
Higher-order modal fixpoint logic (HFL) is a higher-order extension of t...
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...