Secure communication in distributed systems is notoriously hard to achieve due to the variety of attacks an adversary can mount, based on message interception, modification, redi...
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...
Today’s shared-memory parallel programming models are complex and error-prone. While many parallel programs are intended to be deterministic, unanticipated thread interleavings ...
Robert L. Bocchino Jr., Vikram S. Adve, Danny Dig,...
Abstract. The use of passwords in security protocols is particularly delicate because of the possibility of off-line guessing attacks. We study password-based protocols in the cont...
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...