Demand-Driven Model Checking for Context-Free Processes

  • Authors:

  • Jens Knoop

  • Affiliations:

  • -

  • Venue:
  • ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a demand-driven model-checking algorithm, which decides the alternation-free modal mu-calculus for context-free processes. This algorithm enjoys advantages known from local model checking in that it avoids the investigation of certain irrelevant parts of a process, and simultaneously improves on its classical counterpart of [5] in that it avoids the computation of irrelevant portions of property transformers. In essence, this algorithm evolves from combining the spirit of second-order model checking underlying the algorithm of [5] with the idea of demand-drivenness developed in the field of interprocedural dataflow analysis. Though the new algorithm has the same worst-case time complexity as its counterpart, we expect a substantial performance gain in practice because its demand-drivenness reduces the computational effort of those parts, which are responsible for the exponentiality of the classical second-order algorithm.