An Improvement in Partial-Order Model-Checking With Ample Sets

An Improvement in Partial-Order Model-Checking With Ample Sets (1996)

Cached

Download Links

[prga.site.uottawa.ca]

by Hans Van Der Schoot , Hasan Ural

Citations:

1 - 1 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	An Improvement in Partial-Order Model-Checking With Ample Sets	user correction - Legacy Corrections
AUTHOR NAME	Hans Van Der Schoot	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science; University of Ottawa; Ottawa, Ontario K1N 6N5	SVM HeaderParse 0.2
AUTHOR ADDR	Canada	SVM HeaderParse 0.1
AUTHOR NAME	Hasan Ural	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science; University of Ottawa; Ottawa, Ontario K1N 6N5	SVM HeaderParse 0.2
AUTHOR ADDR	Canada	SVM HeaderParse 0.1
ABSTRACT	In [18], Peled describes a partial-order reduction method to alleviate the state-explosion problem for LTL model-checking, i.e. for verifying that concurrent programs satisfy their linear temporal logic specifications. We present an approach that improves the method in [18] by enabling a further reduction of the space and time required for LTL model-checking. Keywords Concurrency, program correctness, model-checking, partial-order reduction, temporal logic 1 Introduction Partial-order reduction methods [1-3, 6, 8, 17, 18, 21-23] form a collection of state exploration techniques set to relieve the state-explosion problem in concurrent program verification. The main observation underlying these methods is that in many cases the properties verified are insensitive to the interleaving order of concurrent program operations. Therefore, fixing some arbitrary order among concurrent operations provides a means for reducing the size of the state space that needs to be analyzed. Partial-order ...	user correction - Legacy Corrections
YEAR	1996	INFERENCE
VENUE TYPE	TECHREPORT	INFERENCE
TECH	TR-96-11	INFERENCE
CITATIONS	24 found	ParsCit 1.0