Cited in
(20)- An Evaluation of Automata Algorithms for String Analysis
- GR(1)*: GR(1) specifications extended with existential guarantees
- From sequential extended regular expressions to NFA with symbolic labels
- Improving Symbolic Automata Learning with Concolic Execution
- AUTOMATE
- Grail
- MONA
- VATA
- MTBDD
- Symbolic automata
- Phantm
- SFADiff
- SemMT
- SoftRegex
- SemRegex
- A symbolic decision procedure for symbolic alternating finite automata
- scientific article; zbMATH DE number 7453082 (Why is no real title available?)
- Completeness of string analysis for dynamic languages
- Symbolic tree automata
- Symbolic automatic relations and their applications to SMT and CHC solving
This page was built for software: Rex
