Applications of symbolic finite automata

摘要: Symbolic automata theory lifts classical to rich alphabet theories. It does so by replacing an explicit with described implicitly a Boolean algebra. How this lifting affect the basic algorithms that lay foundation for modern and what is incentive doing this? We investigate these questions here. In our approach we use state-of-the-art constraint solving techniques analysis are both expressive efficient, even very large infinite alphabets. show how symbolic finite enable applications ranging from regex advanced web security analysis, were out of reach prior methods.