Hierarchical Compression for Model-Checking CSP or How to Check 1020 Dining Philosophers for Deadlock

@inproceedings{Roscoe1995HierarchicalCF,
  title={Hierarchical Compression for Model-Checking CSP or How to Check 1020 Dining Philosophers for Deadlock},
  author={A. W. Roscoe and Paul H. B. Gardiner and Michael Goldsmith and J. R. Hulance and D. M. Jackson and J. Bryan Scattergood},
  booktitle={TACAS},
  year={1995}
}
FDR (Failures-Divergence Refinement) [6] is a model-checking tool for CSP [10]. Except for the recent addition of determinism checking [20, 22] (primarily for checking security properties) its method of verifying specifications is to test for the refinement of a process representing the specification by the target process. The presently released version (FDR 1) uses only explicit model-checking techniques: it fully expands the state-space of its processes and visits each state in turn. Though… CONTINUE READING
Highly Cited
This paper has 123 citations. REVIEW CITATIONS

Topics

Statistics

051015'97'99'01'03'05'07'09'11'13'15'17
Citations per Year

124 Citations

Semantic Scholar estimates that this publication has 124 citations based on the available data.

See our FAQ for additional information.