Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations

We introduce a new class of graph transformation systems in which rewrite rules can be guarded by universally quantified conditions on the neighbourhood of nodes. These conditions are defined via special graph patterns which may be transformed by the rule as well. For the new class for graph rewrite rules, we provide a symbolic procedure working on minimal representations of upward closed sets of configurations. We prove correctness and effectiveness of the procedure by a categorical presentation of rewrite rules as well as the involved order, and using results for well-structured transition systems. We apply the resulting procedure to the analysis of the Distributed Dining Philosophers protocol on an arbitrary network structure.Comment: Extended version of a submittion accepted at RP'14 Worksho

On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems

We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual convergence of fixpoint computations. In particular, we are able to directly obtain several new decidability results on lossy channel systems.Comment: 16 page

Relationship Between Child Survival and Malaria Transmission: An Analysis of the Malaria Transmission Intensity and Mortality Burden Across Africa (MTIMBA) Project Data in Rufiji Demographic Surveillance System, Tanzania.

The precise nature of the relationship between malaria mortality and levels of transmission is unclear. Due to methodological limitations, earlier efforts to assess the linkage have lead to inconclusive results. The malaria transmission intensity and mortality burden across Africa (MTIMBA) project initiated by the INDEPTH Network collected longitudinally entomological data within a number of sites in sub-Saharan Africa to study this relationship. This work linked the MTIMBA entomology database with the routinely collected vital events within the Rufiji Demographic Surveillance System to analyse the transmission-mortality relation in the region. Bayesian Bernoulli spatio-temporal Cox proportional hazards models with village clustering, adjusted for age and insecticide-treated nets (ITNs), were fitted to assess the relation between mortality and malaria transmission measured by entomology inoculation rate (EIR). EIR was predicted at household locations using transmission models and it was incorporated in the model as a covariate with measure of uncertainty. Effects of covariates estimated by the model are reported as hazard ratios (HR) with 95% Bayesian confidence interval (BCI) and spatial and temporal parameters are presented. Separate analysis was carried out for neonates, infants and children 1-4 years of age. No significant relation between all-cause mortality and intensity of malaria transmission was indicated at any age in childhood. However, a strong age effect was shown. Comparing effects of ITN and EIR on mortality at different age categories, a decrease in protective efficacy of ITN was observed (i.e. neonates: HR = 0.65; 95% BCI: 0.39-1.05; infants: HR = 0.72; 95% BCI:0.48-1.07; children 1-4 years: HR = 0.88; 95% BCI: 0.62-1.23) and reduction on the effect of malaria transmission exposure was detected (i.e. neonates: HR = 1.15; 95% BCI:0.95-1.36; infants: HR = 1.13; 95% BCI:0.98-1.25; children 1-4 years: HR = 1.04; 95% BCI:0.89-1.18). A very strong spatial correlation was also observed. These results imply that assessing the malaria transmission-mortality relation involves more than the knowledge on the performance of interventions and control measures. This relation depends on the levels of malaria endemicity and transmission intensity, which varies significantly between different settings. Thus, sub-regions analyses are necessary to validate and assess reproducibility of findings

Enhancing Approximations for Regular Reachability Analysis

This paper introduces two mechanisms for computing over-approximations of sets of reachable states, with the aim of ensuring termination of state-space exploration. The first mechanism consists in over-approximating the automata representing reachable sets by merging some of their states with respect to simple syntactic criteria, or a combination of such criteria. The second approximation mechanism consists in manipulating an auxiliary automaton when applying a transducer representing the transition relation to an automaton encoding the initial states. In addition, for the second mechanism we propose a new approach to refine the approximations depending on a property of interest. The proposals are evaluated on examples of mutual exclusion protocols

Isolation, Identification and Seasonal Distribution of Soilborne Fungi in Different Areas of Erbil Governorate

A survey study was undertaken for the isolation and identification of soilborne fungi inhabiting different areas in Erbil, Iraq. A total of 15 soil samples collected seasonally during August 2008-July 2009. Fungi were isolated from soil during this study\u27s period, by soil dilution plate method on selective medium: Potato Dextrose Agar (PDA), eighty-one different genera of fungi were isolated during the four seasons; (30, 33, 70, and 53) genera isolated in (summer, autumn, winter and spring) respectively, the most frequently isolated fungi during four seasons were Aspergillus sp. (539x103) colony forming units /g.soil, followed by Penicillium sp. (215x103) cfu/g.soil, Rhizopus spp. (115x103) cfu/g.soil, Emericella spp. (109x103) cfu/g.soil, Fusarium spp. (47x103) cfu/g.soil, and Ulocladium botrytis (47x103) cfu/g.soil, while the least frequently isolated fungal genera were Blakeslea tuningtam, Clasterosporium cyperi, Idriella sp., Naranus cryptomeriae and Torula alternata, (1x103) cfu/g.soil, for each one. Fungi isolated from soil by washing method counted for ninety three species belonging to fifty six genera, among them: Aspergillus sp., Circinella sp., Cunninghamella sp., Mucor spp., Mycelia sterilia, Rhizopus sp

Parameterized Model-Checking for Timed-Systems with Conjunctive Guards (Extended Version)

In this work we extend the Emerson and Kahlon's cutoff theorems for process skeletons with conjunctive guards to Parameterized Networks of Timed Automata, i.e. systems obtained by an \emph{apriori} unknown number of Timed Automata instantiated from a finite set $U_1, \dots, U_n$ of Timed Automata templates. In this way we aim at giving a tool to universally verify software systems where an unknown number of software components (i.e. processes) interact with continuous time temporal constraints. It is often the case, indeed, that distributed algorithms show an heterogeneous nature, combining dynamic aspects with real-time aspects. In the paper we will also show how to model check a protocol that uses special variables storing identifiers of the participating processes (i.e. PIDs) in Timed Automata with conjunctive guards. This is non-trivial, since solutions to the parameterized verification problem often relies on the processes to be symmetric, i.e. indistinguishable. On the other side, many popular distributed algorithms make use of PIDs and thus cannot directly apply those solutions

Preventing childhood malaria in Africa by protecting adults from mosquitoes with insecticide-treated nets

Malaria prevention in Africa merits particular attention as the world strives toward a better life for the poorest. Insecticide-treated nets (ITNs) represent a practical means to prevent malaria in Africa, so scaling up coverage to at least 80% of young children and pregnant women by 2010 is integral to the Millennium Development Goals (MDG). Targeting individual protection to vulnerable groups is an accepted priority, but community-level impacts of broader population coverage are largely ignored even though they may be just as important. We therefore estimated coverage thresholds for entire populations at which individual- and community-level protection are equivalent, representing rational targets for ITN coverage beyond vulnerable groups

Algorithmic Verification of Asynchronous Programs

Asynchronous programming is a ubiquitous systems programming idiom to manage concurrent interactions with the environment. In this style, instead of waiting for time-consuming operations to complete, the programmer makes a non-blocking call to the operation and posts a callback task to a task buffer that is executed later when the time-consuming operation completes. A co-operative scheduler mediates the interaction by picking and executing callback tasks from the task buffer to completion (and these callbacks can post further callbacks to be executed later). Writing correct asynchronous programs is hard because the use of callbacks, while efficient, obscures program control flow. We provide a formal model underlying asynchronous programs and study verification problems for this model. We show that the safety verification problem for finite-data asynchronous programs is expspace-complete. We show that liveness verification for finite-data asynchronous programs is decidable and polynomial-time equivalent to Petri Net reachability. Decidability is not obvious, since even if the data is finite-state, asynchronous programs constitute infinite-state transition systems: both the program stack and the task buffer of pending asynchronous calls can be potentially unbounded. Our main technical construction is a polynomial-time semantics-preserving reduction from asynchronous programs to Petri Nets and conversely. The reduction allows the use of algorithmic techniques on Petri Nets to the verification of asynchronous programs. We also study several extensions to the basic models of asynchronous programs that are inspired by additional capabilities provided by implementations of asynchronous libraries, and classify the decidability and undecidability of verification questions on these extensions.Comment: 46 pages, 9 figure

Medication exposure during pregnancy: a pilot pharmacovigilance system using health and demographic surveillance platform.

BACKGROUND: There is limited safety information on most drugs used during pregnancy. This is especially true for medication against tropical diseases because pharmacovigilance systems are not much developed in these settings. The aim of the present study was to demonstrate feasibility of using Health and Demographic Surveillance System (HDSS) as a platform to monitor drug safety in pregnancy. METHODS: Pregnant women with gestational age below 20 weeks were recruited from Reproductive and Child Health (RCH) clinics or from monthly house visits carried out for the HDSS. A structured questionnaire was used to interview pregnant women. Participants were followed on monthly basis to record any new drug used as well as pregnancy outcome. RESULTS: 1089 pregnant women were recruited; 994 (91.3%) completed the follow-up until delivery. 98% women reported to have taken at least one medication during pregnancy, mainly those used in antenatal programmes. Other most reported drugs were analgesics (24%), antibiotics (17%), and antimalarial (15%), excluding IPTp. Artemether-lumefantrine (AL) was the most used antimalarial for treating illness by nearly 3/4 compared to other groups of malaria drugs. Overall, antimalarial and antibiotic exposures in pregnancy were not significantly associated with adverse pregnancy outcome. Iron and folic acid supplementation were associated with decreased risk of miscarriage/stillbirth (OR 0.1; 0.08 - 0.3). CONCLUSION: Almost all women were exposed to medication during pregnancy. Exposure to iron and folic acid had a beneficial effect on pregnancy outcome. HDSS proved to be a useful platform to establish a reliable pharmacovigilance system in resource-limited countries. Widening drug safety information is essential to facilitate evidence based risk-benefit decision for treatment during pregnancy, a major challenge with newly marketed medicines