Brauer, Jörg and King, Andy - Transfer Function Synthesis without Quantifier Elimination

lmcs:814 - Logical Methods in Computer Science, September 17, 2012, Volume 8, Issue 3
Transfer Function Synthesis without Quantifier Elimination

Authors: Brauer, Jörg and King, Andy

Traditionally, transfer functions have been designed manually for each operation in a program, instruction by instruction. In such a setting, a transfer function describes the semantics of a single instruction, detailing how a given abstract input state is mapped to an abstract output state. The net effect of a sequence of instructions, a basic block, can then be calculated by composing the transfer functions of the constituent instructions. However, precision can be improved by applying a single transfer function that captures the semantics of the block as a whole. Since blocks are program-dependent, this approach necessitates automation. There has thus been growing interest in computing transfer functions automatically, most notably using techniques based on quantifier elimination. Although conceptually elegant, quantifier elimination inevitably induces a computational bottleneck, which limits the applicability of these methods to small blocks. This paper contributes a method for calculating transfer functions that finesses quantifier elimination altogether, and can thus be seen as a response to this problem. The practicality of the method is demonstrated by generating transfer functions for input and output states that are described by linear template constraints, which include intervals and octagons.


Source : oai:arXiv.org:1207.4286
DOI : 10.2168/LMCS-8(3:17)2012
Volume: Volume 8, Issue 3
Published on: September 17, 2012
Submitted on: October 14, 2011
Keywords: Computer Science - Logic in Computer Science,D.2.4, F.3.1


Share

Consultation statistics

This page has been seen 62 times.
This article's PDF has been downloaded 65 times.