Learn More
We describe an ongoing project, the deployment of a modular checker to statically find and prevent every buffer overflow in future versions of a Microsoft product. Lightweight annotations specify requirements for safely using each buffer, and functions are checked individually to ensure they obey these requirements and do not overflow. Our focus is on the(More)
In this paper, we describe PSE (Postmortem Symbolic Evaluation), a static analysis algorithm that can be used by programmers to diagnose software failures. The algorithm requires minimal information about a failure, namely its kind (e.g. NULL dereference), and its location in the program's source code. It produces a set of execution traces along which the(More)
In this paper, we present a new algorithm for tracking the flow of values through a program. Our algorithm represents a substantial improvement over the state of the art. Previously described value flow analyses that are control-flow sensitive do not scale well, nor do they eliminate value flow information from infeasible execution paths (<i>i.e.</i>, they(More)
Multicast over MPLS networks can merge the their advantages, but is still accompanied many problems mainly on scalability. In this paper, we propose an architecture for deploying bidirectional multicast shared trees in MPLS networks (BIDIR-MMST). Tree manager server (TMS) collects the positions of all multicast group members and computes the topology of(More)
  • 1