DeepAI AI Chat
Log In Sign Up

On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments (Long Version)

by   Ugo Dal Lago, et al.

A system of session types is introduced as induced by a Curry Howard correspondence applied to Bounded Linear Logic, and then extending the thus obtained type system with probabilistic choices and ground types. The obtained system satisfies the expected properties, like subject reduction and progress, but also unexpected ones, like a polynomial bound on the time needed to reduce processes. This makes the system suitable for modelling experiments and proofs from the so-called computational model of cryptography.


page 1

page 2

page 3

page 4


Probabilistic Analysis of Binary Sessions

We study a probabilistic variant of binary session types that relate to ...

Towards Probabilistic Session-Type Monitoring

We present a tool-based approach for the runtime analysis of communicati...

Linear Logic, the π-calculus, and their Metatheory: A Recipe for Proofs as Processes

Initiated by Abramsky [1994], the Proofs as Processes agenda is to estab...

Probabilities in Session Types

This paper deals with the probabilistic behaviours of distributed system...

Circular Proofs as Session-Typed Processes: A Local Validity Condition

Proof theory provides a foundation for studying and reasoning about prog...

PSTMonitor: Monitor Synthesis from Probabilistic Session Types

We present PSTMonitor, a tool for the run-time verification of quantitat...

Probabilistic Soft Type Assignment

We model randomized complexity classes in the style of Implicit Computat...