Mostrando ítems 1-4 de 4

A Semantic Framework for the Design of Distributed Reactive Real-Time Languages and Applications

Sanabria-Ardila, Mateo; Benavides-Navarro, Luis Daniel; Díaz-López, Daniel; Garzón-Alfonso, Wilmer (2020)

The proliferation of on-demand internet services delivered over a network of a heterogeneous set of computing devices has created the need for high-performing dynamic systems in real-time. Services such as audio and video ...
Una semántica ejecutable en lógica de reescritura para programación espacial concurrente por restricciones (SCCP)

Romero González, Miguel Ángel (Ingeniería de Sistemas, 2017)

This document presents an executable semantics in rewrite logic for Concurrent Spatial Constraint Programming, abbreviated SCCP. SCCP is a computational model used to reason about spatial information and knowledge distributed ...
Synchronous set relations in rewriting logic

Muñoz, César; Rocha Niño, Hernán Camilo (Elsevier, 2014)

This paper presents a mathematical foundation and a rewriting logic infrastructure for the execution and property verification of synchronous set relations. The mathematical foundation is given in the language of abstract ...
Tool Interoperability in the Maude Formal Environment

Durán, Francisco; Rocha, Camilo; Álvarez, José María (SpringerBerlín, 2011)

We present the Maude Formal Environment (MFE), an executable formal specification in Maude within which a user can seamlessly interact with the Maude Termination Tool, the Maude Sufficient Completeness Checker, the ...

Envíos recientes

A Semantic Framework for the Design of Distributed Reactive Real-Time Languages and Applications
...
Sanabria-Ardila, Mateo | 2020

The proliferation of on-demand internet services delivered over a network of a heterogeneous set of computing devices has created the need for high-performing dynamic systems in real-time. Services such as audio and video streaming, self-driving cars, the Internet of things (IoT), or instant communication on social networks have forced system designers to ethink the architectures and tools for implementing computer systems. Reactive programming has been advocated as a programming paradigm suitable for implementing dynamic applications with complex and heterogeneous architectural needs. However, there is no consensus on the core set of features that a reactive framework must-have. Furthermore, the current set of features proposed in reactive tools seems very restricted to cope with the actual needs for concurrency and distribution in modern systems. In this paper, several alternative semantics for distributed reactive languages are investigated, addressing complex open issues such as glitch avoidance, explicit distribution support, and constructs for explicit time management. First, we propose a reactive event-based programming language with explicit support for distribution, concurrency, and explicit time manipulation (ReactiveXD). Second, we present a reactive event-based semantic framework called Distributed Reactive Rewriting Framework (DRRF). The framework uses rewriting logic to model the components of a distributed base application, observables, and observers, and predicates supporting explicit time manipulation. Finally, to validate the proposal, the paper discusses the specification of the semantics of ReactiveXD and a scenario describing a case of intrusion detection on IoT networks

LEER
Una semántica ejecutable en lógica de reescritura para programación espacial concurrente por restricciones (SCCP)
...
Romero González, Miguel Ángel | 2017

This document presents an executable semantics in rewrite logic for Concurrent Spatial Constraint Programming, abbreviated SCCP. SCCP is a computational model used to reason about spatial information and knowledge distributed among the processes of a system. In SCCP, the processes simulate common knowledge statement and global information query, in turn, each agent in SCCP has its own information space, and epistemic entities such as knowledge or beliefs are represented in a system of parametric constraints. The executable semantics of SCCP is made available to users and programmers through a tool that integrates a programming language and specification into Maude. From this tool, in addition to simulating programs in this language, it is also possible to verify properties specified in temporal linear logic.

LEER
Synchronous set relations in rewriting logic
...
Muñoz, César | 2014

This paper presents a mathematical foundation and a rewriting logic infrastructure for the execution and property verification of synchronous set relations. The mathematical foundation is given in the language of abstract set relations. The infrastructure, which is written in the Maude system, enables the synchronous execution of a set relation provided by the user. By using the infrastructure, algorithm verification techniques such as reachability analysis and model checking, already available in Maude for traditional asynchronous rewriting, are automatically available to synchronous set rewriting. In this way, set-based synchronous languages and systems such as those built from agents, components, or objects can be naturally specified and simulated, and are also amenable to formal verification in the Maude system. The use of the infrastructure and some of its Maude-based verification capabilities are illustrated with an executable operational semantics of the Plan Execution Interchange Language (PLEXIL), a synchronous language developed by NASA to support autonomous spacecraft operations.

LEER
Tool Interoperability in the Maude Formal Environment
...
Durán, Francisco | 2011

We present the Maude Formal Environment (MFE), an executable formal specification in Maude within which a user can seamlessly interact with the Maude Termination Tool, the Maude Sufficient Completeness Checker, the Church-Rosser Checker, the Coherence Checker, and the Maude Inductive Theorem Prover. We explain the high-level design decisions behind MFE, give a summarized account of its main features, and illustrate with an example the interoperation of the tools available in its current release.

LEER

‹›

Repositorio Digital

Listar por tema "Maude"

A Semantic Framework for the Design of Distributed Reactive Real-Time Languages and Applications

Una semántica ejecutable en lógica de reescritura para programación espacial concurrente por restricciones (SCCP)

Synchronous set relations in rewriting logic

Tool Interoperability in the Maude Formal Environment

Envíos recientes

A Semantic Framework for the Design of Distributed Reactive Real-Time Languages and Applications

Una semántica ejecutable en lógica de reescritura para programación espacial concurrente por restricciones (SCCP)

Synchronous set relations in rewriting logic

Tool Interoperability in the Maude Formal Environment

Listar por tema "Maude"

A Semantic Framework for the Design of Distributed Reactive Real-Time Languages and Applications ﻿

Una semántica ejecutable en lógica de reescritura para programación espacial concurrente por restricciones (SCCP) ﻿

Synchronous set relations in rewriting logic ﻿

Tool Interoperability in the Maude Formal Environment ﻿

Envíos recientes

A Semantic Framework for the Design of Distributed Reactive Real-Time Languages and Applications

Una semántica ejecutable en lógica de reescritura para programación espacial concurrente por restricciones (SCCP)

Synchronous set relations in rewriting logic

Tool Interoperability in the Maude Formal Environment

A Semantic Framework for the Design of Distributed Reactive Real-Time Languages and Applications

Una semántica ejecutable en lógica de reescritura para programación espacial concurrente por restricciones (SCCP)

Synchronous set relations in rewriting logic

Tool Interoperability in the Maude Formal Environment