A variety of real-world applications requires a meaningful online analysis of transient data streams. An important building block of many analysis tasks is the characterization of...
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
Large-scale information processing environments must rapidly search through massive streams of raw data to locate useful information. These data streams contain textual and numeri...
Ian Gorton, Justin Almquist, Nick Cramer, Jereme H...
Abstract Current, data-driven applications have become more dynamic in nature, with the need to respond to events generated from distributed sources or to react to information extr...