Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
Publications

Publications by HASLab

2000

Semantically reliable multicast protocols

Authors
Pereira, J; Rodrigues, L; Oliveira, R;

Publication
19TH IEEE SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS - PROCEEDINGS

Abstract
Reliable multicast protocols can strongly simplify the design of distributed applications. However it is hard to sustain a high multicast throughput when groups are large and heterogeneous. In an attempt to overcome this limitation, previous work has focused on weakening reliability properties. In this paper we introduce a novel reliability model that exploits semantic knowledge to decide in which specific conditions messages can be purged without compromising application correctness. This model is based on the concept of message obsolescence: A message becomes obsolete when its content or purpose is overwritten by a subsequent message. We show that message obsolescence can be expressed in a generic way and can be used to configure the system to achieve higher multicast throughput.

2000

Sequential and concurrent abstract machines for interaction nets

Authors
Pinto, JS;

Publication
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES

Abstract
This paper is a formal study of how to implement interaction nets, filling an important gap in the work on this graphical rewriting formalism, very promising for the implementation of languages based on the gimel -calculus. We propose the first abstract machine for interaction net reduction, based on a decomposition of interaction rules into more atomic steps, which tackles all the implementation details hidden in the graphical presentation. As a natural extension of this, we then give a concurrent shared-memory abstract machine, and show how to implement it, resulting in the first parallel implementation of interaction nets.

2000

Panasync: dependency tracking among file copies

Authors
Almeida, PS; Baquero, C; Fonte, V;

Publication
Proceedings of the ACM SIGOPS European Workshop, Kolding, Denmark, September 17-20, 2000

Abstract

2000

Functional incremental attribute evaluation

Authors
Saraiva, J; Swierstra, D; Kuiper, M;

Publication
COMPILER CONSTRUCTION, PROCEEDINGS

Abstract
This paper presents a new strict, purely functional implementation of attribute grammars. Incremental evaluation is obtained via standard function memoization. Our new implementation of attribute grammars increases the incremental behaviour of the evaluators by both reducing the memoization overhead and increasing their potential incrementallity. We present also an attribute grammar transformation, which increases the incremental performance of the attribute evaluators after a change that propagates its effects to all parts of the syntax tree. These techniques have been implemented in a purely functional attribute grammar system and the first experimental results are presented.

2000

Representational Reasoning and Verification

Authors
Doherty, GJ; Campos, JC; Harrison, MD;

Publication
Formal Aspects Comput.

Abstract
Formal approaches to the design of interactive systems rely on reasoning about properties of the system at a very high level of abstraction. Specifications to support such an approach typically provide little scope for reasoning about presentations and the representation of information in the presentation. In contrast, psychological theories such as distributed cognition place a strong emphasis on the role of representations, and their perception by the user, in the cognitive process. However, the post-hoc techniques for the observation and analysis of existing systems which have developed out of the theory do not help us in addressing such issues at the design stage. Mn this paper we show how a formalisation can be used to investigate the representational aspects of an interface. Our goal is to provide a framework to help identify and resolve potential problems with the representation of information, and to support understanding of representational issues in design. We present a model for linking properties at the abstract and perceptual levels, and illustrate its use in a case study of a flight deck instrument. There is a widespread consensus that proper tool support is a prerequisite for the adoption of formal techniques, but the use of such tools can have a profound effect on the process itself. In order to explore this issue, we apply a higher-order logic theorem prover to the analysis.

2000

The cash-point (ATM) 'problem'

Authors
Denvir, T; Oliveira, J; Plat, N;

Publication
Formal Aspects of Computing

Abstract
This paper provides a description and summary of the solutions submitted to a competition in formal specification, which was held during FM'99 in Toulouse, September 1999.

  • 254
  • 262