Proof-Carrying code in a session-typed process calculus

Authors:
Frank Pfenning;Luis Caires;Bernardo Toninho
Affiliations:
Computer Science Department, Carnegie Mellon University, Pittsburgh, PA;Faculdade de Ciencias e Tecnologia, Universidade Nova de Lisboa, Lisboa, Portugal;Computer Science Department, Carnegie Mellon University, Pittsburgh, PA
Venue:
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Year:
2011

Citing 17
Cited 5

Safe kernel extensions without run-time checking

OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Language Primitives and Type Discipline for Structured Communication-Based Programming

ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Types for Dynamic Interaction

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Intensionality, Extensionality, and Proof Irrelevance in Modal Type Theory

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Correspondence assertions for process synchronization in concurrent communications

Journal of Functional Programming
Propositions as [Types]

Journal of Logic and Computation
Refinement Types for Secure Implementations

CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
Distributed programming with distributed authorization

Proceedings of the 5th ACM SIGPLAN workshop on Types in language design and implementation
A Proof-Carrying File System

SP '10 Proceedings of the 2010 IEEE Symposium on Security and Privacy
Lolliproc: to concurrency from classical linear logic via curry-howard and control

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Sessions and session types: an overview

WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
Session types as intuitionistic linear propositions

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Dependent session types via intuitionistic linear type theory

Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Secure distributed programming with value-dependent types

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
A linear logic of authorization and knowledge

ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Enforcing stateful authorization and information flow policies in fine

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems

Towards concurrent type theory

TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation
Linear logical relations for session-based concurrency

ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Propositions as sessions

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Heap slicing using type systems

ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
Behavioral polymorphism and parametricity in session-based communication

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dependent session types allow us to describe not only properties 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 operators 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.