Non-Blocking Concurrent Imperative Programming with Session Types

Silva, Miguel E P; Florido, Mário; Pfenning, Frank

doi:10.4204/eptcs.238.7

Cited by 4 publications

(4 citation statements)

References 14 publications

(17 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Like previous work, our semantics is a substructural operational semantics [41] based on multiset rewriting [17] and asynchronous communication [40]. It can be seen as a combination of an asynchronous version of a recently introduced synchronous session-type semantics [9] with the cost tracking semantics of Concurrent C0 [42]. The technical advantage of our semantics is that it avoids the complex operational artifacts of Silva et al [42] such as message buffers: processes and messages can be typed with exactly the same typing rules, changing only the cost metric.…”

Section: Cost Semanticsmentioning

confidence: 99%

Work Analysis with Resource-Aware Session Types

Das

Hoffmann

Pfenning

2018

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science

Self Cite

View full text Add to dashboard Cite

While there exist several successful techniques for supporting programmers in deriving static resource bounds for sequential code, analyzing the resource usage of message-passing concurrent processes poses additional challenges. To meet these challenges, this article presents an analysis for statically deriving worst-case bounds on the total work performed by message-passing processes. To decompose interacting processes into components that can be analyzed in isolation, the analysis is based on novel resource-aware session types, which describe protocols and resource contracts for inter-process communication. A key innovation is that both messages and processes carry potential to share and amortize cost while communicating. To symbolically express resource usage in a setting without static data structures and intrinsic sizes, resource contracts describe bounds that are functions of interactions between processes. Resource-aware session types combine standard binary session types and type-based amortized resource analysis in a linear type system. This type system is formulated for a core session-type calculus of the language SILL and proved sound with respect to a multiset-based operational cost semantics that tracks the total number of messages that are exchanged in a system. The effectiveness of the analysis is demonstrated by analyzing standard examples from amortized analysis and the literature on session types and by a comparative performance analysis of different concurrent programs implementing the same interface. arXiv:1712.08310v2 [cs.PL] 27 Apr 2018components that can be analyzed in isolation. After all, the resource usage of each component crucially depends on its interactions with the world.In this paper, we study the foundations of worst-case resource analysis for message-passing processes. A key idea of our approach is to rely on resourceaware session types to describe structure, protocols, and resource bounds for inter-process communication that we can use to perform a compositional and precise amortized analysis. Session types [32,33,12,13,45] prescribe bidirectional communication protocols for message-passing processes. Binary session types govern the interaction of two processes along a single channel, prescribing complementary send and receive actions for the processes at the two endpoints of a channel. We use such protocols as the basis of resource usage contracts that not only specify the type but also the potential of a message that is sent along a channel. The potential (in the sense of classic amortized analysis [43]) may be spent sending other messages as part of the network of interacting processes, or maintained locally for future interactions. Resource analysis is static, using the type system, and the runtime behavior of programs is not affected.

show abstract

Section: Cost Semanticsmentioning

confidence: 99%

Work Analysis with Resource-Aware Session Types

Das

Hoffmann

Pfenning

2018

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…This, combined with the subsequent encodings of fixed-points [37], can be seen as the semantic foundation for the works extending the web-based programming language Links with session types [19,20,38]. We further note the addition of session-based concurrency to the language C0 [69,77], drawing upon the semantic foundation provided by the encodings for the intuitionistic setting [70,73].…”

Section: Related Workmentioning

confidence: 99%

On Polymorphic Sessions and Functions

Toninho

Yoshida

2021

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

This work exploits the logical foundation of session types to determine what kind of type discipline for the Λ-calculus can exactly capture, and is captured by, Λ-calculus behaviours. Leveraging the proof theoretic content of the soundness and completeness of sequent calculus and natural deduction presentations of linear logic, we develop the first mutually inverse and fully abstract processes-as-functions and functions-as-processes encodings between a polymorphic session π-calculus and a linear formulation of System F. We are then able to derive results of the session calculus from the theory of the Λ-calculus: (1) we obtain a characterisation of inductive and coinductive session types via their algebraic representations in System F; and (2) we extend our results to account for value and process passing, entailing strong normalisation.

show abstract

“…eir work is complemented by an expressive dynamic veri cation framework in real-time distributed systems [124], which I do not consider. Semantics counting communication costs for work and span in session-typed programs were given by Silva et al [146], but no techniques for analyzing them were provided.…”

Section: Related Workmentioning

confidence: 99%

Resource-Aware Session Types for Digital Contracts

Das

Balzer

Hoffmann

et al. 2021

2021 IEEE 34th Computer Security Foundations Symposium (CSF)

View full text Add to dashboard Cite

Although I am its author, this dissertation is really a joint e ort. First and foremost, I would like to thank my advisor Jan Ho mann for his unwavering support. Jan, thank you for your patience with me while I learned the basics of programming language theory. Your vision, not just about PL, but about success in research will always stay with me. And a special thanks for your constant guidance during my job application process. I also want to express my sincere gratitude to Frank Pfenning who, despite not being my o cial advisor, always treated me like his student. Frank, your vast experience and clarity of thought has taught me so much about PL research. I really enjoyed my collaborations and pair programming experiences with you; we have created some really impressive so ware together! Before anyone else, I would like to take this opportunity to thank my partner Dr. Shrimai Prabhumoye. Without you, I would not have been able to successfully complete my PhD. e life principles I have learned from you have made me, not just a be er researcher, but a be er person.I would also like to thank my commi ee members: Andrew Miller for introducing me to the world of security, privacy, and applied cryptography; Bryan Parno for providing amazing feedback on my application materials and dissertation; and especially Shaz Qadeer for enabling an awesome internship experience and teaching me how to become an independent researcher. I'd also like to thank all my collaborators:

show abstract

Non-Blocking Concurrent Imperative Programming with Session Types

Cited by 4 publications

References 14 publications

Work Analysis with Resource-Aware Session Types

Work Analysis with Resource-Aware Session Types

On Polymorphic Sessions and Functions

Resource-Aware Session Types for Digital Contracts

Contact Info

Product

Resources

About