We propose a framework for compiling and executing arbitrary depth algorithmic skeleton nesting. It consists of translation rules (schemes) to be used at compile-time for the static-analysis of the source program and at run-time to execute nested skeletons in parallel. We report results for deeply nested programs for diierent platforms.

TouchDevelop is a novel programming environment and language for mobile devices. TouchDevelop applications are typically developed by non-expert users, rather small, and published on the cloud. In this paper, we introduce TouchCost, a new static analysis that infers the cost of loops in TouchDevelop programs. TouchCost (i) applies an existing generic analyzer to infer numerical invariants, (ii)...

Data dependences are building blocks for techniques such as program slicing and, thus, are useful for program comprehension and debugging. Unfortunately, static analysis identifies many data dependences that are infeasible or unlikely to occur at runtime. Dynamic analysis, in contrast, does not identify all data dependences that can occur in a program. To address this inaccuracy, we present a n...

Self-modifying codes (SMC) refer to programs that intentionally modify themselves at runtime, causing the runtime code to differ from the static binary representation of the code before execution. Hence SMC is an effective method to obstruct software disassembling. This paper presents a method which circumvents the SMC protection, thus improving the performance of disassembling. By disabling th...

We investigate the hole and lattice dynamics in a prototypical high-temperature superconducting system La2−xSrxCuO4 using infrared spectroscopy. By exploring the anisotropy in the electronic response of CuO2 planes we show that our results support the notion of stripes. Nevertheless, charge ordering effects are not apparent in the phonon spectra. All crystals show only the expected infrared act...

When writing a program, the programmers may wish to verify certain properties of this program. For example, will my variable X always be an integer? To answer these questions we use program analysis. Constraint-based program analysis is a form of static program analysis. This means that all of these questions about the program’s run-time behavior are answered at compile time. This paper seeks t...

The number of Android malware has increased greatly during the last few years. Static analysis is widely used in detecting such malware by analyzing the code without execution. However, the effectiveness of current tools depends on the app model as well as the malware detection algorithm that analyzes the app model. If the model and/or the algorithm is inadequate, then sophisticated attacks tha...

We present results from numerical lattice calculations of SU(4) Yang-Mills theory. This work has two goals: to determine the order of the finite temperature deconfinement transition on an Nt = 6 lattice and to study the string tensions between static charges in the irreducible representations of SU(4). Motivated by Pisarski and Tytgat’s argument that a second-order SU(∞) deconfinement transitio...

For enterprise-wide and cross-enterprise workflow (WF) applications, the load of the WF servers and the amount of communication in the subnets may become a bottleneck. This paper shows how a distributed WF control can be realized in a way that the load of the components at run time is minimized. For that purpose, the control of a WF instance may migrate from one WF server to another. The WF ser...

In order to overcome some of the inherent pessimism of traditional static analysis, we propose a method for parametric WCET analysis expressing the WorstCase Execution Time (WCET) of a program as an expression in terms of the input data of a program. Besides giving more information about the execution time behaviour of the program, this also has benefits in component based development where reu...