Three-Valued Spotlight Abstractions

  • Authors:
  • Jonas Schrieb;Heike Wehrheim;Daniel Wonisch

  • Affiliations:
  • Institut für Informatik, Universität Paderborn, Paderborn, Germany 33098;Institut für Informatik, Universität Paderborn, Paderborn, Germany 33098;Institut für Informatik, Universität Paderborn, Paderborn, Germany 33098

  • Venue:
  • FM '09 Proceedings of the 2nd World Congress on Formal Methods
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Spotlight abstractions in verification focus on one specific component in a parallel system while disregarding most information about the rest. Existing spotlight abstractions are either based on over- or on underapproximations of the parallel system, thus either preserving existential or universal properties. In this paper we present three-valued spotlight abstractions for parallel systems which preserve both existential and universal properties. We show correctness of the abstraction technique as well as present a procedure for abstraction refinement. The technique has been implemented on top of an existing three-valued model checker. Experimental results show that our technique can outperform existing predicate abstraction tools on certain classes of parallel systems.