Ranking Templates for Linear Loops

We present a new method for the constraint-based synthesis of termination arguments for linear loop programs based on linear ranking templates. Linear ranking templates are parametrized, well-founded relations such that an assignment to the parameters gives rise to a ranking function. This approach generalizes existing methods and enables us to use templates for many different ranking functions with affine-linear components. We discuss templates for multiphase, piecewise, and lexicographic ranking functions. Because these ranking templates require both strict and non-strict inequalities, we use Motzkin's Transposition Theorem instead of Farkas Lemma to transform the generated $\exists\forall$-constraint into an $\exists$-constraint.Comment: TACAS 201

Proving Termination Starting from the End

We present a novel technique for proving program termination which introduces a new dimension of modularity. Existing techniques use the program to incrementally construct a termination proof. While the proof keeps changing, the program remains the same. Our technique goes a step further. We show how to use the current partial proof to partition the transition relation into those behaviors known to be terminating from the current proof, and those whose status (terminating or not) is not known yet. This partition enables a new and unexplored dimension of incremental reasoning on the program side. In addition, we show that our approach naturally applies to conditional termination which searches for a precondition ensuring termination. We further report on a prototype implementation that advances the state-of-the-art on the grounds of termination and conditional termination.Comment: 16 page

Gamma ray and neutron radiation effects on the electrical and structural properties of n-ZnO/p-CuGaO2 schottky diode

This research focuses on the radiation tolerance of ZnO and CuGaO2 based semiconductor application for space borne application. In this research, n-ZnO/p-CuGaO2 based semiconductor devices were fabricated and exposed to gamma rays with increasing total ionizing dose (TID) and neutron fluence at different flux. Based on the I-V properties, the decrease in the turn-on voltage of the diode is noticeable with increasing radiation dose for both gamma and neutron flux exposure. The maximum turn-on-voltage of the fabricated diode was shown to be 1.5 V. Exposure towards gamma, shows that the turn-on is increased to 4.7 V at 200 kGy. However, the effect of neutron flux at 6.5 × 1015 n cm−2 shows a small significant effect on the turn on voltage of 1.7 V after irradiation. Results show moderate mitigation towards irradiation, indicating that n-ZnO/p-CuGaO2 thin film is capable of withstanding harsh radiation environment while still retaining its semiconductor as the changes in band gap ranges between 3 eV to 4 eV at post-irradiation

Non-polynomial Worst-Case Analysis of Recursive Programs

We study the problem of developing efficient approaches for proving worst-case bounds of non-deterministic recursive programs. Ranking functions are sound and complete for proving termination and worst-case bounds of nonrecursive programs. First, we apply ranking functions to recursion, resulting in measure functions. We show that measure functions provide a sound and complete approach to prove worst-case bounds of non-deterministic recursive programs. Our second contribution is the synthesis of measure functions in nonpolynomial forms. We show that non-polynomial measure functions with logarithm and exponentiation can be synthesized through abstraction of logarithmic or exponentiation terms, Farkas' Lemma, and Handelman's Theorem using linear programming. While previous methods obtain worst-case polynomial bounds, our approach can synthesize bounds of the form $\mathcal{O}(n\log n)$ as well as $\mathcal{O}(n^r)$ where $r$ is not an integer. We present experimental results to demonstrate that our approach can obtain efficiently worst-case bounds of classical recursive algorithms such as (i) Merge-Sort, the divide-and-conquer algorithm for the Closest-Pair problem, where we obtain $\mathcal{O}(n \log n)$ worst-case bound, and (ii) Karatsuba's algorithm for polynomial multiplication and Strassen's algorithm for matrix multiplication, where we obtain $\mathcal{O}(n^r)$ bound such that $r$ is not an integer and close to the best-known bounds for the respective algorithms.Comment: 54 Pages, Full Version to CAV 201

A new version of the CNRM Chemistry-Climate Model, CNRM-CCM: description and improvements from the CCMVal-2 simulations

This paper presents a new version of the Météo-France CNRM Chemistry-Climate Model, so-called CNRM-CCM. It includes some fundamental changes from the previous version (CNRM-ACM) which was extensively evaluated in the context of the CCMVal-2 validation activity. The most notable changes concern the radiative code of the GCM, and the inclusion of the detailed stratospheric chemistry of our Chemistry-Transport model MOCAGE on-line within the GCM. A 47-yr transient simulation (1960–2006) is the basis of our analysis. CNRM-CCM generates satisfactory dynamical and chemical fields in the stratosphere. Several shortcomings of CNRM-ACM simulations for CCMVal-2 that resulted from an erroneous representation of the impact of volcanic aerosols as well as from transport deficiencies have been eliminated. <br><br> Remaining problems concern the upper stratosphere (5 to 1 hPa) where temperatures are too high, and where there are biases in the NO<sub>2</sub>, N<sub>2</sub>O<sub>5</sub> and O<sub>3</sub> mixing ratios. In contrast, temperatures at the tropical tropopause are too cold. These issues are addressed through the implementation of a more accurate radiation scheme at short wavelengths. Despite these problems we show that this new CNRM CCM is a useful tool to study chemistry-climate applications

Complexity Bounds for Ordinal-Based Termination

`What more than its truth do we know if we have a proof of a theorem in a given formal system?' We examine Kreisel's question in the particular context of program termination proofs, with an eye to deriving complexity bounds on program running times. Our main tool for this are length function theorems, which provide complexity bounds on the use of well quasi orders. We illustrate how to prove such theorems in the simple yet until now untreated case of ordinals. We show how to apply this new theorem to derive complexity bounds on programs when they are proven to terminate thanks to a ranking function into some ordinal.Comment: Invited talk at the 8th International Workshop on Reachability Problems (RP 2014, 22-24 September 2014, Oxford

Therapeutic efficacy of microtube-embedded chondroitinase ABC in a canine clinical model of spinal cord injury

Many hundreds of thousands of people around the world are living with the long-term consequences of spinal cord injury and they need effective new therapies. Laboratory research in experimental animals has identified a large number of potentially translatable interventions but transition to the clinic is not straightforward. Further evidence of efficacy in more clinically-relevant lesions is required to gain sufficient confidence to commence human clinical trials. Of the many therapeutic candidates currently available, intraspinally applied chondroitinase ABC has particularly well documented efficacy in experimental animals. In this study we measured the effects of this intervention in a double-blinded randomized controlled trial in a cohort of dogs with naturally-occurring severe chronic spinal cord injuries that model the condition in humans. First, we collected baseline data on a series of outcomes: forelimb-hindlimb coordination (the prespecified primary outcome measure), skin sensitivity along the back, somatosensory evoked and transcranial magnetic motor evoked potentials and cystometry in 60 dogs with thoracolumbar lesions. Dogs were then randomized 1:1 to receive intraspinal injections of heat-stabilized, lipid microtube-embedded chondroitinase ABC or sham injections consisting of needle puncture of the skin. Outcome data were measured at 1, 3 and 6 months after intervention; skin sensitivity was also measured 24 h after injection (or sham). Forelimb-hindlimb coordination was affected by neither time nor chondroitinase treatment alone but there was a significant interaction between these variables such that coordination between forelimb and hindlimb stepping improved during the 6-month follow-up period in the chondroitinase-treated animals by a mean of 23%, but did not change in controls. Three dogs (10%) in the chondroitinase group also recovered the ability to ambulate without assistance. Sensitivity of the dorsal skin increased at 24 h after intervention in both groups but subsequently decreased to normal levels. Cystometry identified a non-significant improvement of bladder compliance at 1 month in the chondroitinase-injected dogs but this did not persist. There were no overall differences between groups in detection of sensory evoked potentials. Our results strongly support a beneficial effect of intraspinal injection of chondroitinase ABC on spinal cord function in this highly clinically-relevant model of chronic severe spinal cord injury. There was no evidence of long-term adverse effects associated with this intervention. We therefore conclude that this study provides strong evidence in support of initiation of clinical trials of chondroitinase ABC in humans with chronic spinal cord injury

Pleosporales

One hundred and five generic types of Pleosporales are described and illustrated. A brief introduction and detailed history with short notes on morphology, molecular phylogeny as well as a general conclusion of each genus are provided. For those genera where the type or a representative specimen is unavailable, a brief note is given. Altogether 174 genera of Pleosporales are treated. Phaeotrichaceae as well as Kriegeriella, Zeuctomorpha and Muroia are excluded from Pleosporales. Based on the multigene phylogenetic analysis, the suborder Massarineae is emended to accommodate five families, viz. Lentitheciaceae, Massarinaceae, Montagnulaceae, Morosphaeriaceae and Trematosphaeriaceae

The SURFEXv7.2 land and ocean surface platform for coupled or offline simulation of Earth surface variables and fluxes

CC Attribution 3.0 License.Final revised paper also available at http://www.geosci-model-dev.net/6/929/2013/gmd-6-929-2013.pdfInternational audienceSURFEX is a new externalized land and ocean surface platform that describes the surface fluxes and the evolution of four types of surface: nature, town, inland water and ocean. It can be run either coupled or in offline mode. It is mostly based on pre-existing, well validated scientific models. It can be used in offline mode (from point scale to global runs) or fully coupled with an atmospheric model. SURFEX is able to simulate fluxes of carbon dioxide, chemical species, continental aerosols, sea salt and snow particles. It also includes a data assimilation module. The main principles of the organization of the surface are described first. Then, a survey is made of the scientific module (including the coupling strategy). Finally the main applications of the code are summarized. The current applications are extremely diverse, ranging from surface monitoring and hydrology to numerical weather prediction and global climate simulations. The validation work undertaken shows that replacing the pre-existing surface models by SURFEX in these applications is usually associated with improved skill, as the numerous scientific developments contained in this community code are used to good advantage