Interpolating bit-vector formulas using uninterpreted predicates and Presburger arithmetic
Work
Year: 2021
Type: article
Abstract: The inference of program invariants over machine arithmetic, commonly called bit-vector arithmetic, is an important problem in verification. Techniques that have been successful for unbounded arithme... more
Source: Formal Methods in System Design
Institutions Mälardalen University, Uppsala University, Stanford University
Cites: 45
Cited by: 2
Related to: 10
FWCI: 0.259
Citation percentile (by year/subfield): 51.97
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Peace, justice, and strong institutions
Open Access status: hybrid
APC paid (est): $3,490
Funder Mälardalens högskola