Assertion Checking Unified

  • Sumit Gulwani
  • Ashish Tiwari
Conference paper

DOI: 10.1007/978-3-540-69738-1_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4349)
Cite this paper as:
Gulwani S., Tiwari A. (2007) Assertion Checking Unified. In: Cook B., Podelski A. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2007. Lecture Notes in Computer Science, vol 4349. Springer, Berlin, Heidelberg

Abstract

We revisit the connection between equality assertion checking in programs and unification that was recently described in [7]. Using a general formalization of this connection, we establish interesting connections between the complexity of assertion checking in programs and unification theory of the underlying program expressions. In particular, we show that assertion checking is: (a) PTIME for programs with nondeterministic conditionals that use expressions from a strict unitary theory, (b) coNP-hard for programs with nondeterministic conditionals that use expressions from a bitary theory, and (c) decidable for programs with disequality guards that use expressions from a convex finitary theory. These results generalize several recently published results and also establish several new results. In essence, they provide new techniques for backward analysis of programs based on novel integration of theorem proving technology in program analysis.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Sumit Gulwani
    • 1
  • Ashish Tiwari
    • 2
  1. 1.Microsoft Research, Redmond, WA 98052 
  2. 2.SRI International, Menlo Park, CA 94025 

Personalised recommendations