# Relating Process Languages for Security and Communication Correctness (Extended Abstract)

@inproceedings{Nantes2018RelatingPL,
title={Relating Process Languages for Security and Communication Correctness (Extended Abstract)},
author={Daniele Nantes and Jorge A. P{\'e}rez},
booktitle={FORTE},
year={2018}
}
• Published in FORTE 18 June 2018
• Computer Science
Process calculi are expressive specification languages for concurrency. They have been very successful in two research strands: (a) the analysis of security protocols and (b) the enforcement of correct message-passing programs. Despite their shared foundations, languages and reasoning techniques for (a) and (b) have been separately developed. Here we connect two representative calculi from (a) and (b): we encode a (high-level) $$\pi$$-calculus for multiparty sessions into a (low-level) applied…
2 Citations

### A subexponential view of domains in session types

• Computer Science
LSFA
• 2021
The meaning of the subexponentials from the point of view of a session type interpretation is a π -like process calculus where agents reside in locations/sites and they make it explicit how the communication among the different sites should happen.

### A research agenda for formal methods in the Netherlands

• Medicine, Political Science
• 2019
This document bundles visions to create a Dutch formal methods community, to increase awareness of each other’s activities, and to find common grounds for collaborations.

## References

SHOWING 1-10 OF 16 REFERENCES

### Automated Analysis of Security Protocols with Global State

• Computer Science
2014 IEEE Symposium on Security and Privacy
• 2014
A process calculus which is a variant of the applied pi calculus with constructs for manipulation of a global state by processes running in parallel is proposed and it is shown that this language can be translated to MSR rules whilst preserving all security properties expressible in a dedicated first-order logic for security properties.

### Modeling and Verifying Security Protocols with the Applied Pi Calculus and ProVerif

• B. Blanchet
• Computer Science, Mathematics
Found. Trends Priv. Secur.
• 2016
This survey presents an overview of the research on ProVerif, an automatic symbolic protocol verifier that automatically translates this protocol description into Horn clauses and determines whether the desired security properties hold by resolution on these clauses.

### Mobile values, new names, and secure communication

• Computer Science
POPL '01
• 2001
A simple, general extension of the pi calculus with value passing, primitive functions, and equations among terms is introduced, and semantics and proof techniques for this extended language are developed and applied in reasoning about some security protocols.

### Secure Implementations for Typed Session Abstractions

• Computer Science
20th IEEE Computer Security Foundations Symposium (CSF'07)
• 2007
This work extends the ML language with session types that express flows of messages between roles, such that well-typed programs always play their roles, and compiles session type declarations to cryptographic communication protocols that can shield programs from any low-level attempt by coalitions of remote peers to deviate from their roles.

### Formal Models and Techniques for Analyzing Security Protocols: A Tutorial

• Computer Science
Found. Trends Program. Lang.
• 2014
This book contains an introduction and ten tutorial-like chapters on selected topics, each written by a leading expert, and will be of interest to all those involved in the formal analysis of security protocols.

### Combining behavioural types with security analysis

• Computer Science
J. Log. Algebraic Methods Program.
• 2015

### Proof-Carrying Code in a Session-Typed Process Calculus

• Computer Science
CPP
• 2011
Two modal operators are introduced into the type theory to provide detailed control about how much information is communicated: one based on traditional proof irrelevance and one integrating digital signatures.

### Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR

• G. Lowe
• Computer Science, Mathematics
Softw. Concepts Tools
• 1996
This paper uses FDR, a refinement checker for CSP to discover an attack upon the Needham-Schroeder Public-Key Protocol, which allows an intruder to impersonate another agent, and adapt the protocol, and uses FDR to show that the new protocol is secure, at least for a small system.

### Multiparty Asynchronous Session Types

• Computer Science
POPL
• 2008
The theory introduces a new notion of types in which interactions involving multiple peers are directly abstracted as a global scenario, and the fundamental properties of the session type discipline, such as communication safety, progress, and session fidelity, are established.