ConSIT: A conditioned program slicer

Conditioned slicing is a powerful generalisation of static and dynamic slicing which has applications to many problems in software maintenance and evolution, including reuse, reengineering and program comprehension. However there has been relatively little work on the implementation of conditioned slicing. Algorithms for implementing conditioned slicing necessarily involve reasoning about the values of program predicates in certain sets of states derived from the conditioned slicing criterion, making implementation particularly demanding. The paper introduces ConSIT, a conditioned slicing system which is based upon conventional static slicing, symbolic execution and theorem proving. ConSIT is the first fully automated implementation of conditioned slicing. An implementation of ConSIT is available for experimentation at &http://www.mcs.gold.ac.uk/tilde/~mas01sd/consit.htm

Program simplification as a means of approximating undecidable propositions

We describe an approach which mixes testing, slicing, transformation and formal verification to investigate speculative hypotheses concerning a program, formulated during program comprehension activity. Our philosophy is that such hypotheses (which are typically undecidable) can, in some sense, be `answered' by a partly automated system which returns neither `true' nor `false' but a program (the `test program') which computes the answer. The motivation for this philosophy is the way in which, as we demonstrate, static analysis and manipulation technology can be applied to ensure that the resulting test program is significantly simpler than the original program, thereby simplifying the process of investigating the original hypothesi

Multi-filter transit observations of WASP-39b and WASP-43b with three San Pedro M\'artir telescopes

Three optical telescopes located at the San Pedro M\'artir National Observatory were used for the first time to obtain multi-filter defocused photometry of the transiting extrasolar planets WASP-39b and WASP-43b. We observed WASP-39b with the 2.12m telescope in the U filter for the first time, and additional observations were carried out in the R and I filters using the 0.84m telescope. WASP-43b was observed in VRI with the same instrument, and in the i filter with the robotic 1.50m telescope. We reduced the data using different pipelines and performed aperture photometry with the help of custom routines, in order to obtain the light curves. The fit of the light curves (1.5--2.5mmag rms), and of the period analysis, allowed a revision of the orbital and physical parameters, revealing for WASP-39b a period ($4.0552947 \pm 9.65 \times 10^{-7}$ days) which is $3.084 \pm 0.774$ seconds larger than previously reported. Moreover, we find for WASP-43b a planet/star radius ($0.1738 \pm 0.0033$) which is $0.01637 \pm 0.00371$ larger in the i filter with respect to previous works, and that should be confirmed with additional observations. Finally, we confirm no evidence of constant period variations in WASP-43b.Comment: 13 pages, 7 figures, accepted in PASP, scheduled for the February 1, 2015 issu

Human acclimation and acclimatization to heat: A compendium of research, 1968-1978

Abstracts and annotations of the majority of scientific works that elucidate the mechanisms of short-term acclimation to heat in men and women are presented. The compendium includes material from 1968 through 1977. Subject and author indexes are provided and additional references of preliminary research findings or work of a peripheral nature are included in a bibliography

Pre/post conditioned slicing

Th paper shows how analysis of programs in terms of pre- and postconditions can be improved using a generalisation of conditioned program slicing called pre/post conditioned slicing. Such conditions play an important role in program comprehension, reuse, verification and reengineering. Fully automated analysis is impossible because of the inherent undecidability of pre- and post- conditions. The method presented reformulates the problem to circumvent this. The reformulation is constructed so that programs which respect the pre- and post-conditions applied to them have empty slices. For those which do not respect the conditions, the slice contains statements which could potentially break the conditions. This separates the automatable part of the analysis from the human analysis

Using fNIRS to study working memory of infants in rural Africa

A pilot study was conducted to assess the feasibility of using fNIRS as an alternative to behavioral assessments of cognitive development with infants in rural Africa. We report preliminary results of a study looking at working memory in 12–16-month-olds and discuss the benefits and shortcomings for the potential future use of fNIRS to investigate the effects of nutritional insults and interventions in global health studies

VADA: A transformation-based system for variable dependence analysis

Variable dependence is an analysis problem in which the aim is to determine the set of input variables that can affect the values stored in a chosen set of intermediate program variables. This paper shows the relationship between the variable dependence analysis problem and slicing and describes VADA, a system that implements variable dependence analysis. In order to cover the full range of C constructs and features, a transformation to a core language is employed Thus, the full analysis is required only for the core language, which is relatively simple. This reduces the overall effort required for dependency analysis. The transformations used need preserve only the variable dependence relation, and therefore need not be meaning preserving in the traditional sense. The paper describes how this relaxed meaning further simplifies the transformation phase of the approach. Finally, the results of an empirical study into the performance of the system are presented