Symbolic analysis via semantic reinterpretation

SPIN 09

DOI: 10.1007/s10009-010-0158-6

Cite this article as:
Lim, J., Lal, A. & Reps, T. Int J Softw Tools Technol Transfer (2011) 13: 61. doi:10.1007/s10009-010-0158-6
  • 70 Downloads

Abstract

The paper presents a novel technique to create implementations of the basic primitives used in symbolic program analysis: forward symbolic evaluation, weakest liberal precondition, and symbolic composition. We used the technique to create a system in which, for the cost of writing just one specification—an interpreter for the programming language of interest—one obtains automatically generated, mutually-consistent implementations of all three symbolic-analysis primitives. This can be carried out even for languages with pointers and address arithmetic. Our implementation has been used to generate symbolic-analysis primitives for the x86 and PowerPC instruction sets.

Keywords

Symbolic analysis primitives Symbolic execution Weakest liberal precondition Symbolic composition Semantic reinterpretation 

Copyright information

© Springer-Verlag 2010

Authors and Affiliations

  1. 1.University of WisconsinMadisonUSA
  2. 2.Microsoft Research IndiaBangaloreIndia
  3. 3.GrammaTech, Inc.IthacaUSA