Theoretical Computer Science
Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
Journal of Symbolic Logic
Hi-index | 0.00 |
In this paper we present a technique for specifying and verifying communications protocols and demonstrate this approach by specifying and verifying two of the fundamental communications protocols, namely TCP and IP, which form the basis of many distributed systems. The logical formalism used is Mixed Intuitionistic Linear Logic in order to use both commutative and non-commutative operators to model the concurrent and sequential processes in these protocols. Key properties of both protocols are proved.