Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Proof-Carrying Code in a Session-Typed Process Calculus
 

Summary: Proof-Carrying Code in a
Session-Typed Process Calculus
Luis Caires2
, Frank Pfenning1
, and Bernardo Toninho1,2
1
Computer Science Department,
Carnegie Mellon University,
Pittsburgh, PA, USA
2
Faculdade de Ciencias e Tecnologia,
Universidade Nova de Lisboa,
Lisboa, Portugal
Abstract. Dependent session types allow us to describe not only prop-
erties of the I/O behavior of processes but also of the exchanged data.
In this paper we show how to exploit dependent session types to express
proof-carrying communication. We further introduce two modal opera-
tors 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.

  

Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University
Pfenning, Frank - School of Computer Science, Carnegie Mellon University

 

Collections: Computer Technologies and Information Sciences; Mathematics