691 search results - page 25 / 139 » Automatically Proving Linearizability |
BIRTHDAY
2005
Springer
14 years 3 months ago
2005
Springer
We propose two transformations on term rewrite systems (TRSs) based on reducing right hand sides: one related to the transformation order and a variant of dummy elimination. Under ...
AISC
2004
Springer
14 years 1 months ago
2004
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. We show how polynomial interpretations with negative coefficients, like x - 1 for...
CALCO
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. CIRC is an automated circular coinductive prover implemented as an extension of Maude. The circular coinductive technique that forms the core of CIRC is discussed, togeth...
HT
2011
ACM
13 years 1 months ago
2011
ACM
Personalized search and browsing is increasingly vital especially for enterprises to able to reach their customers. Key challenge in supporting personalization is the need for ric...
IWANN
2009
Springer
14 years 4 months ago
2009
Springer
Controlling a biped robot with several degrees of freedom is a challenging task that takes the attention of several researchers in the fields of biology, physics, electronics, com...