1,949 research outputs found
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
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
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
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 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
An elective combined caesarean section and small bowel GIST resection during the third trimester of pregnancy: Report of a case
AbstractINTRODUCTIONGastro-Intestinal Stromal Tumours (GISTs) are rare with an estimated incidence of only 11–15 per million. In pregnancy, GISTs are an extremely rare occurrence and are thus complex to manage from an ethical, surgical and oncological perspective.PRESENTATION OF CASEWe present the first reported case in the literature of a successful combined lower segment caesarean section (LSCS) and a tumour resection in a 31-year-old pregnant patient presenting with a small bowel GIST.DISCUSSIONWe compare and contrast our case with other reported cases of GIST resection in pregnancy and discuss the challenges faced by both patients and clinicians.CONCLUSIONOur case demonstrates that a combined LSCS and GIST resection is feasible. In addition, our case highlights the importance of both the multidisciplinary setting and the consideration of patients’ wishes in the successful management of this complex group of patients
Kleene Algebras and Semimodules for Energy Problems
With the purpose of unifying a number of approaches to energy problems found
in the literature, we introduce generalized energy automata. These are finite
automata whose edges are labeled with energy functions that define how energy
levels evolve during transitions. Uncovering a close connection between energy
problems and reachability and B\"uchi acceptance for semiring-weighted
automata, we show that these generalized energy problems are decidable. We also
provide complexity results for important special cases
- …