On the Computational Complexity of Satisfiability Solving for String Theories

Details On the Computational Complexity of Satisfiability Solving for String Theories On the Computational Complexity of Satisfiability Solving for String Theories

2009-03-16

arxiv.org/abs/0903.2825v1

Computer Science

Computational Complexity

Scientific paper

Satisfiability solvers are increasingly playing a key role in software verification, with particularly effective use in the analysis of security vulnerabilities. String processing is a key part of many software applications, such as browsers and web servers. These applications are susceptible to attacks through malicious data received over network. Automated tools for analyzing the security of such applications, thus need to reason about strings. For efficiency reasons, it is desirable to have a solver that treats strings as first-class types. In this paper, we present some theories of strings that are useful in a software security context and analyze the computational complexity of the presented theories. We use this complexity analysis to motivate a byte-blast approach which employs a Boolean encoding of the string constraints to a corresponding Boolean satisfiability problem.

Affiliated with

Also associated with

No associations

Rating

On the Computational Complexity of Satisfiability Solving for String Theories does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Computational Complexity of Satisfiability Solving for String Theories, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Computational Complexity of Satisfiability Solving for String Theories will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-224275