A Persistent-Set Approach to Abstract Stat-Space Construction in Verification

Authors:
Ulrich Ultes-Nitsche
Affiliations:
-
Venue:
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Year:
1999

Citing 9
Cited 0

Sooner is safer than later

Information Processing Letters
Model checking and abstraction

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Using partial orders for the efficient verification of deadlock freedom and safety properties

Formal Methods in System Design - Special issue on computer-aided verification: special methods II
Approximately satisfied properties of systems and simple language homomorphisms

Information Processing Letters
Relative liveness and behavior abstraction (extended abstract)

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Automata, Languages, and Machines

Automata, Languages, and Machines
The Book of Traces

The Book of Traces
Partial-Order Methods for Temporal Verification

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A Stubborn Attack On State Explosion

CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

When analysing a concurrent program in order to verify its correctness, in practice, one faces severe complexity problems. To cope with the problem of state-space explosion, two different types of approaches have been established: abstraction techniques and partialorder methods that both have certain drawbacks. To overcome these drawbacks we show in this paper how to combine abstraction with the "persistent-set selective search" partial-order method.