Karen Yorav

Followers

Following

Public Views

Christina Williamson

University of Groningen

David Seamon

Kansas State University

Remo Caponi

University of Cologne

Armando Marques-Guedes

UNL - New University of Lisbon

Ahmet Tolga Tek

Anadolu University

Aliye Erol

Istanbul University

Luca Peyronel

Università degli Studi di Milano - State University of Milan (Italy)

Frank Daubner

Universität Trier

Eckart Otto

Ludwig-Maximilians-Universität München

Bálint Molnár

Eötvös Loránd University

Interests

Uploads

Papers by Karen Yorav

A Model-Driven Framework for Automated Generation and Verification of Cloud Solutions from Requirements

Cloud computing projects require the design of a so-called Cloud Solution, which is an architectu... more Cloud computing projects require the design of a so-called Cloud Solution, which is an architectural blueprint for a particular cloud environment. A cloud solution defines the hosting infrastructure (servers, VMs, etc.), software stack, and services such as network, backup, disaster recovery, management, etc. The design of a cloud solution needs to consider existing client environments and future environment’s requirements, and at the same time comply with the cloud provider’s portfolio and limitations. As such, the design of enterprise cloud solutions is a very complex and challenging problem. In this paper, we present a novel framework for provider-side cloud solution design based on model-driven and formal methods that facilitates the job of automated solution generation, starting from client requirements and resulting in a complete and correct cloud solution. We present a set of novel methods and a tool, called COOL, which implements the method and is used in production in a lar...

Hardware and Software: Verification and Testing, Third International Haifa Verification Conference, HVC 2007, Haifa, Israel, October 23-25, 2007, Proceedings

Invited Talks.- Simulation vs. Formal: Absorb What Is Useful Reject What Is Useless.- Scaling Com... more Invited Talks.- Simulation vs. Formal: Absorb What Is Useful Reject What Is Useless.- Scaling Commercial Verification to Larger Systems.- From Hardware Verification to Software Verification: Re-use and Re-learn.- Where Do Bugs Come from?.- HVC Award.- Symbolic Execution and Model Checking for Testing.- Hardware Verification.- On the Characterization of Until as a Fixed Point Under Clocked Semantics.- Reactivity in SystemC Transaction-Level Models.- Model Checking.- Verifying Parametrised Hardware Designs Via Counter Automata.- How Fast and Fat Is Your Probabilistic Model Checker? An Experimental Performance Comparison.- Dynamic Hardware Verification.- Constraint Patterns and Search Procedures for CP-Based Random Test Generation.- Using Virtual Coverage to Hit Hard-To-Reach Events.- Merging Formal and Testing.- Test Case Generation for Ultimately Periodic Paths.- Dynamic Testing Via Automata Learning.- Formal Verification for Software.- On the Architecture of System Verification Envi...

Property-based System Design Improved Static Property Checking Tool (deliverable 3.2/7) Co Confidential, Only for Members of the Consortium (including the Commission Services) Ii Introduction Improved Static Property Checking Tool Table of Revisions

ion Refinement Abstraction refinement [7] is a process, in which a model is first grossly abstrac... more ion Refinement Abstraction refinement [7] is a process, in which a model is first grossly abstracted, to form a much smaller (and easier to verify) model, and then iteratively refined. At each iteration, a model checker checks the current abstract model. If it can come up with a definite answer (either pass or fail), the process terminates. Otherwise, a refined model is built for the next iteration. The abstract models are constructed such that a proof by the model checker will also hold on the concrete model. A falsification, on the other hand, must be checked on the concrete model to determine its validity. This however may be easier than model checking the concrete model, as we only have to check whether a falsifying counterexample is also valid on the concrete model. Whenever a counterexample is found to be spurious (cannot be reconstructed on the concrete model) a refinement process takes place, yielding a less abstract model. The whole abstraction refinement process is demonst...

Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing

SAT-Based Predicate Abstraction of Programs

for the operation of the Software Engineering Institute, a federally funded research and developm... more

Karen Yorav

Related Authors

Uploads

Papers by Karen Yorav

Log In