Encontrados 26 documentos, a visualizar página 1 de 3

Ordenado por Data

Implementing QVT-R bidirectional model transformations using alloy

Macedo, Nuno; Cunha, Alcino

QVT Relations (QVT-R) is the standard language proposed by the OMG to specify bidirectional model transformations. Unfortunately, in part due to ambiguities and omissions in the original semantics, acceptance and development of effective tool support has been slow. Recently, the checking semantics of QVT-R has been clarified and formalized. In this paper we propose a QVT-R tool that complies to such semantics. ...


Delta lenses over inductive types

Pacheco, Hugo; Cunha, Alcino; Hu, Zhenjiang

Existing bidirectional languages are either state-based or operation-based, depending on whether they represent updates as mere states or as sequences of edit operations.In-between both worlds are delta-based frameworks, where updates are represented using alignment relationships between states.In this paper, we formalize delta lenses over inductive types using dependent type theory and develop a point-free del...


Relations as executable specifications : taming partiality and non-determinism ...

Macedo, Nuno; Pacheco, Hugo; Cunha, Alcino

Comunicação publicada em "Lecture Notes in Computer Science", vol. 7560 (2012), pag. 146-161 ; The calculus of relations has been widely used in program specification and reasoning. It is very tempting to use such specifications as running prototypes of the desired program, but, even considering finite domains, the inherent partiality and non-determinism of relations makes this impractical and highly ineffici...


Fast distributed computation of distances in networks

Almeida, Paulo Sérgio; Baquero, Carlos; Cunha, Alcino

Comunicação publicada em "IEEE Conference on Decision & Control (CDC)", pag. 5215-5220 ; This paper presents a distributed algorithm to simultaneously compute the diameter, radius and node eccentricity in all nodes of a synchronous network. Such topological information may be useful as input to configure other algorithms. Previous approaches have been modular, progressing in sequential phases using building bl...


Multifocal : a strategic bidirectional transformation language for XML schemas

Pacheco, Hugo; Cunha, Alcino

Lenses are one of the most popular approaches to define bidirectional transformations between data models. However, writing a lens transformation typically implies describing the concrete steps that convert values in a source schema to values in a target schema. In contrast, many XML-based languages allow writing structure-shy programs that manipulate only specific parts of XML documents without having to speci...


Specifying UML protocol state machines in Alloy

Garis, Ana; Paiva, Ana; Cunha, Alcino; Riesco, Daniel

A UML Protocol State Machine (PSM) is a behavioral diagram for the specification of the external behavior of a class, interface or component. PSMs have been used in the software development process for different purposes, such as requirements analysis and testing. However, like other UML diagrams, they are often difficult to validate and verify, specially when combined with other artifacts, such as Object Const...


Using term rewriting to solve bit-vector arithmetic problems - (Poster Presenta...

Abal, Iago; Cunha, Alcino; Hurd, Joe; Pinto, Jorge Sousa

Among many theories supported by SMT solvers, the theory of finite-precision bit-vector arithmetic is one of the most useful, for both hardware and software systems verification. This theory is also particularly useful for some specific domains such as cryptography, in which algorithms are naturally expressed in terms of bit-vectors. Cryptol is an example of a domain-specific language (DSL) and toolset for cryp...


Using term rewriting to solve Bit-Vector arithmetic problems (Poster Presentation)

Abal, Iago; Cunha, Alcino; Hurd, Joe; Pinto, Jorge Sousa

Among many theories supported by SMT solvers, the theory of finite-precision bit-vector arithmetic is one of the most useful, for both hardware and software systems verification. This theory is also particularly useful for some specific domains such as cryptography, in which algorithms are naturally expressed in terms of bit-vectors. Cryptol is an example of a domain-specific language (DSL) and toolset for cryp...


Transformation of structure-shy programs with application to XPath queries and ...

Cunha, Alcino; Visser, J.

Various programming languages allow the construction of structure-shy programs. Such programs are defined generically for many different datatypes and only specify specific behavior for a few relevant subtypes. Typical examples are XML query languages that allow selection of subdocuments without exhaustively specifying intermediate element tags. Other examples are languages and libraries for polytypic or strate...


Algebraic specialization of generic functions for recursive types

Cunha, Alcino; Pacheco, Hugo

Defining functions over large, possibly recursive, data structures usually involves a lot of boilerplate. This code simply traverses non-interesting parts of the data, and rapidly becomes a maintainability problem. Many generic programming libraries have been proposed to address this issue. Most of them allow the user to specify the behavior just for the interesting bits of the structure, and provide traversal ...


26 Resultados

Texto Pesquisado

Refinar resultados

Autor











Data










Tipo de Documento






Recurso



Assunto















    Financiadores do RCAAP

Fundação para a Ciência e a Tecnologia Universidade do Minho   Governo Português Ministério da Educação e Ciência Programa Operacional da Sociedade do Conhecimento União Europeia