Combining static analysis and model checking for systems employing commutative functions

Authors:
A. Prasad Sistla;Min Zhou
Affiliations:
University of Illinois at Chicago;University of Illinois at Chicago
Venue:
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Year:
2005

Citing 7
Cited 0

Introduction to algorithms

Introduction to algorithms
The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Online minimization of transition systems (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Principles of Program Analysis

Principles of Program Analysis
Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Syntactic Program Transformations for Automatic Abstraction

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Model checking of systems employing commutative functions

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The two main hindrances for a wider application of the model checking approach for verification of concurrent and distributed systems are the state explosion problem and its limitation in handling infinite state systems. We consider a class of infinite state systems given by certain types of Transition Diagrams (TDs), called simple TDs, that employ commutative functions for updating variables. For such systems, we presented model checking methods that combine bi-simulation reductions with static analysis. The new methods are extensions of earlier methods where static analysis was not employed. These methods can be applied to a wider class of systems.