Learn More
— Peer-to-peer (P2P) applications such as BitTorrent ignore traffic costs at ISPs and generate a large amount of cross-ISP traffic. As a result, ISPs often throttle BitTorrent traffic as a way to control the cost. In this paper, we examine a new approach to enhance BitTorrent traffic locality, biased neighbor selection, in which a peer chooses the majority,(More)
In this paper we present our results and experiences of using symbolic model checking to study the specification of an aircraft collision avoidance system. Symbolic model checking has been highly successful when applied to hardware systems. We are interested in the question of whether or not model checking techniques can be applied to large software(More)
BACKGROUND Teenage male drivers contribute to a large number of serious road crashes despite low rates of driving and excellent physical health. We examined the amount of road trauma involving teenage male youth that might be explained by prior disruptive behavior disorders (attention deficit hyperactivity disorder, conduct disorder, oppositional defiant(More)
ÐSymbolic model checking based on binary decision diagrams is a powerful formal verification technique for reactive systems. In this paper, we present various optimizations for improving the time and space efficiency of symbolic model checking for systems specified as statecharts. We used these techniques in our analyses of the models of a collision(More)
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We used these techniques in our analysis of the system requirements specification of TCAS II, a complex aircraft collision avoidance system. They together reduce the time and space(More)
The precursor formamide 1 was employed instead of the monomer 2 because isocyanides are relatively unstable in air at room temperature. [19] a) [20] Molecular modeling shows that (in common with the phenyl benzo-ate compounds previously described [17]) an angle exists between the planar phenoxy and TTF ring systems. [21] The oxidation of the polymer was(More)
We extend the conventional BDD-based model checking algorithms to verify systems with non-linear arithmetic constraints. We represent each constraint as a BDD variable, using the information from a constraint solver to prune the BDDs by removing paths that correspond to infeasible constraints. We illustrate our technique with a simple example, which has(More)
Symbolic model checking is a powerful formal-verification technique for reactive systems. In this paper we address the problem of symbolic model checking for software specifications written as statecharts. We concentrate on how the synchronization of statecharts relates to the efficiency of model checking. We show that statecharts synchronized in an(More)