Symbolic PathFinder: integrating symbolic execution with model checking for Java bytecode analysis
Symbolic PathFinder (SPF) is a software analysis tool that combines symbolic execution with
model checking for automated test case generation and error detection in Java bytecode …
model checking for automated test case generation and error detection in Java bytecode …
Automated energy optimization of http requests for mobile applications
Energy is a critical resource for apps that run on mobile devices. Among all operations,
making HTTP requests is one of the most energy consuming. Previous studies have shown …
making HTTP requests is one of the most energy consuming. Previous studies have shown …
Making web applications more energy efficient for OLED smartphones
A smartphone's display is one of its most energy consuming components. Modern
smartphones use OLED displays that consume more energy when displaying light colors as …
smartphones use OLED displays that consume more energy when displaying light colors as …
Rex: Symbolic regular expression explorer
M Veanes, P De Halleux… - 2010 Third International …, 2010 - ieeexplore.ieee.org
Constraints in form regular expressions over strings are ubiquitous. They occur often in
programming languages like Perl and C#, in SQL in form of LIKE expressions, and in web …
programming languages like Perl and C#, in SQL in form of LIKE expressions, and in web …
Stranger: An Automata-Based String Analysis Tool for PHP
Stranger is an automata-based string analysis tool for finding and eliminating string-related
security vulnerabilities in PHP applications. Stranger uses symbolic forward and backward …
security vulnerabilities in PHP applications. Stranger uses symbolic forward and backward …
An automata-based framework for verification and bug hunting in quantum circuits
We introduce a new paradigm for analysing and finding bugs in quantum circuits. In our
approach, the problem is given by a triple {P} C {Q} and the question is whether, given a set …
approach, the problem is given by a triple {P} C {Q} and the question is whether, given a set …
Automata-based model counting for string constraints
Most common vulnerabilities in Web applications are due to string manipulation errors in
input validation and sanitization code. String constraint solvers are essential components of …
input validation and sanitization code. String constraint solvers are essential components of …
String analysis for side channels with segmented oracles
We present an automated approach for detecting and quantifying side channels in Java
programs, which uses symbolic execution, string analysis and model counting to compute …
programs, which uses symbolic execution, string analysis and model counting to compute …
Automata-based symbolic string analysis for vulnerability detection
Verifying string manipulating programs is a crucial problem in computer security. String
operations are used extensively within web applications to manipulate user input, and their …
operations are used extensively within web applications to manipulate user input, and their …
Path-and index-sensitive string analysis based on monadic second-order logic
We propose a novel technique for statically verifying the strings generated by a program.
The verification is conducted by encoding the program in Monadic Second-order Logic …
The verification is conducted by encoding the program in Monadic Second-order Logic …