Title: Formula-based abstractions and symbolic execution for model checking programs
Abstract: We define a model checking technique that applies to a finite state representation of sequential programs. This representation is built by means of an abstraction method which cuts the state explosion by introducing a special symbol, ⊥, to model ‘unknown’ variable values. Program properties are expressed by means of a temporal logic, which allow a further abstraction on the basis of the structure of the formulae. The satisfaction of the formulae is checked through a sort of symbolic execution of the programs which may produce a number of false results depending on the number of ⊥ values associated to the variables. Each abstraction produces a different level of incompleteness of the verification result.
Publication Year: 2004
Publication Date: 2004-03-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 5
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot