• Aucun résultat trouvé

Using Metaheuristic Search for the Analysis and Verification of UML Models

N/A
N/A
Protected

Academic year: 2022

Partager "Using Metaheuristic Search for the Analysis and Verification of UML Models"

Copied!
1
0
0

Texte intégral

(1)

Invited Talk

Using Metaheuristic Search for the Analysis and Verification of UML Models

Lionel C. Briand

Simula & University of Oslo, Oslo, Norway

Abstract. There is a growing research activity around the use of meta- heuristic search techniques (e.g., genetic algorithms) in software engi- neering, for example to support test case generation. This is often re- ferred to as search-based software engineering and is the subject of an international conference every year. This presentation will reflect on sev- eral years of research, involving several collaborators, that has focused on using metaheuristic search to support the analysis and verification of UML models and its extensions such as MARTE and OCL. Examples include the analysis of real-time deadlines (schedulability analysis), con- currency problems, and constraint solving, for example for supporting model-based test case generation. Results suggest that applying meta- heuristic approaches to these problems lead to practical and scalable solutions that rely solely on UML and extensions, and does not require translations into other languages and formalisms. This latter property is of high practical importance in industrial practice.

MoDELS 2010 ACES-MB Workshop Proceedings

Oslo, Norway, October 4, 2010 9

Références

Documents relatifs

Page S2 Table S1 Crystal data and structure refinement for 32.. Crystal data and structure refinement

2) Skewness of Probability Distributions: Figure 2 shows the probability for the most frequent repair actions of repair model CTET according to the transaction size (in number of

it has dealt with the integration of semantic search on several portal levels, used for the solution of scientific projects, and also the employment of new communi- cation means from

In this work, the idea of a factor which minimizes the time to search the solution space by heuristic algorithms is presentedI. The proposed modification is described and tested

We propose new modifications of the greedy agglomerative heuristic algo- rithms with local search in SWAP neighborhood for the p-medoid problems and j-means procedure for

Most of these take into account segment overlap or the distance to jump-in points, to compute the precision with which relevant content has been retrieved, and also reflect

Based on numerous experimental observations, the balance strategies can be broadly categorized into 2 classes: 1) Fixed-Support strategies, which include the Ankle and the

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des