Eager Abstraction for Symbolic Model Checking
Kenneth L. McMillan · Lecture notes in computer science · 2018
We introduce a method of abstraction from infinite-state to finite-state model checking based on eager theory explication and evaluate the method in a collection of case studies. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.