Help Privacy Policy Disclaimer
  Advanced SearchBrowse





A Model Checker based on Abstraction Refinement


Rybalchenko,  Andrey
Programming Logics, MPI for Informatics, Max Planck Society;
International Max Planck Research School, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Rybalchenko, A. (2002). A Model Checker based on Abstraction Refinement. Master Thesis, Universität des Saarlandes, Saarbrücken.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2EF1-F
Abstraction plays an important role for verification of computer programs. We want to construct the right abstraction automatically. There is a promising approach to do it, called {\it predicate abstraction}. An insufficiently precise abstraction can be {\it automatically refined}. There is an automated model checking method described in [Ball, Podelski, Rajamani TACAS02] which combines both techniques, e.g., predicate abstraction and abstraction refinement. The quality of the method is expressed by a completeness property relative to a powerful but unrealistic oracle-guided algorithm. \par In this work we want to generalize the results from [Ball,Podelski,Rajamani TACAS02] and introduce new abstraction functions with different precision. We implement the new abstraction functions in a model checker and practically evaluate their effectiveness in verifying various computer programs.