HASLab - Indexed Articles in Journals

Permanent URI for this collection

http://localhost:4000/handle/123456789/167

Browse

Browsing HASLab - Indexed Articles in Journals by Issue Date

Jump to a point in the index:
  • Item
    Verification Conditions for Source-level Imperative Programs
    ( 2011) Jorge Sousa Pinto ; Maria João Frade
  • Item
    Markov random walk under constraint for discovering overlapping communities in complex networks
    ( 2011) Carlos Baquero ; Bo Yang ; Di Jin ; Jie Liu ; Dongxiao He ; Dayou Liu
  • Item
    Fast Distributed Estimation of Sums and Network Sizes
    ( 2011) Raquel Menezes ; Carlos Baquero ; Paulo Sérgio Almeida
  • Item
    Convergent and Commutative Replicated Data Types
    ( 2011) Nuno Preguiça ; Carlos Baquero ; Marek Zawirski ; Marc Shapiro
  • Item
    Prioritizing Tests for Software Fault Diagnosis
    ( 2011) Arjan J.C. van Gemund ; Alberto Gonzalez-Sanchez ; Éric Piel ; Rui Maranhão ; Hans-Gerhard Gross
  • Item
  • Item
    Safe Controllers Design for Industrial Automation Systems
    ( 2011) Celina Leão ; José Machado ; Eurico Seabra ; José Creissac Campos ; Filomena Soares
    The design of safe industrial controllers is one of the most important domains related to Automation Systems research. To support it, synthesis and analysis techniques are available. Among the analysis techniques, two of the most important are Simulation and Formal Verification. In this paper these two techniques are used together in a complementary way. Understanding plant behaviour is essential for obtaining safe industrial systems controllers; hence, plant modelling is crucial to the success of these techniques. A two step approach is presented: first, the use of Simulation and, second, the use of Formal Verification of Industrial Systems Specifications. The specification and plant models used for each technique are described. Simulation and Formal Verification results are presented and discussed. The approach presented in the paper can be applied to real industrial systems, and obtain safe controllers for hybrid plants. The Modelica modelling language and Dymola simulation environm
  • Item
    Simultaneous Debugging of Software Faults
    ( 2011) Rui Maranhão ; Arjan J.C. van Gemund ; Peter Zoeteweij
  • Item
    A coalgebraic perspective on linear weighted automata
    ( 2012) Filippo Bonchi ; Alexandra Silva ; Jan Rutten ; Michele Boreale ; Marcello Bonsangue
    Weighted automata are a generalisation of non-deterministic automata where each transition, in addition to an input letter, has also a quantity expressing the weight (e.g. cost or probability) of its execution. As for non-deterministic automata, their behaviours can be expressed in terms of either (weighted) bisimilarity or (weighted) language equivalence. Coalgebras provide a categorical framework for the uniform study of state-based systems and their behaviours. In this work, we show that coalgebras can suitably model weighted automata in two different ways: coalgebras on SetSet (the category of sets and functions) characterise weighted bisimilarity, while coalgebras on VectVect (the category of vector spaces and linear maps) characterise weighted language equivalence. Relying on the second characterisation, we show three different procedures for computing weighted language equivalence. The first one consists in a generalisation of the usual partition refinement algorithm for ordi
  • Item
    Significant Motifs in Time Series
    ( 2012) Nuno Constantino Castro ; Paulo Jorge Azevedo
  • Item
    Assertion-based Slicing and Slice Graphs
    ( 2012) Daniela Cruz ; José Bernardo Barros ; Jorge Sousa Pinto ; Pedro Rangel Henriques
    This paper revisits the idea of slicing programs based on their axiomatic semantics, rather than using criteria based on control/data dependencies. We show how the forward propagation of preconditions and the backward propagation of post conditions can be combined in a new slicing algorithm that is more precise than the existing specification-based algorithms. The algorithm is based on (i) a precise test for removable statements, and (ii) the construction of a slice graph, a program control flow graph extended with semantic labels. It improves on previous approaches in two aspects: it does not fail to identify removable commands; and it produces the smallest possible slice that can be obtained (in a sense that will be made precise). The paper also reviews in detail, through examples, the ideas behind the use of preconditions and post conditions for slicing programs.
  • Item
    Programming from Galois connections
    ( 2012) José Nuno Oliveira ; Shin-Cheng Mu
  • Item
    A literature review about usability evaluation methods for e-learning platforms
    ( 2012) NomeLuciana Lopes Freire ; José Creissac Campos ; Pedro Miguel Arezes
    The usability analysis of information systems has been the target of several research studies over the past thirty years. These studies have highlighted a great diversity of points of view, including researchers from different scientific areas such as Ergonomics, Computer Science, Design and Education. Within the domain of information ergonomics, the study of tools and methods used for usability evaluation dedicated to E-learning presents evidence that there is a continuous and dynamic evolution of E-learning systems, in many different contexts -academics and corporative. These systems, also known as LMS (Learning Management Systems), can be classified according to their educational goals and their technological features. However, in these systems the usability issues are related with the relationship/interactions between user and system in the user's context. This review is a synthesis of research project about Information Ergonomics and embraces three dimensions, namely the methods,
  • Item
    WIKI::SCORE - A collaborative environment for music transcription and publishing
    ( 2012) José Nuno Oliveira ; José João Almeida ; Nuno Ramos Carvalho
    Music sources are most commonly shared in music scores scanned or printed on paper sheets. These artifacts are rich in information, but since they are images it is hard to re-use and share their content in todays' digital world. There are modern languages that can be used to transcribe music sheets, this is still a time consuming task, because of the complexity involved in the process and the typical huge size of the original documents. WIKI::SCORE is a collaborative environment where several people work together to transcribe music sheets to a shared medium, using the notation. This eases the process of transcribing huge documents, and stores the document in a well known notation, that can be used later on to publish the whole content in several formats, such as a PDF document, images or audio files for example.
  • Item
    Optimal leverage association rules with numerical interval conditions
    ( 2012) Alípio Jorge ; Paulo Jorge Azevedo
  • Item
    Towards a Linear Algebra of Programming
    ( 2012) José Nuno Oliveira
  • Item
    GUIsurfer: A Reverse Engineering Framework for User Interface Software
    ( 2012) João Alexandre Saraiva ; José Creissac Campos ; João Carlos Silva ; Carlos Silva
    In the context of developing tool support to the automated analysis of interactive systems implementations, this chapter proposal aims to investigate the applicability of reverse engineering approaches to the derivation of user interfaces behavioural models. The ultimate goal is that these models might be used to reason about the quality of the system, both from an usability and an implementation perspective, as well as being used to help systems maintenance, evolution and redesign.
  • Item
    A Calculus for Generic, QoS-Aware Component Composition
    ( 2012) Luís Soares Barbosa ; Sun Meng
    Software QoS properties, such as response time, availability, bandwidth requirement, memory usage, among many others, play a major role in the processes of selecting and composing software components. This paper extends a component calculus to deal, in an effective way, with them. The calculus models components as gener- alised Mealy machines, i.e., state-based entities interacting along their life time through well defined interfaces of observers and actions. QoS is introduced through an algebraic structure specifying the relevant QoS domain and how its values are composed under different disciplines. A major effect of introducing QoS-awareness is that a number of equivalences holding in the plain calculus become refinement laws. The paper also introduces a prototyper for the calculus developed as a 'proof-of-concept' implementation
  • Item
    AI for the Win: Improving Spectrum-based Fault Localization
    ( 2012) Birgit Hofer ; Franz Wotawa ; Rui Maranhão
    A considerable amount of time in software engineering is spent in debugging. In practice, mainly debugging tools which allow for executing a program step-by-step and setting break points are used. This debugging method is however very time consuming and cumbersome. There is a need for tools which undertake the task of narrowing down the most likely fault locations. These tools must complete this task with as little user interaction as possible and the results computed must be beneficial so that such tools appeal to programmers. In order to come up with such tools, we present three variants of the well-known spectrum-based fault localization technique that are enhanced by using methods from Artificial Intelligence. Each of the three combined approaches outperforms the underlying basic method concerning diagnostic accuracy. Hence, the presented approaches support the hypothesis that combining techniques from different areas is beneficial. In addition to the introduction of these techniq
  • Item
    Shortcut Fusion Rules for the Derivation of Circular and Higher-order Programs
    ( 2012) João Alexandre Saraiva ; João Paulo Fernandes ; Alberto Pardo
    Functional programs often combine separate parts using interme- diate data structures for communicating results. These programs are modular, easier to understand and maintain, but suffer from in- efficiencies due to the generation of those gluing data structures. To eliminate such redundant data structures, some program trans- formation techniques have been proposed. One such technique is shortcut fusion, and has been studied in the context of both pure and monadic functional programs. Recently, we have extended standard shortcut fusion: in addition to intermediate structures, the program parts may now communi- cate context information, and it still is possible to eliminate those structures. This is achieved by transforming the original function composition into a circular program. This new technique, however, has been studied in the context of purely functional programs only. In this paper, we propose an extension to this new form of fusion, but in the context of monadic programming: