Abstract
Formal verification of policy-based services in cloud environments using SMT (Satisfiability Modulo Theories) solvers involves encoding the policies and service behaviors as logical formulas and checking whether the formulas are satisfactory or unsatisfiable. SMT solvers can be used to verify that the policies are enforced correctly and that the service behaviors are consistent with the policies.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International scientific and technical conference Information technologies in metallurgy and machine building
Paper Title
Journal
Date
