Authors:
- This is the first existing book focusing on string analysis
- Discusses how string analysis techniques work and how they can be applied to vulnerability detection in modern software applications
- This book can be used as a textbook for a course on string analysis, or as a supplementary book for a course on vulnerability detection
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (12 chapters)
-
Front Matter
-
Back Matter
About this book
This book discusses automated string-analysis techniques, focusing particularly on automata-based static string analysis. It covers the following topics: automata-bases string analysis, computing pre and post-conditions of basic string operations using automata, symbolic representation of automata, forward and backward string analysis using symbolic automata representation, constraint-based string analysis, string constraint solvers, relational string analysis, vulnerability detection using string analysis, string abstractions, differential string analysis, and automated sanitization synthesis using string analysis.
String manipulation is a crucial part of modern software systems; for example, it is used extensively in input validation and sanitization and in dynamic code and query generation. The goal of string-analysis techniques and this book is to determine the set of values that string expressions can take during program execution. String analysis can be used to solve many problems in modern software systems that relate to string manipulation, such as: (1) Identifying security vulnerabilities by checking if a security sensitive function can receive an input string that contains an exploit; (2) Identifying possible behaviors of a program by identifying possible values for dynamically generated code; (3) Identifying html generation errors by computing the html code generated by web applications; (4) Identifying the set of queries that are sent to back-end database by analyzing the code that generates the SQL queries; (5) Patching input validation and sanitization functions by automatically synthesizing repairs illustrated in this book.
Like many other program-analysis problems, it is not possible to solve the string analysis problem precisely (i.e., it is not possible to precisely determine the set of string values that can reach aprogram point). However, one can compute over- or under-approximations of possible string values. If the approximations are precise enough, they can enable developers to demonstrate existence or absence of bugs in string manipulating code. String analysis has been an active research area in the last decade, resulting in a wide variety of string-analysis techniques.
This book will primarily target researchers and professionals working in computer security, software verification, formal methods, software engineering and program analysis. Advanced level students or instructors teaching or studying courses in computer security, software verification or program analysis will find this book useful as a secondary text.
Keywords
- Automated sanitization synthesis
- Automated string analysis
- Computer security
- Input validation and sanitization
- Java
- Modern programming languages
- Modern software systems
- Software verification
- String analysis
- Vulnerability detection
- Program verification
- Formal methods
- Symbolic verification
- Automated abstraction
- Automata-based strong analysis
- String constraints
- Automated code repair
Reviews
Authors and Affiliations
-
Department of Computer Science, University of California, Santa Barbara, Santa Barbara, USA
Tevfik Bultan
-
Department of Management, Information Systems, National Chenchi University, Taipei, Taiwan
Fang Yu
-
Computer Science Department, King Saud University, Riyadh, Saudi Arabia
Muath Alkhalaf
-
Microsoft (United States), Redmond, USA
Abdulbaki Aydin
Bibliographic Information
Book Title: String Analysis for Software Verification and Security
Authors: Tevfik Bultan, Fang Yu, Muath Alkhalaf, Abdulbaki Aydin
DOI: https://doi.org/10.1007/978-3-319-68670-7
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing AG 2017
Hardcover ISBN: 978-3-319-68668-4Published: 30 January 2018
Softcover ISBN: 978-3-319-88637-4Published: 06 June 2019
eBook ISBN: 978-3-319-68670-7Published: 04 January 2018
Edition Number: 1
Number of Pages: IX, 174
Number of Illustrations: 68 b/w illustrations, 6 illustrations in colour
Topics: Systems and Data Security, Programming Languages, Compilers, Interpreters, Software Engineering, Logics and Meanings of Programs, Mathematical Logic and Formal Languages, Symbolic and Algebraic Manipulation