Skip to main content

METODOS RIGUROSOS PARA EL DESARROLLO DE SISTEMAS SOFTWARE DE CALIDAD Y FIABILIDAD CERTIFICADAS

PID2019-108528RB-C22

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2019
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD COMPLUTENSE DE MADRID

Resultados relacionados

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

Docta Complutense
Publication Contribución de congreso (ConferenceOutput)

Computing Political Power: The Case of the Spanish Parliament

Docta Complutense
Publication Contribución de congreso (ConferenceOutput)

An overview of the Maude strategy language and its applications

  • Rubio Cuéllar, Rubén Rafael
In the Maude specification language, the behavior of systems is modeled by nondeterministic rewrite rules, whose free application may not always be desirable. Hence, a strategy language has been introduced to control the application of rules at a high level, without the intricacies of metaprogramming. In this paper, we give an overview of the Maude strategy language, its applications, related verification tools, and extensions, illustrated with examples.
Docta Complutense
Publication Contribución de congreso (ConferenceOutput)

Programming Open Distributed Systems in Maude

  • Durán, Francisco
  • Eker, Steven
  • Escobar, Santiago
  • Martí Oliet, Narciso
  • Rubio Cuéllar, Rubén Rafael
  • Talcott, Carolyn
Maude is a high-performance logical framework based on rewriting logic and supporting formal specification, verification and declarative programming of concurrent systems. Since most concurrent open systems are made up of actor-like objects that communicate with each other through message passing, Maude provides special features to support their specification, verification and programming. Since open systems are heterogeneous, involving widely different kinds of objects such as sensors, actuators, devices, databases, graphical user interfaces, and so on, Maude supports declarative message-passing interaction between Maude objects and a wide variety of heterogeneous external objects. In this paper we explain and illustrate a methodology where an open system can first be designed and verified in Maude and then implemented as a distributed system of heterogeneous objects in a way that seamlessly bridges the gap between its formal specification and verification and its distributed implementation.
Docta Complutense
Publication Contribución de congreso (ConferenceOutput)

Equational Unification and Matching, and Symbolic Reachability Analysis in Maude 3.2 (System Description)

  • Durán, Francisco
  • Eker, Steven
  • Escobar, Santiago
  • Martí Oliet, Narciso
  • Meseguer, José
  • Rubio Cuéllar, Rubén Rafael
  • Talcott, Carolyn
Equational unification and matching are fundamental mechanisms in many automated deduction applications. Supporting them efficiently for as wide as possible a class of equational theories, and in a typed manner supporting type hierarchies, benefits many applications; but this is both challenging and nontrivial. We present Maude 3.2’s efficient support of these features as well as of symbolic reachability analysis of infinite-state concurrent systems based on them.
Docta Complutense
Publication Contribución de congreso (ConferenceOutput)

Maude as a library: an efficient all-purpose programming interface

  • Rubio Cuéllar, Rubén Rafael
We present a general and efficient programming interface to Maude from Python and other programming languages. All relevant Maude entities and operations are exposed in a documented object-oriented library to facilitate the integration of Maude into external programs and vice versa. This paper describes the design and implementation of the library, explains how to use it, and discusses some mature applications.
Docta Complutense
Publication Contribución de congreso (ConferenceOutput)

Specifying fairness constraints and model checking with non-intensional strategies

  • Rubio Cuéllar, Rubén Rafael
  • Martí Oliet, Narciso
  • Pita Andreu, María Isabel
  • Verdejo López, José Alberto
Strategies are a natural way of specifying constraints in a rewriting-based model. They are often expressed as executable programs in some strategy language that intensionally filter the possible next rewrites. Hence, they cannot capture restrictions of the model involving unbounded delays, like fairness, which are useful in many verification scenarios. In this paper, we propose a variation to the semantics of the Maude strategy language that allows expressing non-intensional strategies without recursion, in a way amenable for verification. Then we present an LTL model checker for this kind of strategies and discuss the corresponding problem for other logics.
Docta Complutense
Publication Contribución de congreso (ConferenceOutput)

QMaude: Quantitative Specification and Verification in Rewriting Logic

  • Rubio Cuéllar, Rubén Rafael
  • Martí Oliet, Narciso
  • Pita Andreu, María Isabel
  • Verdejo López, José Alberto
In formal verification, qualitative and quantitative aspects are both relevant, and high-level formalisms are convenient to naturally specify the systems under study and their properties. In this paper, we present a framework for describing probabilistic models on top of nondeterministic specifications in the highly-expressive language Maude, based on rewriting logic. Quantitative properties can be checked and calculated on them using both probabilistic and statistical methods with external tools like PRISM, Storm, MultiVeSta, and custom implementations as backends. At the same time, the underlying nondeterministic system can be verified using the qualitative model-checking and deductive tools already available in Maude.