Abstract
K-induction and predicate abstraction are well known techniques for unbounded software model checking. However, these methods are always treated as completely different in previous works. In the paper, we develop a combined method that merges k-induction and predicate abstraction into a CEGAR-based general abstraction method, which divides the target program into blocks that can be explored separately and extends k-induction in an abstract domain. Experiment results show that the combined method balances effectiveness and efficiency on k-induction and predicate abstraction implementations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
