Sciweavers

2300 search results - page 234 / 460
» Maximally Concurrent Programs
Sort
View
POPL
2010
ACM
16 years 3 months ago
On the Verification Problem for Weak Memory Models
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
Ahmed Bouajjani, Madanlal Musuvathi, Mohamed Faouz...
COMCOM
2002
120views more  COMCOM 2002»
15 years 6 months ago
The Cyclone Server Architecture: streamlining delivery of popular content
Abstract-We propose a new webserver architecture optimized for delivery of large, popular files. Delivery of such files currently pose a scalability problem for conventional conten...
Stanislav Rost, John W. Byers, Azer Bestavros
JSAC
2011
171views more  JSAC 2011»
15 years 1 months ago
CodeOn: Cooperative Popular Content Distribution for Vehicular Networks using Symbol Level Network Coding
—Driven by both safety concerns and commercial interests, one of the key services offered by vehicular networks is popular content distribution (PCD). The fundamental challenges ...
Ming Li, Zhenyu Yang, Wenjing Lou
LICS
1996
IEEE
15 years 10 months ago
Integration in Real PCF
Real PCF is an extension of the programming language PCF with a data type for real numbers. Although a Real PCF definable real number cannot be computed in finitely many steps, it...
Abbas Edalat, Martín Hötzel Escard&oac...
MJ
2007
87views more  MJ 2007»
15 years 6 months ago
Using SAT-based techniques in power estimation
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...
Assim Sagahyroon, Fadi A. Aloul