Abstract. We present the type rules for a dependently typed core calculus together with a straightforward implementation in Haskell. We explicitly highlight the changes necessary t...
Abstract. The complete specification of full contracts -- contracts which include tolerated exceptions, and which enable reasoning about the contracts themselves, can be achieved u...
Abstract. We propose a probabilistic interpretation of a class of reversible communicating processes. The rate of forward and backward computing steps, instead of being given expli...
One of the challenging problems for software developers is guaranteeing that a system as built is consistent with its architectural design. In this paper we describe a technique t...
Hong Yan, David Garlan, Bradley R. Schmerl, Jonath...
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...