Local Search in Model Checking

  • Authors:
  • A. W. Roscoe;P. J. Armstrong; Pragyesh

  • Affiliations:
  • Oxford University Computing Laboratory,;Oxford University Computing Laboratory,;Oxford University Computing Laboratory,

  • Venue:
  • ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce a new strategy for structuring large searches in model checking, called local search , as an alternative to depth-first and breadth-first search. It is designed to optimise the amount of checking that is done relative to communication, where communication can mean either between parallel processors or between fast main memory and backing store, whether virtual memory or disc files. We report on it in the context of the CSP refinement checker FDR.