PLSE Seminar Series - The Power of Symbolic Automata

This course aims to introduce learners to Symbolic Automata, a model that extends finite automata to operate over infinite alphabets, such as the set of rational numbers. The course covers the use of Symbolic Automata in verifying functional programs, proving correctness of implementations, and supporting constraints over sequences. Learners will gain knowledge about the general features of Symbolic Automata and novel decision procedures for checking equivalence and minimizing symbolic automata. The teaching method involves a seminar-style presentation by an Assistant Professor focusing on formal methods and programming languages. This course is intended for individuals interested in formal methods, programming languages, and automata theory.