Sciweavers

681 search results - page 66 / 137
» A Logic for True Concurrency
Sort
View
PPOPP
2006
ACM
16 years 2 days ago
Proving correctness of highly-concurrent linearisable objects
We study a family of implementations for linked lists using finegrain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for ...
Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, Mar...
HIPEAC
2009
Springer
15 years 10 months ago
Steal-on-Abort: Improving Transactional Memory Performance through Dynamic Transaction Reordering
Abstract. In transactional memory, aborted transactions reduce performance, and waste computing resources. Ideally, concurrent execution of transactions should be optimally ordered...
Mohammad Ansari, Mikel Luján, Christos Kots...
EURODAC
1994
IEEE
129views VHDL» more  EURODAC 1994»
15 years 10 months ago
A general state graph transformation framework for asynchronous synthesis
Abstract -- A general framework for synthesis of asynchronous control circuits at the state graph level is proposed. The framework can consider both concurrency reduction as well a...
Bill Lin, Chantal Ykman-Couvreur, Peter Vanbekberg...
ICRA
2007
IEEE
137views Robotics» more  ICRA 2007»
16 years 13 days ago
Integrated Debugging of Large Modular Robot Ensembles
Abstract— Creatively misquoting Thomas Hobbes, the process of software debugging is nasty, brutish, and all too long. This holds all the more true in robotics, which frequently i...
Benjamin D. Rister, Jason Campbell, Padmanabhan Pi...
IANDC
2002
84views more  IANDC 2002»
15 years 5 months ago
Decidability of Split Equivalence
We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1 = E2 true for all...
Y. Abramson, Alexander Moshe Rabinovich