MetaPRL is the latest system to come out of over twenty five years of research by the Cornell PRL group. While initially created at Cornell, MetaPRL is currently a collaborative p...
Jason Hickey, Aleksey Nogin, Robert L. Constable, ...
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Abstract. A new approach to the design of massively parallel and interactive programming languages has been recently proposed using rv-systems (interactive systems with registers a...
Alexandru Sofronia, Alexandru Popa, Gheorghe Stefa...
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...
Richard Cleve, William Slofstra, Falk Unger, Sarva...
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...