This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk denes the union of the languages den...
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gu...
Embedded systems serve an emerging and diverse set of applications. As a result, more computational and storage capabilities are added to accommodate ever more demanding applicati...
Prior research in software environments focused on three important problems-- tool integration, artifact management, and process guidance. The context for that research, and hence...
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...