Logical Relations for Session-Typed Concurrency

[2309.00192] Logical Relations for Session-Typed Concurrency Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Computer Science > Programming Languages arXiv:2309.00192 (cs) [Submitted on 1 Sep 2023 ( v1 ), last revised 14 Apr 2026 (this version, v2)] Title: Logical Relations for Session-Typed Concurrency Authors: Stephanie Balzer , Farzaneh Derakhshan , Robert Harper , Yue Yao View a PDF of the paper titled Logical Relations for Session-Typed Concurrency, by Stephanie Balzer and Farzaneh Derakhshan and Robert Harper and Yue Yao View PDF HTML (experimental) Abstract: Program equivalence is the fulcrum for reasoning about and proving properties of programs. For noninterference, for example, program equivalence up to the secrecy level of an observer is shown. A powerful enabler for such proofs are logical relations. Logical relations only recently were adopted for session types -- but exclusively for terminating languages. This paper scales logical relations to general recursive session types. It develops a logical relation for progress-sensitive noninterference (PSNI) for intuitionistic linear logic session types (ILLST), tackling the challenges non-termination and concurrency pose, and shows that logical equivalence is sound and complete with regard to closure of weak bisimilarity under parallel composition, using a biorthogonality argument. A distinguishing feature of the logical relation is its stratification with an observation index (as opposed to a step or unfolding index), a crucial shift to make the logical relation closed under parallel composition in a concurrent setting. To demonstrate practicality of the logical relation, the paper develops an information flow control (IFC) refinement type system for ILLST, with support of secrecy-polymorphic processes, and shows that well-typed programs are self-related by the logical relation and thus enjoy PSNI. The refinement type system has been implemented in a type checker, featuring local security theories to support secrecy-polymorphic processes. Comments: arXiv admin note: text overlap with arXiv:2208.13741 Subjects: Programming Languages (cs.PL) Cite as: arXiv:2309.00192 [cs.PL] (or arXiv:2309.00192v2 [cs.PL] for this version) https://doi.org/10.48550/arXiv.2309.00192 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Farzaneh Derakhshan [ view email ] [v1] Fri, 1 Sep 2023 01:13:42 UTC (889 KB) [v2] Tue, 14 Apr 2026 03:04:46 UTC (447 KB) Full-text links: Access Paper: View a PDF of the paper titled Logical Relations for Session-Typed Concurrency, by Stephanie Balzer and Farzaneh Derakhshan and Robert Harper and Yue Yao View PDF HTML (experimental) TeX Source view license Current browse context: cs.PL < prev | next > new | recent | 2023-09 Change to browse by: cs References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

• Universal Properties of Petri Net Unfoldings#1123693
• Multiparty Session Types for GDPR Purpose Compliance#394486
• Example Call Flows of Race Conditions in the Session Initiation Protocol (SIP)#208953
• DLEAC: A Dialetheic Logic with Exclusive Assumptions and Conclusions#708261
• Reasoning with Imperatives Using Classical Logic#735250