Many-core compiler fuzzing

We address the compiler correctness problem for many-core systems through novel applications of fuzz testing to OpenCL compilers. Focusing on two methods from prior work, random differential testing and testing via equivalence modulo inputs (EMI), we present several strategies for random generation of deterministic, communicating OpenCL kernels, and an injection mechanism that allows EMI testing to be applied to kernels that otherwise exhibit little or no dynamically-dead code. We use these methods to conduct a large, controlled testing campaign with respect to 21 OpenCL (device, compiler) configurations, covering a range of CPU, GPU, accelerator, FPGA and emulator implementations. Our study provides independent validation of claims in prior work related to the effectiveness of random differential testing and EMI testing, proposes novel methods for lifting these techniques to the many-core setting and reveals a significant number of OpenCL compiler bugs in commercial implementations

A Computational Interpretation of Context-Free Expressions

We phrase parsing with context-free expressions as a type inhabitation problem where values are parse trees and types are context-free expressions. We first show how containment among context-free and regular expressions can be reduced to a reachability problem by using a canonical representation of states. The proofs-as-programs principle yields a computational interpretation of the reachability problem in terms of a coercion that transforms the parse tree for a context-free expression into a parse tree for a regular expression. It also yields a partial coercion from regular parse trees to context-free ones. The partial coercion from the trivial language of all words to a context-free expression corresponds to a predictive parser for the expression

Construct, Merge, Solve and Adapt: Application to the repetition-free longest common subsequence problem

In this paper we present the application of a recently proposed, general, algorithm for combinatorial optimization to the repetition-free longest common subsequence problem. The applied algorithm, which is labelled Construct, Merge, Solve & Adapt, generates sub-instances based on merging the solution components found in randomly constructed solutions. These sub-instances are subsequently solved by means of an exact solver. Moreover, the considered sub-instances are dynamically changing due to adding new solution components at each iteration, and removing existing solution components on the basis of indicators about their usefulness. The results of applying this algorithm to the repetition-free longest common subsequence problem show that the algorithm generally outperforms competing approaches from the literature. Moreover, they show that the algorithm is competitive with CPLEX for small and medium size problem instances, whereas it outperforms CPLEX for larger problem instances.Peer ReviewedPostprint (author's final draft

Luminescence quenching of the triplet excimer state by air traces in gaseous argon

While developing a liquid argon detector for dark matter searches we investigate the influence of air contamination on the VUV scintillation yield in gaseous argon at atmospheric pressure. We determine with a radioactive alpha-source the photon yield for various partial air pressures and different reflectors and wavelength shifters. We find for the fast scintillation component a time constant tau1= 11.3 +- 2.8 ns, independent of gas purity. However, the decay time of the slow component depends on gas purity and is a good indicator for the total VUV light yield. This dependence is attributed to impurities destroying the long-lived argon excimer states. The population ratio between the slowly and the fast decaying excimer states is determined for alpha-particles to be 5.5 +-0.6 in argon gas at 1100 mbar and room temperature. The measured mean life of the slow component is tau2 = 3.140 +- 0.067 microsec at a partial air pressure of 2 x 10-6 mbar.Comment: 7 pages submitted to NIM

Graph-Based Shape Analysis Beyond Context-Freeness

We develop a shape analysis for reasoning about relational properties of data structures. Both the concrete and the abstract domain are represented by hypergraphs. The analysis is parameterized by user-supplied indexed graph grammars to guide concretization and abstraction. This novel extension of context-free graph grammars is powerful enough to model complex data structures such as balanced binary trees with parent pointers, while preserving most desirable properties of context-free graph grammars. One strength of our analysis is that no artifacts apart from grammars are required from the user; it thus offers a high degree of automation. We implemented our analysis and successfully applied it to various programs manipulating AVL trees, (doubly-linked) lists, and combinations of both

A Rule-Based Approach to Analyzing Database Schema Objects with Datalog

Database schema elements such as tables, views, triggers and functions are typically defined with many interrelationships. In order to support database users in understanding a given schema, a rule-based approach for analyzing the respective dependencies is proposed using Datalog expressions. We show that many interesting properties of schema elements can be systematically determined this way. The expressiveness of the proposed analysis is exemplarily shown with the problem of computing induced functional dependencies for derived relations. The propagation of functional dependencies plays an important role in data integration and query optimization but represents an undecidable problem in general. And yet, our rule-based analysis covers all relational operators as well as linear recursive expressions in a systematic way showing the depth of analysis possible by our proposal. The analysis of functional dependencies is well-integrated in a uniform approach to analyzing dependencies between schema elements in general.Comment: Pre-proceedings paper presented at the 27th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2017), Namur, Belgium, 10-12 October 2017 (arXiv:1708.07854

Human behavior in Prisoner's Dilemma experiments suppresses network reciprocity

During the last few years, much research has been devoted to strategic interactions on complex networks. In this context, the Prisoner's Dilemma has become a paradigmatic model, and it has been established that imitative evolutionary dynamics lead to very different outcomes depending on the details of the network. We here report that when one takes into account the real behavior of people observed in the experiments, both at the mean-field level and on utterly different networks the observed level of cooperation is the same. We thus show that when human subjects interact in an heterogeneous mix including cooperators, defectors and moody conditional cooperators, the structure of the population does not promote or inhibit cooperation with respect to a well mixed population.Comment: 5 Pages including 4 figures. Submitted for publicatio

Retinal origins of the temperature-effect on absolute visual sensitivity in frogs

1. The absolute sensitivity of vision was studied as a function of temperature in two species of frog (Rana temporaria, 9-21 degrees C, and Rana pipiens, 13-28 degrees C). 2. Log behavioural threshold (measured as the lowest light intensity by which frogs trying to escape from a dark box were able to direct their jumping) rose near-linearly with warming with a regression coefficient of 1.26 +/- 0.03 log units per 10 degrees C (Q10 = 18). Threshold retinal illumination corresponded to 0.011 photoisomerizations per rod per second (Rh* s-1) at 16.5 degrees C. 3. The effect of dim backgrounds on jumping thresholds suggested 'dark lights' of 0.011 Rh* s-1 at 16.5 degrees C and 0.080 Rh* s-1 at 23.5 degrees C, corresponding to Q10 = 17. 4. Response thresholds of retinal ganglion cells were extracellularly recorded in the isolated eyecup of R. temporaria. The thresholds of the most sensitive cells when stimulated with large-field steps of light were similar to the behavioural threshold and changed with temperature in a similar manner. 5. The decrease in ganglion cell 'step' sensitivity with warming consisted of a decrease in summation time (by a factor of 2-3 between 10 and 20 degrees C) and an increase in the threshold number of photoisomerizations (a decrease in 'flash' sensitivity, by a factor of 2-5 over the same interval). No effect of temperature changes on spatial summation was found. 6. Frequency-of- response functions of ganglion cells indicated an 11-fold increase in noise-equivalent dark light between 10 and 20 degrees C (mean values in four cells 0.009 vs. 0.10 Rh* s-1). 7. The temperature dependence of ganglion cell flash sensitivity could be strongly decreased with dim background illumination. 8. It is concluded that the desensitization of dark-adapted vision with rising temperature is a retinal effect composed of shortened summation time and lowered flash sensitivity (increased numbers of photons required for a threshold response) in ganglion cells. The desensitization bears no simple relation to the apparent retinal noise increase