Year: 2008
Type: conference-abstract
Abstract: Counterexample-guided abstraction refinement (CEGAR) has proven to be a powerful method for software model checking. In this paper, we investigate this concept in the context of sequential (possibly recursive) programs whose statements are given as B
DOI: 10.3233/sat190051
Authors: Javier Esparza, Stefan Kiefer, Stefan Schwoon
Institution: Technical University of Munich
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2406109166