Date of Award
4-19-2013
Document Type
Thesis campus only
Abstract
Model checking can be applied to software systems to check the reachability of a particular state. As model checking suffers from the state explosion problem, abstract models of software systems must be formed to make model checkers able to overcome this limitation. We have developed J2, a tool that incorporates some refined techniques to construct a predicate abstraction of sequential programs written in Java, i.e. boolean programs. We also demonstrate the use of a model checker named BEBOP developed by Microsoft Research to model check those programs.
Recommended Citation
Duong, Hai Viet, "Semi-automatic Predicate Abstraction of Sequential Programs" (2013). Computer Science Honors Theses. 31.
https://digitalcommons.trinity.edu/compsci_honors/31
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.