Transfer Function Synthesis without Quantifier Elimination (long version)

Brauer, Jorg and King, Andy (2012) Transfer Function Synthesis without Quantifier Elimination (long version). Logical Methods in Computer Science, 8 (2012). (Full text available)

PDF (Logical Methods in Computer Science) - Accepted Version
Download (810kB) Preview
[img]
Preview
Official URL
http://www.cs.kent.ac.uk/pubs/2012/3238

Abstract

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.

Item Type: Article
Additional information: Available as http://arxiv.org/abs/1207.4286
Uncontrolled keywords: abstract interpretation, best transform, transfer functions, binary analysis
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Programming Languages and Systems Group
Depositing User: Andy King
Date Deposited: 21 Sep 2012 09:49
Last Modified: 18 Jun 2014 08:53
Resource URI: http://kar.kent.ac.uk/id/eprint/30800 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year