Pasar al contenido principal

METODOLOGIAS AVANZADAS PARA ARQUITECTURAS, DISEÑO Y PRUEBAS DE SOFTWARE.

PID2021-122215NB-C31

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2021
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD COMPLUTENSE DE MADRID

Resultados relacionados

Resultados totales (Incluyendo duplicados): 5
Encontrada(s) 1 página(s)

RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Publicación Artículo científico (JournalArticle)

Computing performance requirements for web service compositions

  • García Domínguez, Antonio
  • Palomo Lozano, Francisco
  • Medina Bulo, María Inmaculada
  • Ibias, Alfredo
  • Núñez, Manuel
In order to produce service compositions, modern web applications now combine both in-house and third-party web services. Therefore, their performance depends on the performance of the services that they integrate. At early stages, it may be hard to quantify the performance demanded from the services to meet the requirements of the application, as some services may not be available or may not provide performance guarantees. The authors present several algorithms that compute the required performance for each service from a model of a service composition at an early stage of development. This is also helpful when testing service compositions and selecting candidate web services, enabling performance-driven recommendation systems for web services that could be integrated into service discovery. Domain experts can annotate the model to include partial knowledge on the expected performance of the services. We develop a throughput computation algorithm and two time limit computation algorithms operating on such a model: a baseline algorithm, based on linear programming, and an optimised graph-based algorithm. We conduct theoretical and empirical evaluations of their performance and capabilities on a large sample of models of several classes. Results show that the algorithms can provide an estimation of the performance required by each service, and that the throughput computation algorithm and the graph-based time limit computation algorithm show good performance even in models with many paths.
Docta Complutense
Publicación Artículo científico (JournalArticle)

Combining Metamorphic Testing and Machine Learning to Enhance OpenStreetMap

  • Méndez Hurtado, Manuel
  • Becerra-Terón, Antonio
  • Almendros-Jiménez, Jesús M.
  • García Merayo, María De Las Mercedes
  • Núñez García, Manuel
Metamorphic testing (MT) is a useful tool to test systems where an oracle is not available. MT relies on the definition of metamorphic relations (MR), that is, certain properties that relate a set of inputs and the set of outputs produced by the system under test (SUT) as response to these inputs. Usually, a violation of an MR implies that the SUT is faulty. However, some work on MT accepts, for certain SUTs, that the violation of an MR almost always is a symptom of an error but assumes the potential existence of false positives. This is the case, for instance, of our recent work where we applied MT to improve OpenStreetMap (OSM). Our MRs were able to uncover a large amount of errors in all the analyzed maps but we suffered the presence of a nonnegligible number of false positives. Therefore, an expert had to manually check the suspicious elements identified by our MRs. If we analyze large maps, then this manual task is unfeasible. In this article we solve the main limitation of our previous approach: we accurately and automatically discard false positives. Our new framework combines MT, along the same lines of our previous work, and machine learning. Specifically, we provide three models, one for each MR, based on the random forest model. The models were extensively trained with real data obtained from the application of MRs to maps of cities located in different continents. In order to evaluate the usefulness of our models, we tested them using different cities, in countries that were not considered in the training set. The results were very good: accuracy of the models is never lower than 0.90, it is usually much higher and in many situations reaches 1.0. The computation of the F1-scores yielded similar results.
Docta Complutense
Publicación Contribución de congreso (ConferenceOutput)

Runtime Verification of Timed Petri Nets.

  • Kallwies, Hannes
  • Requeno Jarabo, José Ignacio
  • Gómez Martínez, María Elena
  • Haustein, Melanie
  • Leucker, Martin
  • Stolz, Volker
  • Stünkel, Patrick
Timed Petri net (TPN) is a type of Petri net for modeling concurrent systems that incorporates time durations as first-class citizens. This paper provides a means for analyzing TPN by runtime verification, a lightweight verification approach where a single run of a system is monitored. In particular, we assume the discrete-time semantics of TPN. We propose a TPN module for the definition and analysis of a TPN in the runtime verification framework TeSSLa, which is composed of the TeSSLa language, an interpreter, and a dedicated hardware monitor for online real-time analysis with minimal intrusion. The TeSSLa interpreter receives the definition of the TPN, the properties to analyze, and a set of execution traces and outputs an evaluation report. Our solution provides an efficient and user-friendly approach for the runtime verification of concurrent systems that are described by a high-level modeling language. For a practical evaluation of the approach, we have used parts of the library to model and analyze the workflow for examining specimens within the pathology department of Bergen’s hospital.
Docta Complutense
Publicación Contribución de congreso (ConferenceOutput)

Runtime Verification of Timed Petri Net Product Lines

  • Gómez Martínez, María Elena
  • Requeno Jarabo, José Ignacio
Petri Net Product Line (PNPL) is a type of Petri net focusing on the variability of reconfigurable industrial pipelines. This paper defines Timed Petri Net Product Lines (TPNPL), which incorporate time duration to PNPL as first-class citizens. TPNPLs rely on Coloured Petri Nets (CPN) for the notion of time. Additionally, we provide means for analysing TPNPL by runtime verification. The runtime verification features are implemented on top of the TeSSLa framework, which is composed by a TeSSLa language and interpreter. The TeSSLa interpreter receives the simulation of a TPNPL as a set of execution traces, the properties to analyse formalised in the TeSSLa language, and outputs an evaluation report. We update Titan, a modelling framework for the analysis of PNPL in Eclipse, in order to support the new features. To this end, Titan provides an automatic transformation of TPNPL into CPN, runs the CPN Tools engine for the simulation process, and forwards the execution traces and properties to the TeSSLa framework. Titan transparently coordinates all these steps.
Docta Complutense
Publicación Contribución de congreso (ConferenceOutput)

Fraud detection in Smart Grids using Signal Temporal Logic

  • Requeno Jarabo, José Ignacio
  • Llana Díaz, Luis Fernando
  • Merseguer, José
  • Gómez Martínez, María Elena
  • Mambakam, Akshay
  • Bernardi, Simona
Smart grids are defined as complex cyber-physical systems, which combine software controllers and protection systems with electrical power infrastructures. Despite the fact that smart grids boast enhanced resilience, security and reliability in comparison with conventional power infrastructures, they remain susceptible to cyber-attacks. The present paper is concerned with the issue of detecting energy theft, a problem that is addressed through the analysis of energy consumption readings. The objective of this work is to increase the accuracy and performance of current anomaly detectors, offering a comprehensible approach for monitoring the decisions made by real-time classifiers. In this regard, we propose the usage of Signal Temporal Logic (STL), a formalism for expressing properties in real-time signals, as classifiers for detecting anomalies in energy consumption. These STL expressions are instances of Parametric STL formulas, the parameters of which are automatically mined from the energy consumption behaviour of a customer. The paper presents a case study that is evaluated against publicly available real data using existing software tools.