Abstract. We present a tool developed for fostering probabilistic model checking of services formally specified in Scows, a stochastic enrichment of the Calculus for Orchestration ...
Dynamic composition of protocol features allows applications to establish connections with custom communication characteristics. Automatically computing possible compositions and ...
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Reversible structures are computational units that may progress forward and backward. We study weak coherent structures that are primarily inspired by dna circuits and may be comp...
Our goal is to help automate the capture and broadcast of lectures to remote audiences. There are two inter-related components to the design of such systems. The technology compon...