In this paper we describe a new tool being made available to the networking research community for passive analysis of TCP segment traces. The purpose of the tool is to provide mo...
The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless ...
The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...
Daniel Geist, Mark Ginzburg, Yoad Lustig, Ishai Ra...
New heuristics and strategies have enabled major advancements in SAT solving in recent years. However, experimentation has shown that there is no winning solution that works in al...
Software is typically improved and modified in small increments (we refer to each of these increments as a modification record--MR). MRs are usually stored in a configuration manag...