We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
We present a module calculus for studying a simple model of link-time compilation. The calculus is stratified into a term calculus, a core module calculus, and a linking calculus. ...
Abstract. The basic idea behind improving the quality of a monovariant control flow analysis such as 0CFA is the concept of polyvariant analyses such as Agesen's Cartesian Pro...
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
We study contention-resolution protocols for multiple-access channels. We show that every backoff protocol is transient if the arrival rate, , is at least 0.42 and that the capaci...
Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, ...