School of Computing

Inferring Congruence Equations with SAT

Andy King and Harald Sondergaard

Technical Report 1-08, Computing Laboratory, University of Kent, January 2008.

Abstract

We propose 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.

Download publication 205 kbytes (PDF)

Bibtex Record

@techreport{2898,
author = {Andy King and Harald S{o}ndergaard},
title = {Inferring {C}ongruence {E}quations with {SAT}},
month = {January},
year = {2008},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2008/2898},
    publication_type = {techreport},
    submission_id = {29056_1240935521},
    institution = {Computing Laboratory, University of Kent},
    number = {1-08},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014