Inferring congruence equations using SAT
AuthorKing, A; SONDERGAARD, H
EditorGupta, A; Malik, S
Source TitleLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
University of Melbourne Author/sSondergaard, Harald
AffiliationComputer Science and Software Engineering
Document TypeConference Paper
CitationsKing, A. & SONDERGAARD, H. (2008). Inferring congruence equations using SAT. Gupta, A (Ed.) Malik, S (Ed.) Computer Aided Verification (Lecture Notes in Computer Science), 5123, pp.281-293. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-70545-1_26.
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