The paper presents the new ocmputatinal model of Herbrand engines which combines finite-state contolr iwth uninterpreted data and functin registers,thus yielding a finite representation of infinite-state machines.herbrand engines are used to provide a high-levle model of out-of-order executionin the design of micro-processors.The problem of verifying that a fhighly parallel design for out-of-ordr execution correctly implements the Instruction Set Architecutre is reduced to establishign the equievalence of two Herbrand engines.We show that,for a reasonably restricted class of such engines the uqivalence problem is decidable,and present two algorithms for solving this problem.
展开▼
