Search
Now showing items 1-10 of 21
Quantitative Information Flow as Network Flow Capacity
(2007-12-10)
We present a new technique for determining how much information abouta program's secret inputs is revealed by its public outputs. Incontrast to previous techniques based on reachability from secretinputs (tainting), it ...
Eclat: Automatic Generation and Classification of Test Inputs
(2004-10-14)
This paper describes a technique that helps a test engineerselect, from a large set of randomly generated testinputs, a small subset likely to reveal faults in the softwareunder test. The technique takes a program or ...
HAMPI: A Solver for String Constraints
(2009-02-04)
Many automatic testing, analysis, and verification techniques for programs can be effectively reduced to a constraint-generation phase followed by a constraint-solving phase. This separation of concerns often leads to more ...
Automatic Creation of SQL Injection and Cross-Site Scripting Attacks
(2008-09-10)
We present a technique for finding security vulnerabilitiesin Web applications. SQL Injection (SQLI) and cross-sitescripting (XSS) attacks are widespread forms of attackin which the attacker crafts the input to the application ...
Quantitative Information-Flow Tracking for C and Related Languages
(2006-11-17)
We present a new approach for tracking programs' use of data througharbitrary calculations, to determine how much information about secretinputs is revealed by public outputs. Using a fine-grained dynamicbit-tracking ...
Selecting Refining and Evaluating Properties for Program Analysis
(2003-07-21)
This research proposes and evaluates techniques for selectingpredicates for conditional program propertiesÂthatis, implications such as p ) q whose consequent must betrue whenever the predicate is true. Conditional ...
Combined static and dynamic mutability analysis
(2006-09-17)
Knowing which method parameters may be mutated during a method'sexecution is useful for many software engineering tasks. We presentan approach to discovering parameter immutability, in which severallightweight, scalable ...
ReCrash: Making Crashes Reproducible
(2007-11-20)
It is difficult to fix a problem without being able to reproduce it.However, reproducing a problem is often difficult and time-consuming.This paper proposes a novel algorithm, ReCrash, that generatesmultiple unit tests ...
Pluggable type-checking for custom type qualifiers in Java
(2007-09-17)
We have created a framework for adding custom type qualifiers to the Javalanguage in a backward-compatible way. The type system designer definesthe qualifiers and creates a compiler plug-in that enforces theirsemantics. ...
Automatic Test Factoring for Java
(2005-06-08)
Test factoring creates fast, focused unit tests from slow system-widetests; each new unit test exercises only a subset of the functionalityexercised by the system test. Augmenting a test suite with factoredunit tests ...