Sciweavers

606 search results - page 50 / 122
» Complexity Results for Checking Distributed Implementability
Sort
View
IPPS
2003
IEEE
15 years 5 months ago
Loop Dissevering: A Technique for Temporally Partitioning Loops in Dynamically Reconfigurable Computing Platforms
This paper presents a technique, called loop dissevering, to temporally partitioning any type of loop presented in programming languages. The technique can be used in the presence...
João M. P. Cardoso
MICRO
2008
IEEE
137views Hardware» more  MICRO 2008»
14 years 11 months ago
Verification of chip multiprocessor memory systems using a relaxed scoreboard
Verification of chip multiprocessor memory systems remains challenging. While formal methods have been used to validate protocols, simulation is still the dominant method used to ...
Ofer Shacham, Megan Wachs, Alex Solomatnikov, Amin...
CSE
2009
IEEE
15 years 3 months ago
Adapting Privacy-Preserving Computation to the Service Provider Model
There are many applications for Secure Multi-Party Computation (SMC), but practical adoption is still an issue. One reason is that the business model of the application does not m...
Florian Kerschbaum
ACSAC
2002
IEEE
15 years 4 months ago
Enforcing Resource Bound Safety for Mobile SNMP Agents
The integration of mobile agents with SNMP creates significant advantages for the management of complex networks. Nevertheless, the security concerns of mobile agent technology l...
Weijiang Yu, Aloysius K. Mok
LOGCOM
2008
110views more  LOGCOM 2008»
14 years 11 months ago
Sum and Product in Dynamic Epistemic Logic
The Sum-and-Product riddle was first published in [Fre69]. We provide an overview on the history of the dissemination of this riddle through the academic and puzzle-math community...
Hans P. van Ditmarsch, Ji Ruan, Rineke Verbrugge