Scalable Computing Practice and Experience · 2015 · 18 citations · 29 references
ComputingCloud ComputingComputer ScienceFault-tolerant ComputingFault-tolerant SystemsFormal MethodsReliable Distributed SystemsResource SchedulingCloud SchedulingDistributed Systems VerificationFormal Verification
Formal methods are necessary to capture the semantics and behavior of processes of various systems. They characterize and provide insight into the behavior of real systems and thus identify their deterministic and non-deterministic features. The design and deployment of cloud computing systems utilize the current technology development in order to provide the appropriate service and accommodate the increasing demand while maintaining high quality and error free service. In this paper, we discuss the state of the art on using formal methods for the verification of cloud computing systems. Even though formal methods have been used successfully in the design and verification of several aspects of these systems, there are still many design issues in cloud computing that can be enhanced using formal methods. For instance, several scheduling algorithms are being used for cloud frameworks, such as Hadoop for instance, that are found to suffer from scheduling failures. This could have been avoided if the schedular has been properly verified. On the other hand, several new paradigms have evolved with cloud computing such as big data, these require fundamental changed on methods and algorithms that are being used for classical distributed systems, which in turn, increase the chance of having faulty systems that are difficult to highlight using only simulation methods.
29
Gerard J. Holzmann · IEEE Transactions on Software Engineering · 1997 · 3.8K citations
Koen Claessen, John Hughes · ACM SIGPLAN Notices · 2011 · 1K citations
Compact Proofs of Retrievability
Hovav Shacham, Brent Waters · Journal of Cryptology · 2012 · 502 citations · Full text