Ranking function synthesis for bit-vector relations.
Saved in:
| Title: | Ranking function synthesis for bit-vector relations. |
|---|---|
| Authors: | Cook, Byron1 bycook@microsoft.com, Kroening, Daniel2 kroening@cs.ox.ac.uk, Rümmer, Philipp3 philipp.ruemmer@it.uu.se, Wintersteiger, Christoph1 cwinter@microsoft.com |
| Source: | Formal Methods in System Design. Aug2013, Vol. 43 Issue 1, p93-120. 28p. |
| Subjects: | Software verification, Computer software termination, Algorithms, Data structures, Array processors, Multiprocessors |
| Abstract: | Ranking function synthesis is a key component of modern termination provers for imperative programs. While it is well-known 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Formal Methods in System Design is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 88801167 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Ranking function synthesis for bit-vector relations. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Cook%2C+Byron%22">Cook, Byron</searchLink><relatesTo>1</relatesTo><i> bycook@microsoft.com</i><br /><searchLink fieldCode="AR" term="%22Kroening%2C+Daniel%22">Kroening, Daniel</searchLink><relatesTo>2</relatesTo><i> kroening@cs.ox.ac.uk</i><br /><searchLink fieldCode="AR" term="%22Rümmer%2C+Philipp%22">Rümmer, Philipp</searchLink><relatesTo>3</relatesTo><i> philipp.ruemmer@it.uu.se</i><br /><searchLink fieldCode="AR" term="%22Wintersteiger%2C+Christoph%22">Wintersteiger, Christoph</searchLink><relatesTo>1</relatesTo><i> cwinter@microsoft.com</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Formal+Methods+in+System+Design%22">Formal Methods in System Design</searchLink>. Aug2013, Vol. 43 Issue 1, p93-120. 28p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Software+verification%22">Software verification</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+software+termination%22">Computer software termination</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Data+structures%22">Data structures</searchLink><br /><searchLink fieldCode="DE" term="%22Array+processors%22">Array processors</searchLink><br /><searchLink fieldCode="DE" term="%22Multiprocessors%22">Multiprocessors</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Ranking function synthesis is a key component of modern termination provers for imperative programs. While it is well-known 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. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Formal Methods in System Design is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=88801167 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s10703-013-0186-4 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 28 StartPage: 93 Subjects: – SubjectFull: Software verification Type: general – SubjectFull: Computer software termination Type: general – SubjectFull: Algorithms Type: general – SubjectFull: Data structures Type: general – SubjectFull: Array processors Type: general – SubjectFull: Multiprocessors Type: general Titles: – TitleFull: Ranking function synthesis for bit-vector relations. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Cook, Byron – PersonEntity: Name: NameFull: Kroening, Daniel – PersonEntity: Name: NameFull: Rümmer, Philipp – PersonEntity: Name: NameFull: Wintersteiger, Christoph IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 08 Text: Aug2013 Type: published Y: 2013 Identifiers: – Type: issn-print Value: 09259856 Numbering: – Type: volume Value: 43 – Type: issue Value: 1 Titles: – TitleFull: Formal Methods in System Design Type: main |
| ResultId | 1 |
