Sciweavers

392 search results - page 39 / 79
» Privacy Requirement Modeling and Verification in Cloud Compu...
Sort
View
SPAA
2003
ACM
15 years 9 months ago
The complexity of verifying memory coherence
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
Jason F. Cantin, Mikko H. Lipasti, James E. Smith
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
16 years 4 months ago
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
Robin Künzler, Jörn Müller-Quade, D...
ASM
2008
ASM
15 years 6 months ago
Model Checking Event-B by Encoding into Alloy
As systems become ever more complex, verification becomes more main stream. Event-B and Alloy are two formal specification languages based on fairly different methodologies. While...
Paulo J. Matos, João Marques-Silva
162
Voted
HIPC
2007
Springer
15 years 8 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
124
Voted
HPCC
2009
Springer
15 years 8 months ago
Resource Leasing and the Art of Suspending Virtual Machines
Using virtual machines as a resource provisioning mechanism offers multiple benefits, most recently exploited by “infrastructure-as-a-service” clouds, but also poses several...
Borja Sotomayor, Rubén S. Montero, Ignacio ...