Resource-Aware Session Types for Digital Contracts

Das, Ankush; Balzer, Stephanie; Hoffmann, J.; Pfenning, Frank; Santurkar, Ishani

doi:10.48550/arxiv.1902.06056

Cited by 4 publications

(6 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Binary session types have also been employed in representing digital contracts [Das et al 2019] such as auctions, lotteries, bank accounts, etc. We can use probabilistic session types to inject probabilistic behavior into such contracts.…”

Section: Digital Contractsmentioning

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: Digital Contractsmentioning

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

“…The utility of remainder contexts stands even without worldviews. Through private correspondence with other researchers, remainder context ideas have already been used in the implementation of the Nomos typechecker [24]. Other linear type systems, such as those for quantum computing, may also be able to make use of this abstraction.…”

Section: Technical Implicationsmentioning

confidence: 99%

Automatic Amortized Resource Analysis with the Quantum Physicist's Method

Kahn¹,

Hoffmann²

2021

Preprint

Self Cite

View full text Add to dashboard Cite

We present a novel method for working with the physicist's method of amortized resource analysis, which we call the quantum physicist's method. These principles allow for more precise analyses of resources that are not monotonically consumed, like stack. This method takes its name from its two major features, worldviews and resource tunneling, which behave analogously to quantum superposition and quantum tunneling. We use the quantum physicist's method to extend the Automatic Amortized Resource Analysis (AARA) type system, enabling the derivation of resource bounds based on tree depth. In doing so, we also introduce remainder contexts, which aid bookkeeping in linear type systems. We then evaluate this new type system's performance by bounding stack use of functions in the Set module of OCaml's standard library. Compared to state-of-theart implementations of AARA, our new system derives tighter bounds with only moderate overhead.CCS Concepts: • Software and its engineering → Constraint and logic languages; Automated static analysis; General programming languages; • Theory of computation → Program analysis.

show abstract

“…Session types with limited arithmetic refinements (only base types could be refined) have been proposed for the purpose of runtime monitoring [19,18], which is complementary to our uses for static verification. They have also been proposed to capture work [12,10] and parallel time [11], but parameterization over index objects was left to an informal meta-level and not part of the object language. Consequently, these languages contain neither constraints nor quantifiers, and the metatheory of type equality, type checking, and reconstruction in the presence of index variables was not developed.…”

Section: Further Related Workmentioning

confidence: 99%

Session Types with Arithmetic Refinements

Das¹,

Pfenning²

2020

Preprint

Self Cite

View full text Add to dashboard Cite

Session types statically prescribe bidirectional communication protocols for message-passing processes. However, simple session types cannot specify properties beyond the type of exchanged messages. In this paper we extend the type system by using index refinements from linear arithmetic capturing intrinsic attributes of data structures and algorithms. We show that, despite the decidability of Presburger arithmetic, type equality and therefore also subtyping and type checking are now undecidable, which stands in contrast to analogous dependent refinement type systems from functional languages. We also present a practical, but incomplete algorithm for type equality, which we have used in our implementation of Rast, a concurrent session-typed language with arithmetic index refinements as well as ergometric and temporal types. Moreover, if necessary, the programmer can propose additional type bisimulations that are smoothly integrated into the type equality algorithm.

show abstract

Resource-Aware Session Types for Digital Contracts

Cited by 4 publications

References 0 publications

Work Analysis with Resource-Aware Session Types

Work Analysis with Resource-Aware Session Types

Automatic Amortized Resource Analysis with the Quantum Physicist's Method

Session Types with Arithmetic Refinements

Contact Info

Product

Resources

About