Refining Model Checking by Abstract Interpretation

Patrick Cousot, Radhia Cousot

Research output: Contribution to journalArticle

Abstract

Formal methods combining abstract interpretation and model-checking have been considered for automated analysis of software. In abstract model-checking, the semantics of an infinite transition system is abstracted to get a finite approximation on which temporal-logic/μ-calculus model-checking can be directly applied. The paper proposes two improvements of abstract model-checking which can be applied to infinite abstract transition systems: - A new combination of forwards and backwards abstract fixed-point model-checking computations for universal safety. It computes a more precise result than that computed by conjunction of the forward and backward analyses alone, without needing to refine the abstraction; - When abstraction is unsound (as can happen in minimum/maximum path-length problems), it is proposed to use the partial results of a classical combination of forward and backward abstract interpretation analyses for universal safety in order to reduce, on-the-fly, the concrete state space to be searched by model-checking.

Original languageEnglish (US)
Pages (from-to)69-95
Number of pages27
JournalAutomated Software Engineering
Volume6
Issue number1
StatePublished - 1999

Fingerprint

Model checking
Refining
Temporal logic
Formal methods
Semantics
Concretes

Keywords

  • Abstract interpretation
  • Model-checking
  • Static analysis
  • Transition system
  • Universal safety

ASJC Scopus subject areas

  • Software

Cite this

Refining Model Checking by Abstract Interpretation. / Cousot, Patrick; Cousot, Radhia.

In: Automated Software Engineering, Vol. 6, No. 1, 1999, p. 69-95.

Research output: Contribution to journalArticle

@article{fb152367e8664aeb9ba5bd13cd8fc0ff,
title = "Refining Model Checking by Abstract Interpretation",
abstract = "Formal methods combining abstract interpretation and model-checking have been considered for automated analysis of software. In abstract model-checking, the semantics of an infinite transition system is abstracted to get a finite approximation on which temporal-logic/μ-calculus model-checking can be directly applied. The paper proposes two improvements of abstract model-checking which can be applied to infinite abstract transition systems: - A new combination of forwards and backwards abstract fixed-point model-checking computations for universal safety. It computes a more precise result than that computed by conjunction of the forward and backward analyses alone, without needing to refine the abstraction; - When abstraction is unsound (as can happen in minimum/maximum path-length problems), it is proposed to use the partial results of a classical combination of forward and backward abstract interpretation analyses for universal safety in order to reduce, on-the-fly, the concrete state space to be searched by model-checking.",
keywords = "Abstract interpretation, Model-checking, Static analysis, Transition system, Universal safety",
author = "Patrick Cousot and Radhia Cousot",
year = "1999",
language = "English (US)",
volume = "6",
pages = "69--95",
journal = "Automated Software Engineering",
issn = "0928-8910",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - Refining Model Checking by Abstract Interpretation

AU - Cousot, Patrick

AU - Cousot, Radhia

PY - 1999

Y1 - 1999

N2 - Formal methods combining abstract interpretation and model-checking have been considered for automated analysis of software. In abstract model-checking, the semantics of an infinite transition system is abstracted to get a finite approximation on which temporal-logic/μ-calculus model-checking can be directly applied. The paper proposes two improvements of abstract model-checking which can be applied to infinite abstract transition systems: - A new combination of forwards and backwards abstract fixed-point model-checking computations for universal safety. It computes a more precise result than that computed by conjunction of the forward and backward analyses alone, without needing to refine the abstraction; - When abstraction is unsound (as can happen in minimum/maximum path-length problems), it is proposed to use the partial results of a classical combination of forward and backward abstract interpretation analyses for universal safety in order to reduce, on-the-fly, the concrete state space to be searched by model-checking.

AB - Formal methods combining abstract interpretation and model-checking have been considered for automated analysis of software. In abstract model-checking, the semantics of an infinite transition system is abstracted to get a finite approximation on which temporal-logic/μ-calculus model-checking can be directly applied. The paper proposes two improvements of abstract model-checking which can be applied to infinite abstract transition systems: - A new combination of forwards and backwards abstract fixed-point model-checking computations for universal safety. It computes a more precise result than that computed by conjunction of the forward and backward analyses alone, without needing to refine the abstraction; - When abstraction is unsound (as can happen in minimum/maximum path-length problems), it is proposed to use the partial results of a classical combination of forward and backward abstract interpretation analyses for universal safety in order to reduce, on-the-fly, the concrete state space to be searched by model-checking.

KW - Abstract interpretation

KW - Model-checking

KW - Static analysis

KW - Transition system

KW - Universal safety

UR - http://www.scopus.com/inward/record.url?scp=0032672388&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032672388&partnerID=8YFLogxK

M3 - Article

VL - 6

SP - 69

EP - 95

JO - Automated Software Engineering

JF - Automated Software Engineering

SN - 0928-8910

IS - 1

ER -