Inferring congruence equations using SAT
AuthorKing, A; Sondergaard, H
Source TitleCOMPUTER AIDED VERIFICATION
University of Melbourne Author/sSondergaard, Harald
AffiliationComputer Science and Software Engineering
Document TypeConference Proceeding
CitationsKing, A; Sondergaard, H, Inferring congruence equations using SAT, COMPUTER AIDED VERIFICATION, 2008, 5123 pp. 281 - +
Access StatusThis item is currently not available from this repository
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.
- Click on "Export Reference in RIS Format" and choose "open with... Endnote".
- Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References