46 research outputs found
CARET analysis of multithreaded programs
Dynamic Pushdown Networks (DPNs) are a natural model for multithreaded
programs with (recursive) procedure calls and thread creation. On the other
hand, CARET is a temporal logic that allows to write linear temporal formulas
while taking into account the matching between calls and returns. We consider
in this paper the model-checking problem of DPNs against CARET formulas. We
show that this problem can be effectively solved by a reduction to the
emptiness problem of B\"uchi Dynamic Pushdown Systems. We then show that CARET
model checking is also decidable for DPNs communicating with locks. Our results
can, in particular, be used for the detection of concurrent malware.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
On Verifying Causal Consistency
Causal consistency is one of the most adopted consistency criteria for
distributed implementations of data structures. It ensures that operations are
executed at all sites according to their causal precedence. We address the
issue of verifying automatically whether the executions of an implementation of
a data structure are causally consistent. We consider two problems: (1)
checking whether one single execution is causally consistent, which is relevant
for developing testing and bug finding algorithms, and (2) verifying whether
all the executions of an implementation are causally consistent.
We show that the first problem is NP-complete. This holds even for the
read-write memory abstraction, which is a building block of many modern
distributed systems. Indeed, such systems often store data in key-value stores,
which are instances of the read-write memory abstraction. Moreover, we prove
that, surprisingly, the second problem is undecidable, and again this holds
even for the read-write memory abstraction. However, we show that for the
read-write memory abstraction, these negative results can be circumvented if
the implementations are data independent, i.e., their behaviors do not depend
on the data values that are written or read at each moment, which is a
realistic assumption.Comment: extended version of POPL 201
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
Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
Context-bounded analysis has been shown to be both efficient and effective at
finding bugs in concurrent programs. According to its original definition,
context-bounded analysis explores all behaviors of a concurrent program up to
some fixed number of context switches between threads. This definition is
inadequate for programs that create threads dynamically because bounding the
number of context switches in a computation also bounds the number of threads
involved in the computation. In this paper, we propose a more general
definition of context-bounded analysis useful for programs with dynamic thread
creation. The idea is to bound the number of context switches for each thread
instead of bounding the number of switches of all threads. We consider several
variants based on this new definition, and we establish decidability and
complexity results for the analysis induced by them
Ogre and Pythia: An Invariance Proof Method for Weak Consistency Models
We design an invariance proof method for concurrent programs parameterised by a weak consistency model. The calculational design of the invariance proof method is by abstract interpretation of a truly parallel analytic semantics. This generalises the methods by Lamport and Owicki-Gries for sequential consistency. We use cat as an example of language to write consistency specifications of both concurrent programs and machine architectures
Impact of seminal trace element and glutathione levels on semen quality of Tunisian infertile men
<p>Abstract</p> <p>Background</p> <p>Growing evidence indicates that oxidative stress can be a primary cause of male infertility. Non-enzymatic antioxidants play an important protective role against oxidative damages and lipid peroxidation. Human seminal plasma is a natural reservoir of antioxidants. The aim of this study was to determine glutathione (GSH) concentrations, trace element levels (zinc and selenium) and the lipid peroxidation end product, malondialdehyde (MDA), in the seminal plasma of men with different fertility potentials.</p> <p>Methods</p> <p>Semen samples from 60 fertile men (normozoospermics) and 190 infertile patients (74 asthenozoospermics, 56 oligozoospermics, and 60 teratozoospermics) were analyzed for physical and biochemical parameters. Zinc (Zn) and selenium (Se) levels were estimated by atomic absorption spectrophotometry. Total GSH (GSHt), oxidized GSH (GSSG), reduced GSH (GSHr) and MDA concentrations were measured spectrophotometrically.</p> <p>Results</p> <p>Zn and Se concentrations in seminal plasma of normozoospermics were more elevated than the three abnormal groups. Nevertheless, only the Zn showed significant differences. On the other hand, Zn showed positive and significant correlations with sperm motility (P = 0.03, r = 0.29) and count (P < 0.01, r = 0.49); however Se was significantly correlated only with sperm motility (P < 0.01, r = 0.36). GSHt, GSSG and GSHr were significantly higher in normozoospermics than in abnormal groups. We noted a significant association between seminal GSHt and sperm motility (P = 0.03). GSSG was highly correlated to sperm motility (P < 0.001) and negatively associated to abnormal morphology (P < 0.001). GSHr was significantly associated to total sperm motility (P < 0.001) and sperm count (P = 0.01). MDA levels were significantly higher in the three abnormal groups than in normozoospermics. Rates of seminal MDA were negatively associated to sperm motility (P < 0.01; r = -0.24) and sperm concentration (P = 0.003; r = -0.35) Meanwhile, there is a positive correlation between seminal lipid peroxidation and the percentage of abnormal morphology (P = 0.008).</p> <p>Conclusions</p> <p>This report revealed that decreased seminal GSH and trace element deficiencies are implicated in low sperm quality and may be an important indirect biomarker of idiopathic male infertility. Our results sustain that the evaluation of seminal antioxidant status in infertile men is necessary and can be helpful in fertility assessment from early stages.</p
Decreased glutathione levels and impaired antioxidant enzyme activities in drug-naive first-episode schizophrenic patients
<p>Abstract</p> <p>Background</p> <p>The aim of this study was to determine glutathione levels and antioxidant enzyme activities in the drug-naive first-episode patients with schizophrenia in comparison with healthy control subjects.</p> <p>Methods</p> <p>It was a case-controlled study carried on twenty-three patients (20 men and 3 women, mean age = 29.3 ± 7.5 years) recruited in their first-episode of schizophrenia and 40 healthy control subjects (36 men and 9 women, mean age = 29.6 ± 6.2 years). In patients, the blood samples were obtained prior to the initiation of neuroleptic treatments. Glutathione levels: total glutathione (GSHt), reduced glutathione (GSHr) and oxidized glutathione (GSSG) and antioxidant enzyme activities: superoxide dismutase (SOD), glutathione peroxidase (GPx), catalase (CAT) were determined by spectrophotometry.</p> <p>Results</p> <p>GSHt and reduced GSHr were significantly lower in patients than in controls, whereas GSSG was significantly higher in patients. GPx activity was significantly higher in patients compared to control subjects. CAT activity was significantly lower in patients, whereas the SOD activity was comparable to that of controls.</p> <p>Conclusion</p> <p>This is a report of decreased plasma levels of GSHt and GSHr, and impaired antioxidant enzyme activities in drug-naive first-episode patients with schizophrenia. The GSH deficit seems to be implicated in psychosis, and may be an important indirect biomarker of oxidative stress in schizophrenia early in the course of illness. Finally, our results provide support for further studies of the possible role of antioxidants as neuroprotective therapeutic strategies for schizophrenia from early stages.</p
SPARC 2018 Internationalisation and collaboration : Salford postgraduate annual research conference book of abstracts
Welcome to the Book of Abstracts for the 2018 SPARC conference. This year we not only celebrate the work of our PGRs but also the launch of our Doctoral School, which makes this year’s conference extra special. Once again we have received a tremendous contribution from our postgraduate research community; with over 100 presenters, the conference truly showcases a vibrant PGR community at Salford. These abstracts provide a taster of the research strengths of their works, and provide delegates with a reference point for networking and initiating critical debate. With such wide-ranging topics being showcased, we encourage you to take up this great opportunity to engage with researchers working in different subject areas from your own. To meet global challenges, high impact research inevitably requires interdisciplinary collaboration. This is recognised by all major research funders. Therefore engaging with the work of others and forging collaborations across subject areas is an essential skill for the next generation of researchers
Prédiction par calcul de la rugosité totale d'une surface usinée par électroérosion
La prédiction par calcul de l'état de
surface usinée par électroérosion, caractérisé par la
rugosité totale Rt, est proposée dans ce travail à travers
un modèle numérique basé sur la méthode des différences
finies. Les hypothèses, le type de chargement et les conditions aux
limites ont été déterminés en tenant compte des conditions
réelles d'usinage et des observations microscopiques de la morphologie
des surfaces usinées. La prise en compte du phénomène de
resolidification de la matière observé en usinage par
électroérosion a permis d'améliorer la précision du
modèle développé