Abstraction Refinement for Quantified Array Assertions

  • Mohamed Nassim Seghir
  • Andreas Podelski
  • Thomas Wies
Conference paper

DOI: 10.1007/978-3-642-03237-0_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5673)
Cite this paper as:
Seghir M.N., Podelski A., Wies T. (2009) Abstraction Refinement for Quantified Array Assertions. In: Palsberg J., Su Z. (eds) Static Analysis. SAS 2009. Lecture Notes in Computer Science, vol 5673. Springer, Berlin, Heidelberg

Abstract

We present an abstraction refinement technique for the verification of universally quantified array assertions such as “all elements in the array are sorted”. Our technique can be seamlessly combined with existing software model checking algorithms. We implemented our technique in the ACSAR software model checker and successfully verified quantified array assertions for both text book examples and real-life examples taken from the Linux operating system kernel.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Mohamed Nassim Seghir
    • 1
  • Andreas Podelski
    • 1
  • Thomas Wies
    • 1
    • 2
  1. 1.University of FreiburgGermany
  2. 2.EPFLSwitzerland

Personalised recommendations