Project: Tarsis
Implementation of the Tarsis abstract domainJava
Tarsis is a new abstract domain for string values based on finite state automata. Standard finite state automata abstract domain has been shown to provide precise abstractions of string values when all the components of such strings are known, but with high computational cost. Instead of considering standard finite automata built over an alphabet of single characters, Tarsis considers automata that are built over an alphabet of strings, comprising a special value to represent statically unknown strings. Tarsis is maintained by the Software and System Verification group @ Ca’ Foscari University of Venice, Italy, and it is available on GitHub.
| Code: | GitHub |
Related publications
- Tarsis: An effective automata-based abstract domain for string analysis
- Twinning Automata and Regular Expressions for String Static Analysis