Lazy Composition of Representations in Java - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Lazy Composition of Representations in Java

(1) , (2) , (3)
1
2
3

Abstract

Abstract. The separation of concerns has been a core idiom of software engineering for decades. In general, software can be decomposed properly only according to a single concern, other concerns crosscut the prevailing one. This problem is well known as “the tyranny of the dominant decomposition”. Similarly, at the programming level, the choice of a representation drives the implementation of the algorithms. This article explores an alternative approach with no dominant representation. Instead, each algorithm is developed in its “natural” representation and a representation is converted into another one only when it is required. To support this approach, we designed a laziness framework for Java, that performs partial conversions and dynamic optimizations while preserving the execution soundness. Performance evaluations over graph theory examples demonstrates this approach provides a practicable alternative to a naive one.
Fichier principal
Vignette du fichier
douence-al-sc09.pdf (230.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00403417 , version 1 (10-07-2009)

Identifiers

  • HAL Id : inria-00403417 , version 1

Cite

Rémi Douence, Xavier Lorca, Nicolas Loriant. Lazy Composition of Representations in Java. SC'09 - International Conference on Software Composition, Jul 2009, Lille, France. pp.55-71. ⟨inria-00403417⟩
295 View
174 Download

Share

Gmail Facebook Twitter LinkedIn More