Inferring Congruence Equations using SAT

King, A.M. and Sondergaard, H. (2008) Inferring Congruence Equations using SAT. In: Twentieth International Conference on Computer-Aided Verification, JUL 07, 2008, Princeton, NJ.

PDF
Download (222Kb)	Preview

Abstract

This paper proposes a new approach for deriving invariants that are systems of congruence equations where the modulo is a power of 2. The technique is an amalgam of SAT-solving, where a propositional formula is used to encode the semantics of a basic block, and abstraction, where the solutions to the formula are systematically combined and summarised as a system of congruence equations. The resulting technique is more precise than existing congruence analyses since a single optimal transfer function is derived for a basic block as a whole.

Item Type:	Conference or workshop item (Paper)
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User:	Mark Wheadon
Date Deposited:	29 Mar 2010 12:09
Last Modified:	12 Jun 2012 15:24
Resource URI:	http://kar.kent.ac.uk/id/eprint/23969 (The current URI for this page, for reference purposes)

• Depositors only (login required):