Reproduce “Dependent Session Types for Verified Concurrent Programming” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Qiancheng Fu, Hongwei Xi, Ankush Das

The TLL_C language integrates Martin-Löf style dependent types with linear and session types to enable semantic verification of concurrent programs. It allows for precise specification and proof of properties such as cryptographic protocol adherence and relational correctness against sequential models, while compiling to efficient C code with ghost erasure.

Key insights

  • Combining Martin-Löf dependent types with linear types and session types allows for intrinsic semantic verification of concurrent programs, going beyond mere communication safety.
  • Relational verification, where concurrent algorithms are proven correct by relating their type-level specification to a simpler sequential model, offers a powerful and scalable approach to verifying complex concurrent systems.
  • The explicit separation of communication protocols from their channel endpoints provides an elegant solution for integrating recursive session types into dependently typed functional languages, avoiding classic duality challenges.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.