Titlebook: String Analysis for Software Verification and Security; Tevfik Bultan,Fang Yu,Abdulbaki Aydin Book 2017 Springer International Publishing

海市蜃楼

书目名称String Analysis for Software Verification and Security影响因子(影响力)




书目名称String Analysis for Software Verification and Security影响因子(影响力)学科排名




书目名称String Analysis for Software Verification and Security网络公开度




书目名称String Analysis for Software Verification and Security网络公开度学科排名




书目名称String Analysis for Software Verification and Security被引频次




书目名称String Analysis for Software Verification and Security被引频次学科排名




书目名称String Analysis for Software Verification and Security年度引用




书目名称String Analysis for Software Verification and Security年度引用学科排名




书目名称String Analysis for Software Verification and Security读者反馈




书目名称String Analysis for Software Verification and Security读者反馈学科排名

Inveterate

Increment

State Space Exploration,ration. We discuss both forward and backward reachability analysis using depth-first search where states of a given string manipulating program are traversed one state at a time. Next, we discuss symbolic reachability analysis, where the basic idea is to perform state exploration using sets of state

tolerance

Virtues

Relational String Analysis,ifying properties that depend on relations among string variables. We discuss the basic word equations (over string concatenations) and the corresponding automata constructions. We present a verification technique based on forward symbolic reachability analysis with multi-track automata, conservativ

非秘密

Abstraction and Approximation,nipulate user input, and their erroneous use is the most common cause of security vulnerabilities in web applications. Unfortunately, verifying string manipulating programs is an undecidable problem in general and any approximate string analysis technique has an inherent tension between efficiency a

institute

Constraint-Based String Analysis,applied to string manipulating programs. However, symbolic execution of string manipulating programs is difficult since solving string constraints is a challenging problem. String constraint solving is challenging due to two main reasons: 1) With the increasing usage of strings in modern software de

CARK

夹死提手势

Differential String Analysis and Repair,olicies in characterizing good and bad string values. It is often possible, for instance, to encode well-known attacks into security policies (in the form of attack patterns) and write down policies for common input fields such as email address and zip code. In other cases, however, the checks to be

vector

Tools,ed string analysis library called . [.], a vulnerability analysis tool for PHP programs built on . called . [.], an automated repair tool for string manipulating code called . [.], and an automata-based constraint solver for string constraints called . [.].