We present a new approach to the verification of hardware systems with data dependencies using temporal logic symbolic model checking. As a benchmark we take Tomasulo's algori...
Sergey Berezin, Armin Biere, Edmund M. Clarke, Yun...
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
Computational social choice is a new discipline currently emerging at the interface of social choice theory and computer science. It is concerned with the application of computati...
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
In large organizations the administration of access privileges (such as the assignment of an access right to a user in a particular role) is handled cooperatively through distribu...