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

Micropositioning and tilting systems based on thermoelectric actuation

An inexpensive system for micropositioning and tilting based on thermoelectric actuation is described

A hard x ray split and delay unit for the HED experiment at the European XFEL

For the High Energy Density HED experiment [1] at the European XFEL [2] an x ray split and delay unit SDU is built covering photon energies from 5 keV up to 20 keV [3]. This SDU will enable time resolved x ray pump x ray probe experiments [4,5] as well as sequential diffractive imaging [6] on a femtosecond to picosecond time scale. Further, direct measurements of the temporal coherence properties will be possible by making use of a linear autocorrelation [7,8]. The set up is based on geometric wavefront beam splitting, which has successfully been implemented at an autocorrelator at FLASH [9]. The x ray FEL pulses are split by a sharp edge of a silicon mirror coated with multilayers. Both partial beams will then pass variable delay lines. For different photon energies the angle of incidence onto the multilayer mirrors will be adjusted in order to match the Bragg condition. For a photon energy of h amp; 957; 20 keV a grazing angle of amp; 952; 0.57 has to be set, which results in a footprint of the beam 6 amp; 963; on the mirror of l 98 mm. At this photon energy the reflectance of a Mo B4C multi layer coating with a multilayer period of d 3.2 nm and N 200 layers amounts to R 0.92. In order to enhance the maximum transmission for photon energies of h amp; 957; 8 keV and below, a Ni B4C multilayer coating can be applied beside the Mo B4C coating for this spectral region. Because of the different incidence angles, the path lengths of the beams will differ as a function of wavelength. Hence, maximum delays between 2.5 ps at h amp; 957; 20 keV and up to 23 ps at h amp; 957; 5 keV will be possibl

Lock Removal for Concurrent Trace Programs

Abstract. We propose a trace-based concurrent program analysis to soundly remove redundant synchronizations such as locks while preserving the behaviors of the concurrent computation. Our new method is computationally efficient in that it involves only thread-local computation and therefore avoids interleaving explosion, which is known as the main hurdle for scalable concurrency analysis. Our method builds on the partial-order theory and a unified analysis framework; therefore, it is more generally applicable than existing methods based on simple syntactic rules and ad hoc heuristics. We have implemented and evaluated the proposed method in the context of runtime verification of multithreaded Java and C programs. Our experimental results show that lock removal can significantly speed up symbolic predictive analysis for detecting concurrency bugs. Besides runtime verification, our new method will also be useful in applications such as debugging, performance optimization, program understanding, and maintenance.

Fluorescent Molecularly Imprinted Polymer Layers against Sialic Acid on Silica-Coated Polystyrene Cores-Assessment of the Binding Behavior to Cancer Cells

Simple Summary Cancer cells often have aberrant sialic acid expression. We used molecularly imprinted polymers in this study as novel tools for analyzing sialic acid expression as a biomarker on cancer cells. The sialic acid imprinted polymer shell was synthesized on a polystyrene core, providing low-density support for improving the suspension stability and scattering properties of the molecularly imprinted particles compared to previous core-shell formats. Our results show that these particles have an increased ability to bind to cancer cells. The binding of these particles may be inhibited by two different pentavalent sialic acid conjugates, pointing to the specificity of the sialic acid imprinted particles. Sialic acid (SA) is a monosaccharide usually linked to the terminus of glycan chains on the cell surface. It plays a crucial role in many biological processes, and hypersialylation is a common feature in cancer. Lectins are widely used to analyze the cell surface expression of SA. However, these protein molecules are usually expensive and easily denatured, which calls for the development of alternative glycan-specific receptors and cell imaging technologies. In this study, SA-imprinted fluorescent core-shell molecularly imprinted polymer particles (SA-MIPs) were employed to recognize SA on the cell surface of cancer cell lines. The SA-MIPs improved suspensibility and scattering properties compared with previously used core-shell SA-MIPs. Although SA-imprinting was performed using SA without preference for the alpha 2,3- and alpha 2,6-SA forms, we screened the cancer cell lines analyzed using the lectins Maackia Amurensis Lectin I (MAL I, alpha 2,3-SA) and Sambucus Nigra Lectin (SNA, alpha 2,6-SA). Our results show that the selected cancer cell lines in this study presented a varied binding behavior with the SA-MIPs. The binding pattern of the lectins was also demonstrated. Moreover, two different pentavalent SA conjugates were used to inhibit the binding of the SA-MIPs to breast, skin, and lung cancer cell lines, demonstrating the specificity of the SA-MIPs in both flow cytometry and confocal fluorescence microscopy. We concluded that the synthesized SA-MIPs might be a powerful future tool in the diagnostic analysis of various cancer cells.</p

第913回千葉医学会例会・第28回麻酔科例会・第56回千葉麻酔懇話会

Introduction Pulmonary Surfactant reduces surface tension in the terminal airways thus facilitating breathing and contributes to host’s innate immunity. Surfactant Proteins (SP) A, B, C and D were recently identified as inherent proteins of the CNS. Aim of the study was to investigate cerebrospinal fluid (CSF) SP levels in hydrocephalus patients compared to normal subjects. Patients and Methods CSF SP A-D levels were quantified using commercially available ELISA kits in 126 patients (0–84 years, mean 39 years). 60 patients without CNS pathologies served as a control group. Hydrocephalus patients were separated in aqueductal stenosis (AQS, n = 24), acute hydrocephalus without aqueductal stenosis (acute HC w/o AQS, n = 16) and idiopathic normal pressure hydrocephalus (NPH, n = 20). Furthermore, six patients with pseudotumor cerebri were investigated. Results SP A—D are present under physiological conditions in human CSF. SP-A is elevated in diseases accompanied by ventricular enlargement (AQS, acute HC w/o AQS) in a significant manner (0.67, 1.21 vs 0.38 ng/ml in control, p<0.001). SP-C is also elevated in hydrocephalic conditions (AQS, acute HC w/o AQS; 0.87, 1.71 vs. 0.48 ng/ml in controls, p<0.001) and in Pseudotumor cerebri (1.26 vs. 0.48 ng/ml in controls, p<0.01). SP-B and SP-D did not show significant alterations. Conclusion The present study confirms the presence of SPs in human CSF. There are significant changes of SP-A and SP-C levels in diseases affecting brain water circulation and elevation of intracranial pressure. Cause of the alterations, underlying regulatory mechanisms, as well as diagnostic and therapeutic consequences of cerebral SP’s requires further thorough investigations

Constrained Dynamic Tree Networks

We generalise Constrained Dynamic Pushdown Networks, introduced by Bouajjani\et al, to Constrained Dynamic Tree Networks.<br>In this model, we have trees of processes which may monitor their children.<br>We allow the processes to be defined by any computation model for which the alternating reachability problem is decidable.<br>We address the problem of symbolic reachability analysis for this model. More precisely, we consider the problem of computing an effective representation of their reachability<br>sets using finite state automata. <div>We show that backwards reachability sets starting from regular sets of configurations are always regular. </div><div>We provide an algorithm for computing backwards reachability sets using tree automata.<br><br></div

Determination of nutrient salts by automatic methods both in seawater and brackish water: the phosphate blank

9 páginas, 2 tablas, 2 figurasThe main inconvenience in determining nutrients in seawater by automatic methods is simply solved: the preparation of a suitable blank which corrects the effect of the refractive index change on the recorded signal. Two procedures are proposed, one physical (a simple equation to estimate the effect) and the other chemical (removal of the dissolved phosphorus with ferric hydroxide).Support for this work came from CICYT (MAR88-0245 project) and Conselleria de Pesca de la Xunta de GaliciaPeer reviewe

Approximative Methods for Monotone Systems of min-max-Polynomial Equations

A monotone system of min-max-polynomial equations (min-max-MSPE) over the variables X1,..., Xn has for every i exactly one equation of the form Xi = fi(X1,..., Xn) where each fi(X1,..., Xn) is an expression built up from polynomials with non-negative coefficients, minimum- and maximum-operators. The question of computing least solutions of min-max-MSPEs arises naturally in the analysis of recursive stochastic games [5, 6, 14]. Min-max-MSPEs generalize MSPEs for which convergence speed results of Newton’s method are established in [11, 3]. We present the first methods for approximatively computing least solutions of min-max-MSPEs which converge at least linearly. Whereas the first one converges faster, a single step of the second method is cheaper. Furthermore, we compute ǫ-optimal positional strategies for the player who wants to maximize the outcome in a recursive stochastic game