Abstract: In this talk, I will describe concolic testing, also known as directed automated random testing (DART) or dynamic symbolic execution, an efficient way to automatically and systematically generate test inputs for prog
Abstract: Extensionality axioms are common when reasoning about data collections, such as arrays and functions in program analysis, or sets in mathematics.
Abstract: The Graph Coloring problem is to efficiently color the vertices of a graph on n vertices using as few colors as possible such that no edge is monochromatic.
Abstract: Long chain refers to a directed bi-partite network with directed edges from supply nodes (with fixed unit supply) to demand nodes (with random demand) that form a hamiltonian cycle.
Abstract: We will explore thermodynamics in the setting of finite-space Markov chains. Such models are interesting in three ways. From a practical point of view, they correspond to "coarse-graining" of real physical models.
Abstract: We tackle one of the most fascinating problems in reaction network theory: the Global Attractor Conjecture, which has been an open question for four decades now. In this paper, we do not quite prove the conjecture, but we prove a signifi
Abstract: A transmitter Alice may wish to reliably transmit a message to a receiver Bob over a binary symmetric channel (BSC), while simultaneously ensuring that her transmission is deniable from an eavesdropper Willie.
Abstract: For more than 3 decades now, it is well understood that several desirable security properties of systems can be cast in terms of information flows.
