PELÁNEK, Radek, Corina PASAREANU and Willem VISSER. Predicate Abstraction with Under-Approximation Refinement. Logical Methods in Computer Science. Germany: Technical University of Braunschweig, vol. 3, No 1, p. 1-22. ISSN 1860-5974. 2007.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Predicate Abstraction with Under-Approximation Refinement
Name in Czech Predikátová abstrakce a zjemňování dolních aproximací
Authors PELÁNEK, Radek (203 Czech Republic, guarantor), Corina PASAREANU (642 Romania) and Willem VISSER (710 South Africa).
Edition Logical Methods in Computer Science, Germany, Technical University of Braunschweig, 2007, 1860-5974.
Other information
Original language English
Type of outcome Article in a journal
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
WWW LMCS journal web-page.
RIV identification code RIV/00216224:14330/07:00020179
Organization unit Faculty of Informatics
UT WoS 000262497000006
Keywords in English model checking; predicate abstraction; under-approximation
Tags Model checking, predicate abstraction, under-approximation
Tags International impact, Reviewed
Changed by Changed by: doc. Mgr. Radek Pelánek, Ph.D., učo 4297. Changed: 23/6/2009 12:50.
Abstract
We propose an abstraction-based model checking method which relies on refinement of an under-approximation of the feasible behaviors of the system under analysis. The method preserves errors to safety properties, since all analyzed behaviors are feasible by definition. The method does not require an abstract transition relation to be generated, but instead executes the concrete transitions while storing abstract versions of the concrete states, as specified by a set of abstraction predicates. For each explored transition the method checks, with the help of a theorem prover, whether there is any loss of precision introduced by abstraction. The results of these checks are used to decide termination or to refine the abstraction by generating new abstraction predicates. If the (possibly infinite) concrete system under analysis has a finite bisimulation quotient, then the method is guaranteed to eventually explore an equivalent finite bisimilar structure. We illustrate the application of the approach for checking concurrent programs.
Abstract (in Czech)
Navrhujeme metodu ověřování modelů založenou na abstrakci a zjemňování dolních aproximací. Metoda nevyžaduje generování abstraktních přechodů, místo toho prochází konkrétní přechody a pouze si ukládá abstraktní verze stavů specifikované abstrakčními predikáty. S využitím nástroje pro dokazování vět se automaticky kontroluje, zda při průchodu statového prostoru dochází ke ztrátě přesnosti. Aplikace metody je ilustrována na verifikaci souběžných programů.
Links
GP201/07/P035, research and development projectName: Automatická analýza modelů pomocí procházení stavového prostoru
Investor: Czech Science Foundation, Automatic model analysis by state space exploration
1M0545, research and development projectName: Institut Teoretické Informatiky
Investor: Ministry of Education, Youth and Sports of the CR, Institute for Theoretical Computer Science
PrintDisplayed: 16/4/2024 10:48