Automata-based symbolic string analysis for vulnerability detection-Reference-Cited by-同舟云学术

Automata-based symbolic string analysis for vulnerability detection

Published:2013-09-05 Issue:1 Volume:44 Page:44-70
ISSN:0925-9856
Container-title:Formal Methods in System Design
language:en
Short-container-title:Form Methods Syst Des

Author:

Yu Fang,Alkhalaf Muath,Bultan Tevfik,Ibarra Oscar H.

Publisher

Springer Science and Business Media LLC

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s10703-013-0189-1.pdf

Reference44 articles.

1. Alkhalaf M, Bultan T, Gallegos JL (2012) Verifying client-side input validation functions using string analysis. In: ICSE, pp 947–957

2. Balzarotti D, Cova M, Felmetsger V, Jovanovic N, Kruegel C, Kirda E, Vigna G (2008) Saner: composing static and dynamic analysis to validate sanitization in web applications. In: S&P, pp 387–401

3. Bartzis C, Bultan T (2003) Efficient symbolic representations for arithmetic constraints in verification. Int J Found Comput Sci 14(4):605–624

4. Bartzis C, Bultan T (2004) Widening arithmetic automata. In: CAV, pp 321–333

5. Biehl M, Klarlund N, Rauhe T (1997) Algorithms for guided tree automata. In: WIA, pp 6–25

Cited by 53 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. RecurScan: Detecting Recurring Vulnerabilities in PHP Web Applications;Proceedings of the ACM Web Conference 2024;2024-05-13

2. Tarsis: An effective automata‐based abstract domain for string analysis;Journal of Software: Evolution and Process;2024-02-14

3. Solving String Constraints with Lengths by Stabilization;Proceedings of the ACM on Programming Languages;2023-10-16

4. A symbolic algorithm for the case-split rule in solving word constraints with extensions;Journal of Systems and Software;2023-07

5. Word Equations in Synergy with Regular Constraints;Formal Methods;2023