Sciweavers

247 search results - page 48 / 50
» A Proof System and a Decision Procedure for Equality Logic
Sort
View
FMCAD
1998
Springer
13 years 11 months ago
Combining Symbolic Model Checking with Uninterpreted Functions for Out-of-Order Processor Verification
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...
CADE
2005
Springer
14 years 7 months ago
The Decidability of the First-Order Theory of Knuth-Bendix Order
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...
Ting Zhang, Henny B. Sipma, Zohar Manna
KER
2008
193views more  KER 2008»
13 years 7 months ago
The 1st international workshop on computational social choice
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...
Ulle Endriss
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 7 months ago
Typestate Checking and Regular Graph Constraints
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 ...
Viktor Kuncak, Martin C. Rinard
SACMAT
2003
ACM
14 years 22 days ago
Cooperative role-based administration
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...
Horst Wedde, Mario Lischka