SATABS: SAT-Based predicate abstraction for ANSI-C

  • Authors:
  • Edmund Clarke;Daniel Kroening;Natasha Sharygina;Karen Yorav

  • Affiliations:
  • School of Computer Science, Carnegie Mellon University;ETH Zuerich, Switzerland;School of Computer Science, Carnegie Mellon University;IBM, Haifa, Israel

  • Venue:
  • TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a model checking tool, SatAbs, that implements a predicate abstraction refinement loop. Existing software verification tools such as Slam, Blast, or Magic use decision procedures for abstraction and simulation that are limited to integers. SatAbs overcomes these limitations by using a SAT-solver. This allows the model checker to handle the semantics of the ANSI-C standard accurately. This includes a sound treatment of bit-vector overflow, and of the ANSI-C pointer arithmetic constructs.