Checking regular inclusion using a procedure inspired by IC3 (Master's Thesis)

Many formal verification problems can be translated into a regular language inclusion problem. One way to approach the regular language inclusion problem arises from the adaptation of a procedure for the verification of finite state systems called IC3. The master thesis discusses this adaptation and the performance achieved by it.