This work was supported by the National Natural Science Foundation of China under Grant Nos.61802126,61672229,61832015 and 62072176;the Ministry of Science and Technology of the People’s Republic of China under Grant No.2018YFC0830400;Shanghai Pujiang Program under Grant No.17PJ1402200.
Conditional pushdown systems (CPDSs) extend pushdown systems by associating each transition rule with a regular language over the stack alphabet. The goal is to model program verification problems that need to examine...
We proposed a novel solution schema called the Hierarchical Labeling Schema (HLS) to answer reachability queries in directed graphs. Different from many existing approaches that focus on static directed acyclic grap...
The problem of k-hop reachability between two vertices in a graph has received considerable attention in recent years. A substantial number of algorithms have been proposed with the goal of improving the searching e?...
In this paper, we provide a necessary infrastructure to define an abstract state exploration in the HOL theorem prover. Our infrastructure is based on a deep embedding of the Multiway Decision Graphs (MDGs) theory i...