— By analyzing people’s contact patterns over time, it is possible to build efficient delay tolerant networking (DTN) algorithms and derive important data for parameterizing an...
Mohammad S. Hashemian, Kevin G. Stanley, Nathaniel...
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
We consider the problem of broadcasting a large message in a large scale distributed platform. The message must be sent from a source node, with the help of the receiving peers whi...
A particularly insidious type of concurrency bug is atomicity violations. While there has been substantial work on automatic detection of atomicity violations, each existing techn...
Abdullah Muzahid, Norimasa Otsuki, Josep Torrellas
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
Saurabh K. Tiwary, Anubhav Gupta, Joel R. Phillips...