4 papers
A Fast Quantitative Analyzer for NetKAT
Thomas Lu, Qiancheng Fu, Kevin Batz +5
When designing a network, engineers must navigate trade-offs (e.g., one topology offers more aggregate bandwidth, another lower latency or better resilience) that demand reasoning…
Outrunning Big KATs: Efficient Decision Procedures for Variants of GKAT
Cheng Zhang, Qiancheng Fu, Hang Ji +3
This paper presents several efficient decision procedures for trace equivalence of GKAT automata, which make use of on-the-fly symbolic techniques via SAT solvers. To demonstrate a…
Dependent Session Types for Verified Concurrent Programming
Qiancheng Fu, Hongwei Xi, Ankush Das
We present TLLC which extends the Two-Level Linear dependent type theory (TLL) with session-based concurrency. Equipped with Martin-Löf style dependency, the session types of TLLC…
A Two-Level Linear Dependent Type Theory
Qiancheng Fu, Hongwei Xi
We present a type theory combining both linearity and dependency by stratifying typing rules into a level for logics and a level for programs. The distinction between logics and pr…