Approaching the Coverability Problem Continuously

The coverability problem for Petri nets plays a central role in the verification of concurrent shared-memory programs. However, its high EXPSPACE-complete complexity poses a challenge when encountered in real-world instances. In this paper, we develop a new approach to this problem which is primarily based on applying forward coverability in continuous Petri nets as a pruning criterion inside a backward coverability framework. A cornerstone of our approach is the efficient encoding of a recently developed polynomial-time algorithm for reachability in continuous Petri nets into SMT. We demonstrate the effectiveness of our approach on standard benchmarks from the literature, which shows that our approach decides significantly more instances than any existing tool and is in addition often much faster, in particular on large instances.Comment: 18 pages, 4 figure

A Study of Concurrency Bugs and Advanced Development Support for Actor-based Programs

The actor model is an attractive foundation for developing concurrent applications because actors are isolated concurrent entities that communicate through asynchronous messages and do not share state. Thereby, they avoid concurrency bugs such as data races, but are not immune to concurrency bugs in general. This study taxonomizes concurrency bugs in actor-based programs reported in literature. Furthermore, it analyzes the bugs to identify the patterns causing them as well as their observable behavior. Based on this taxonomy, we further analyze the literature and find that current approaches to static analysis and testing focus on communication deadlocks and message protocol violations. However, they do not provide solutions to identify livelocks and behavioral deadlocks. The insights obtained in this study can be used to improve debugging support for actor-based programs with new debugging techniques to identify the root cause of complex concurrency bugs.Comment: - Submitted for review - Removed section 6 "Research Roadmap for Debuggers", its content was summarized in the Future Work section - Added references for section 1, section 3, section 4.3 and section 5.1 - Updated citation

First Report of Circulating MicroRNAs in Tumour Necrosis Factor Receptor-Associated Periodic Syndrome (TRAPS)

Tumor necrosis factor-receptor associated periodic syndrome (TRAPS) is a rare autosomal dominant autoinflammatory disorder characterized by recurrent episodes of long-lasting fever and inflammation in different regions of the body, such as the musculo-skeletal system, skin, gastrointestinal tract, serosal membranes and eye. Our aims were to evaluate circulating microRNAs (miRNAs) levels in patients with TRAPS, in comparison to controls without inflammatory diseases, and to correlate their levels with parameters of disease activity and/or disease severity. Expression levels of circulating miRNAs were measured by Agilent microarrays in 29 serum samples from 15 TRAPS patients carrying mutations known to be associated with high disease penetrance and from 8 controls without inflammatory diseases. Differentially expressed and clinically relevant miRNAs were detected using GeneSpring GX software. We identified a 6 miRNAs signature able to discriminate TRAPS from controls. Moreover, 4 miRNAs were differentially expressed between patients treated with the interleukin (IL)-1 receptor antagonist, anakinra, and untreated patients. Of these, miR-92a-3p and miR-150-3p expression was found to be significantly reduced in untreated patients, while their expression levels were similar to controls in samples obtained during anakinra treatment. MiR-92b levels were inversely correlated with the number of fever attacks/year during the 1st year from the index attack of TRAPS, while miR-377-5p levels were positively correlated with serum amyloid A (SAA) circulating levels. Our data suggest that serum miRNA levels show a baseline pattern in TRAPS, and may serve as potential markers of response to therapeutic intervention

On hierarchical communication topologies in the pi-calculus

This paper is concerned with the shape invariants satisfied by the communication topology of π-terms, and the automatic inference of these invariants. A π-term P is hierarchical if there is a finite forest T such that the communication topology of every term reachable from P satisfies a T -shaped invariant. We design a static analysis to prove a term hierarchical by means of a novel type system that enjoys decidable inference. The soundness proof of the type system employs a non-standard view of π-calculus reactions. The coverability problem for hierarchical terms is decidable. This is proved by showing that every hierarchical term is depth-bounded, an undecidable property known in the literature. We thus obtain an expressive static fragment of the π-calculus with decidable safety verification problems