Abstraction And Assume Guarantee Reasoning For Automated Software Verification
Download Abstraction And Assume Guarantee Reasoning For Automated Software Verification PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Abstraction And Assume Guarantee Reasoning For Automated Software Verification book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Abstraction and Assume-Guarantee Reasoning for Automated Software Verification
Author: National Aeronautics and Space Administration (NASA)
language: en
Publisher: Createspace Independent Publishing Platform
Release Date: 2018-06-24
Compositional verification and abstraction are the key techniques to address the state explosion problem associated with model checking of concurrent software. A promising compositional approach is to prove properties of a system by checking properties of its components in an assume-guarantee style. This article proposes a framework for performing abstraction and assume-guarantee reasoning of concurrent C code in an incremental and fully automated fashion. The framework uses predicate abstraction to extract and refine finite state models of software and it uses an automata learning algorithm to incrementally construct assumptions for the compositional verification of the abstract models. The framework can be instantiated with different assume-guarantee rules. We have implemented our approach in the COMFORT reasoning framework and we show how COMFORT out-performs several previous software model checking approaches when checking safety properties of non-trivial concurrent programs. Chaki, S. and Clarke, E. and Giannakopoulou, D. and Pasareanu, C. S. Ames Research Center TR-05.02
Abstraction and Assume-Guarantee Reasoning for Automated Software Verification
Compositional verification and abstraction are the key techniques to address the state explosion problem associated with model checking of concurrent software. A promising compositional approach is to prove properties of a system by checking properties of its components in an assume-guarantee style. This article proposes a framework for performing abstraction and assume-guarantee reasoning of concurrent C code in an incremental and fully automated fashion. The framework uses predicate abstraction to extract and refine finite state models of software and it uses an automata learning algorithm to incrementally construct assumptions for the compositional verification of the abstract models. The framework can be instantiated with different assume-guarantee rules. We have implemented our approach in the COMFORT reasoning framework and we show how COMFORT out-performs several previous software model checking approaches when checking safety properties of non-trivial concurrent programs.
Model Checking Software
Author: Patrick Godefroid
language: en
Publisher: Springer Science & Business Media
Release Date: 2005-08-09
This book constitutes the refereed proceedings of the 12th International SPIN workshop on Model Checking Software, SPIN 2005, held in San Francisco, USA in August 2005. The 15 revised full papers presented were carefully reviewed and selected from 45 submissions; in addition there are 4 tool presentation papers selected from 6 submissions. The papers are organized in topical sections on state representation and abstraction, dealing with concurrency, dealing with complex data, checking temporal properties, and checking security and real-time properties.