International Conference on Tools and Algorithms for the Construction and Analysis of Systems

TACAS 2009: Tools and Algorithms for the Construction and Analysis of Systems pp 322-336

Symbolic String Verification: Combining String Analysis and Size Analysis

  • Fang Yu
  • Tevfik Bultan
  • Oscar H. Ibarra
Conference paper

DOI: 10.1007/978-3-642-00768-2_28

Volume 5505 of the book series Lecture Notes in Computer Science (LNCS)

Abstract

We present an automata-based approach for symbolic verification of systems with unbounded string and integer variables. Particularly, we are interested in automatically discovering the relationships among the string and integer variables. The lengths of the strings in a regular language form a semilinear set. We present a novel construction for length automata that accept the unary or binary representations of the lengths of the strings in a regular language. These length automata can be integrated with an arithmetic automaton that recognizes the valuations of the integer variables at a program point. We propose a static analysis technique that uses these automata in a forward fixpoint computation with widening and is able to catch relationships among the lengths of the string variables and the values of the integer variables. This composite string and integer analysis enables us to verify properties that cannot be verified using string analysis or size analysis alone.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Fang Yu
    • 1
  • Tevfik Bultan
    • 1
  • Oscar H. Ibarra
    • 1
  1. 1.Department of Computer ScienceUniversity of CaliforniaSanta BarbaraUSA