Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore the first formalization of Symbolic Finite Transducers (SFTs) and their algorithms in Isabelle/HOL through this 25-minute conference presentation from CPP 2026. Learn how SFTs extend Finite Automata capabilities by enabling string transformation while addressing the state-space explosion problem caused by large alphabet sizes like Unicode. Discover how the researchers represent alphabets as effective boolean algebras, including finite unions of intervals and SMT-Algebras, to create more efficient symbolic representations. Examine the security-critical applications of this formalization, including sanitizers for web applications that prevent XSS attacks and string solving systems that employ complex string replacement operations. Understand the theoretical foundations and practical implementations that make these verified systems competitive with existing unverified approaches. Gain insights into how formal verification methods can enhance the trustworthiness of string analysis tools used in program analysis, string constraint solving, and security-critical sanitizer analysis.
