Modal Proofs as Distributed Programs

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We develop a new foundation for distributed programming languages by defining an intuitionistic, modal logic and then interpreting the modal proofs as distributed programs. More specifically, the proof terms for the various modalities have computational interpretations as remote procedure calls, commands to broadcast computations to all nodes in the network, commands to use portable code, and finally, commands to invoke computational agents that can find their own way to safe places in the network where they can execute. We prove some simple meta-theoretic results about our logic as well as a safety theorem that demonstrates that the deductive rules act as a sound type system for a distributed programming language.

This research was supported in part by NSF Career Award CCR-0238328, NSF Trusted Computing Grant CCR-0208601 and DARPA award F30602-99-1-0519.