Transactional Memory in a Dynamic Language

Concurrency control is mostly based on locks and is therefore notoriously difficult to use. Even though some programming languages provide high-level constructs, these add complexity and potentially hard-to-detect bugs to the application. Transactional memory is an attractive mechanism that does not have the drawbacks of locks, however the underlying implementation is often difficult to integrate into an existing language. In this paper we show how we have introduced transactional semantics into Smalltalk by using the reflective facilities of the language. Our approach is based on method annotations, incremental parse tree transformations and an optimistic commit protocol. The implementation does not depend on modifications to the virtual machine and therefore can be changed at the language level. We report on a practical case study, benchmarks and further and on-going work.

Embedding Spatial Software Visualization in the IDE: an Exploratory Study

Software visualization can be of great use for understanding and exploring a software system in an intuitive manner. Spatial representation of software is a promising approach of increasing interest. However, little is known about how developers interact with spatial visualizations that are embedded in the IDE. In this paper, we present a pilot study that explores the use of Software Cartography for program comprehension of an unknown system. We investigated whether developers establish a spatial memory of the system, whether clustering by topic offers a sound base layout, and how developers interact with maps. We report our results in the form of observations, hypotheses, and implications. Key findings are a) that developers made good use of the map to inspect search results and call graphs, and b) that developers found the base layout surprising and often confusing. We conclude with concrete advice for the design of embedded software maps

Structural aspects of redox-mediated electron tunneling (Dedicated to the memory of professor Alexander M. Kuznetsov)

We investigated structural aspects of electron transfer (ET) in tunneling junctions (Au(1 1 1)vertical bar FcN vertical bar solution gap vertical bar Au STM tip) with four different redox-active N-thioalk(ano)ylferrocenes (FcN) embedded. The investigated molecules consist of a redox-active ferrocene (Fc) moiety connected via alkyl spacers with N = 4, 6, 8 and 11 carbon atoms to a thiol anchoring group. We found that for short FcNs (N = 4, 6,8) the redox-mediated ET response increases with the increase of the alkyl chain length, while no enhancement of the ET was observed for Fc1 1. The model of two-step ET with partial vibrational relaxation by Kuznetsov and Ulstrup was used to rationalize these results. The theoretical ET steps were assigned to two processes: (1) electron tunneling from the Fc group to the Au tip through the electrolyte layer and (2) electron transport from the Au(1 1 1) substrate to the Fc group through the organic adlayer. We argue that for the three short FcNs, the first process represents the rate-limiting step. The increase of the length of the alkyl chain leads to an approach of the Fc group to the STM tip, and consequently accelerates the first El' step. In case of the Fcl 1 junctions the rather high thickness of the organic layer leads to a decrease of the rate of the second ET step. In consequence, the contribution of the redox-mediated current enhancement to the total tunneling current appears to be insignificant. Our work demonstrates the importance of combined structural and transport approaches for the understanding of Er processes in electrochemical nanosystems. (C) 2010 Elsevier B.V. All rights reserved.

Pangea: A Workbench for Statically Analyzing Multi-Language Software Corpora

Software corpora facilitate reproducibility of analyses, however, static analysis for an entire corpus still requires considerable effort, often duplicated unnecessarily by multiple users. Moreover, most corpora are designed for single languages increasing the effort for cross-language analysis. To address these aspects we propose Pangea, an infrastructure allowing fast development of static analyses on multi-language corpora. Pangea uses language-independent meta-models stored as object model snapshots that can be directly loaded into memory and queried without any parsing overhead. To reduce the effort of performing static analyses, Pangea provides out-of-the box support for: creating and refining analyses in a dedicated environment, deploying an analysis on an entire corpus, using a runner that supports parallel execution, and exporting results in various formats. In this tool demonstration we introduce Pangea and provide several usage scenarios that illustrate how it reduces the cost of analysis.