Publications

Publications by HASLab

2011

Convergent and Commutative Replicated Data Types

Authors
Shapiro, M; Preguiça, NM; Baquero, C; Zawirski, M;

Publication
Bulletin of the EATCS

Abstract

2011

Preface

Authors
Fernandes, JM; Lämmel, R; Saraiva, J; Visser, J;

Publication
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract

2011

Generative and Transformational Techniques in Software Engineering III - International Summer School, GTTSE 2009, Braga, Portugal, July 6-11, 2009. Revised Papers

Authors
Fernandes, JM; Lämmel, R; Visser, J; Saraiva, J;

Publication
GTTSE

Abstract

2011

End-users productivity in model-based spreadsheets: An empirical study

Authors
Beckwith, L; Cunha, J; Fernandes, JP; Saraiva, J;

Publication
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract
Spreadsheets are widely used and studies show that most of the existing ones contain non-trivial errors. To improve end-users productivity, recent research proposes the use of a model-driven engineering approach to spreadsheets. In this paper we conduct the first empirical study to assess the effectiveness and efficiency of this approach. A set of spreadsheet end users worked with two different model-based spreadsheets. We present and analyze here the results achieved. © 2011 Springer-Verlag.

CloseRead Abstract

2011

Shortcut fusion rules for the derivation of circular and higher-order programs

Authors
Pardo, A; Fernandes, JP; Saraiva, J;

Publication
Higher-Order and Symbolic Computation

Abstract
Functional programs often combine separate parts using intermediate data structures for communicating results. Programs so defined are modular, easier to understand and maintain, but suffer from inefficiencies due to the generation of those gluing data structures. To eliminate such redundant data structures, some program transformation techniques have been proposed. One such technique is shortcut fusion, and has been studied in the context of both pure and monadic functional programs. In this paper, we study several shortcut fusion extensions, so that, alternatively, circular or higher-order programs are derived. These extensions are also provided for effect-free programs and monadic ones. Our work results in a set of generic calculation rules, that are widely applicable, and whose correctness is formally established. © 2011 Springer Science+Business Media, LLC.

CloseRead Abstract

2011

Strictification of circular programs

Authors
Fernandes, JP; Saraiva, J; Seidel, D; Voigtlander, J;

Publication
PERM'11 - Proceedings of the 20th ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation

Abstract
Circular functional programs (necessarily evaluated lazily) have been used as algorithmic tools, as attribute grammar implementations, and as target for program transformation techniques. Classically, Richard Bird [1984] showed how to transform certain multi-traversal programs (which could be evaluated strictly or lazily) into one-traversal ones using circular bindings. Can we go the other way, even for programs that are not in the image of his technique? That is the question we pursue in this paper. We develop an approach that on the one hand lets us deal with typical examples corresponding to attribute grammars, but on the other hand also helps to derive new algorithms for problems not previously in reach. © 2011 ACM.

CloseRead Abstract