Bit-precise reasoning with affine functions
Bit-precise reasoning with affine functions
复制标题
使用仿射函数进行位精确推理
DOI:
10.1145/1512464.1512474
复制
发表时间:
2008
期刊:
影响因子:
--
通讯作者:
Kettle N
中科院分区:
文献类型:
--
作者:
Kettle N
The class of affine Boolean functions is rich enough to express constant bits and dependencies between different bits of different words. For example, the function (x0) ∧ (¬y1) ∧ (x4⇔y7) ∧ (x5⇔ ¬y9) is affine and expresses the invariant that the low bit (bit 0) of the variablexis true, that bit 1 ofyis false, that the bits 4 and 7 ofxandycoincide whereas bits 5 and 9 ofxandydiffer. This class of Boolean function is amenable to bit-precise reasoning since it satisfies strong chain properties which bound the number of times a system of semantic fixpoint equations need to be reapplied when reasoning about loops. This paper address the key problem of abstracting an arbitrary Boolean function to either a general affine function or a so-called affine function of width 2, when the function is represented as an ROBDD. Novel algorithms are presented for this task: one that manipulates Boolean vectors and another which is inspired by anti-unification. The speed and precision of both algorithms are compared on benchmark circuits, to draw conclusions on the tractability of affine abstraction.
登录
查看更多内容
DOI:
--
发表时间:
1994
期刊:
影响因子:
--
作者:
R. Razdan
通讯作者:
R. Razdan
DOI:
--
发表时间:
2002
期刊:
European Conference on Artificial Intelligence
影响因子:
--
作者:
B. Zanuttini
通讯作者:
B. Zanuttini
影响因子:
22.7
作者:
A. Peleg;Sam Wilkie;U. Weiser
通讯作者:
U. Weiser
DOI:
--
发表时间:
2006
期刊:
International Conference on Tools and Algorithms for Construction and Analysis of Systems
影响因子:
--
作者:
N. Kettle;A. King;Tadeusz Strzemecki
通讯作者:
Tadeusz Strzemecki
DOI:
--
发表时间:
2000
期刊:
European Conference on Parallel Processing
影响因子:
--
作者:
M. Budiu;M. Sakr;Kip Walker;S. Goldstein
通讯作者:
S. Goldstein