Sciweavers

4604 search results - page 156 / 921
» Concurrency in Synchronous Systems
Sort
View
FOCS
2002
IEEE
15 years 9 months ago
Concurrent Zero Knowledge with Logarithmic Round-Complexity
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
Manoj Prabhakaran, Alon Rosen, Amit Sahai
TACAS
2010
Springer
156views Algorithms» more  TACAS 2010»
15 years 1 months ago
Preemption Sealing for Efficient Concurrency Testing
The choice of where a thread scheduling algorithm preempts one thread in order to execute another is essential to reveal concurrency errors such as atomicity violations, livelocks,...
Thomas Ball, Sebastian Burckhardt, Katherine E. Co...
ICEIS
2003
IEEE
15 years 9 months ago
Distributed Overload Control for Real-Time Replicated Database Systems
: In order to meet their temporal constraints, current applications such as Web-based services and electronic commerce use the technique of data replication. To take the replicatio...
Samia Saad-Bouzefrane, Claude Kaiser
SIGSOFT
2010
ACM
15 years 1 months ago
Building scalable software systems in the multicore era
Software systems must face two challenges today: growing complexity and increasing parallelism in the underlying computational models. The problem of increased complexity is often...
Hridesh Rajan
SAFECOMP
1999
Springer
15 years 8 months ago
Formal Design of Distributed Control Systems with Lustre
During the last decade, the synchronous approach has proved to meet industrial needs concerning the development of Distributed Control Systems (DCS): as an example, Schneider Elect...
Paul Caspi, Christine Mazuet, Rym Salem, Daniel We...