Property Dependent Abstraction of Control Structure for Software Verification

Authors:
Thomas Firley;Ursula Goltz
Affiliations:
-;-
Venue:
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Year:
2002

Citing 12
Cited 0

The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Model checking and abstraction

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computer-aided verification of coordinating processes: the automata-theoretic approach

Computer-aided verification of coordinating processes: the automata-theoretic approach
Property preserving abstractions for the verification of concurrent systems

Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Abstract interpretation of reactive systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
Formal verification of FIRE: a case study

DAC '97 Proceedings of the 34th annual Design Automation Conference
Model checking

Model checking
Verification of time partitioning in the DEOS scheduler kernel

Proceedings of the 22nd international conference on Software engineering
Verifying Transaction Ordering Properties in Unbounded Bus Networks through Combined Deductive/Algorithmic Methods

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives

SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Model Checking with Formula-Dependent Abstract Models

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
An Iterative Approach to Language Containment

CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a technique to compute abstract models for formal system verification.The method reduces the state space by eliminating those parts of a system model which are not required to check a property. The abstract model depends on the property, which is a formula of the next-less fragment of CTL*. The algorithm reads a system description, annotates it with abstract sub-models for the statements, which are finally composed as abstract model for the system.In the paper we introduce the core algorithm and illustrate it by an example.