perhaps a few other programming-related disciplines contributes techniques and ideas that improve the quality of software. The quality has two faces. A program is good if it does what the programmers intended. A program is really good if it does what its users want. The problem of making programmers ’ intentions agree with the users ’ requirements will be neatly covered under the rug in what follows. Rest assured, there are many qualified people working on it. So let us shift the focus towards making programs agree with programmers. For sure, no programmer wants their editor to change the selected region after a search and replace operation, or to suddenly display a blue screen and stop react to user input. These disagreements between the program and the programmer are commonly called bugs. An empirical study [CAHM04] of active open source projects revealed that the average number of bugs per project is 509 and the median is 279. Moreover, projects with many downloads tend to also have many developers, many bug reports, and low bug-fixing time. It is not clear how these numbers should be

A modular static program checker relies on annotations specifying module interfaces. Writing annotations is a burden to the programmer. The Houdini algorithm is a whole-program analysis that reduces this burden by inferring many annotations automatically. The basic

Abstract—This paper describes our experience of performing reactive security audit of known security vulnerabilities in core op-erating system and browser COM components, using an extended static checker HAVOC-LITE. We describe the extensions made to the tool to be applicable on such large C

Software development and maintenance are costly endeavors. The cost can be reduced if more software defects are detected earlier in the development cycle. This paper introduces the Extended Static Checker for Java (ESC/Java), an experimental compile-time program checker that finds common

This paper provides a detailed description of the automatic theorem prover Simplify, which is the proof engine of the Extended Static Checkers ESC/Java and ESC/Modula-3. Simplify uses the Nelson-Oppen method to combine decision procedures for several important theories, and also employs a matcher

Abstract. The goal of the SLAM project is to check whether or not a program obeys "API usage rules " that specif[y what it means to be a good client of an API. The SLAM toolkit statically analyzes a C program to determine whether or not it violates given usage rules. The toolkit has two

simultaneous alternative hypotheses. Extensions to the Kalman filter to handle multiple data associations work satisfactorily in the simple case of point targets, but do not extend naturally to continuous curves. A new, stochastic algorithm is proposed here, the Condensation algorithm --- Conditional

with the rate of a distributed antenna array with full cooperation even though the transmitting antennas are not colocated. The capacity results generalize broadly, including to multiantenna transmission with Rayleigh fading, single-bounce fading, certain quasi-static fading problems, cases where partial

for testing, extending, and improving conventional demand analysis. This does not imply that the system, particularly in its simple static form, is to be regarded as a fully satisfactory explanation of consumers' behavior. Indeed, by proposing a demand system which is superior to its predecessors, we

receiver specifies its level of subscription by joining a subset of the groups. In this paper, we extend the multiple group framework with a rate-adaptation protocol called Receiver-driven Layered Multicast, or RLM. Under RLM, multicast receivers adapt to both the static heterogeneity of link bandwidths