Verifying linear temporal properties of data insensitive controllers using finite instantiations
暂无分享,去创建一个
Data insensitive controllers (DICs) are systems where the datapath consists of assignment gates moving the integer data around, and latches storing the data. Memory controllers and communication systems are examples of DICs. In [HB95], it is proved that for DICs the property “when binary variable b becomes true, integer variables x and y are equal” can be proved by down-scaling the integer variables x and y to single-bit binary variables. In this paper, we generalize this notion and consider the problem of verifying properties of DICs in a linear temporal logic whose atomic propositions are finite variables and integer equalities. We show that for this temporal logic, one can always use finite instantiations, although the number of required bits varies with the complexity of the property.
[1] Pierre Wolper,et al. The tableau method for temporal logic: an overview , 1985 .
[2] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[3] Pierre Wolper,et al. Expressing interesting properties of programs in propositional temporal logic , 1986, POPL '86.
[4] Robert K. Brayton,et al. Automatic Datapath Abstraction In Hardware Systems , 1995, CAV.