Abstract
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for relations over (mathematical) integers or rationals, efficient synthesis of ranking functions for machine-level integers (bit-vectors) is an open problem. This is particularly relevant for the verification of low-level code. We propose several novel algorithms to generate ranking functions for relations over machine integers: a complete method based on a reduction to Presburger arithmetic, and a template-matching approach for predefined classes of ranking functions based on reduction to SAT- and QBF-solving. The utility of our algorithms is demonstrated on examples drawn from Windows device drivers. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Cook, B., Kroening, D., Rümmer, P., & Wintersteiger, C. M. (2010). Ranking function synthesis for bit-vector relations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6015 LNCS, pp. 236–250). https://doi.org/10.1007/978-3-642-12002-2_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
