Reachability for dynamic parametric processes

In a dynamic parametric process every subprocess may spawn arbitrarily many, identical child processes, that may communicate either over global variables, or over local variables that are shared with their parent. We show that reachability for dynamic parametric processes is decidable under mild assumptions. These assumptions are e.g. met if individual processes are realized by pushdown systems, or even higher-order pushdown systems. We also provide algorithms for subclasses of pushdown dynamic parametric processes, with complexity ranging between NP and DEXPTIME.Comment: 31 page

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

A Framework to Synergize Partial Order Reduction with State Interpolation

We address the problem of reasoning about interleavings in safety verification of concurrent programs. In the literature, there are two prominent techniques for pruning the search space. First, there are well-investigated trace-based methods, collectively known as "Partial Order Reduction (POR)", which operate by weakening the concept of a trace by abstracting the total order of its transitions into a partial order. Second, there is state-based interpolation where a collection of formulas can be generalized by taking into account the property to be verified. Our main contribution is a framework that synergistically combines POR with state interpolation so that the sum is more than its parts

An Abort-Aware Model of Transactional Programming

Abstract. There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better exploit the parallelism of modern multi-processor machines, such as multi-core microprocessors. We introduce Transactional State Machines (TSMs) as an abstract finite-data model of transactional shared-memory concurrent programs. TSMs are a variant of concurrent boolean programs (or concurrent extended recursive state machines) augmented with additional constructs for specifying potentially nested transactions. Namely, some procedures (or code segments) can be marked as transactions and are meant to be executed “atomically”, and there are also explicit commit and abort operations for transactions. The TSM model is non-blocking and allows interleaved executions where multiple processes can simultaneously be executing inside transactions. It also allows nested transactions, transactions which may never terminate, and transactions which may be aborted explicitly, or aborted automatically by the run-time environment due to memory conflicts. We show that concurrent executions of TSMs satisfy a correctness criterion closely related to serializability, which we call stutter-serializability, with respect to shared memory. We initiate a study of model checking problems for TSMs. Model checking arbitrary TSMs is easily seen to be undecidable, but we show it is decidable in the following case: when recursion is exclusively used inside transactions in all (but one) of the processes, we show that model checking such TSMs against all stutterinvariant ω-regular properties of shared memory is decidable.

An abort-aware model of transactional programming

Abstract There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better exploit the parallelism of modern multi-processor machines, such as multi-core microprocessors. We introduce Transactional State Machines (TSMs) as an abstract finite-data model of transactional shared-memory concurrent programs. TSMs are a variant of concurrent boolean programs (or concurrent extended recursive state machines) augmented with additional constructs for specifying potentially nested transactions. Namely, some procedures (or code segments) can be marked as transactions and are meant to be executed “atomically”, and there are also explicit commit and abort operations for transactions. The TSM model is non-blocking and allows interleaved executions where multiple processes can simultaneously be executing inside transactions. It also allows nested transactions, transactions which may never terminate, and transactions which may be aborted explicitly, or aborted automatically by the run-time environment due to memory conflicts. We show that concurrent executions of TSMs satisfy a correctness criterion closely related to serializability, which we call stutter-serializability, with respect to shared memory. We initiate a study of model checking problems for TSMs. Model checking arbitrary TSMs is easily seen to be undecidable, but we show it is decidable in the following case: when recursion The work of K. Etessami was done partly while visiting Microsof

Improving the lipid profile in hypercholesterolemia-induced rabbit by supplementation of germinated brown rice.

It is imperative that there be a diet designed specifically to improve lipid profile in order to impede the progress of atherosclerosis. Because rice is a staple food in Asia, it will be chosen as the diet of interest. This study sets out to discover whether consumption of different processed rice diets may result in a change of the lipid profile. The experiment was done on male New Zealand white rabbits after 10 weeks of treatment with diet containing 0.5% cholesterol. The experimental diets include white rice (WR), brown rice (BR), and germinated brown rice (GBR). Among them, rabbits fed a GBR diet demonstrated significantly lower levels of total cholesterol (TC), low-density lipoprotein (LDL), LDL/HDL, and atherogenic index (AI) and a higher level of high-density lipoprotein (HDL). Results from atherosclerotic plaque assessment further support the findings. The level of malondialdehyde (MDA), which acts as an indicator for oxidative stress, was also reduced by GBR diet. The positive change in lipid profile in the rabbits fed GBR appeared to correspond with the higher amounts of γ-oryzanol, tocopherol, and monounsaturated fatty acid (MUFA) content

HTT-lowering reverses Huntington's disease immune dysfunction caused by NFκB pathway dysregulation

The peripheral immune response is altered in Huntington's disease, but the underlying mechanisms are unclear. Using RNA interference to lower huntingtin levels in leucocytes from patients, Träger et al. reverse disease-associated phenotypes including cytokine elevation and transcriptional dysregulation, and argue for a direct effect of mutant huntingtin on NFκΒ signallin

Preparation and Evaluation of Rice Bran-Modified Urea Formaldehyde as Environmental Friendly Wood Adhesive

In this study, defatted rice bran (RB) is used to prepare an environmentally friendly adhesive through chemical modifications. The RB is mixed with distilled water with ratios of 1:5 and 1:4 to prepare Type A and Type B adhesives, respectively having pH of 6, 8 and 10. Type A adhesive is prepared by treating RB with 1% potassium permanganate and 4% poly(vinyl alcohol), whereas Type B is formulated by adding 17.3% formaldehyde and 5.7% urea to RB. Viscosity, gel time, solid content, shear strength, Fourier transform infrared (FTIR) spectroscopy is carried out, and glass transition temperature (T-g), and activation energy (E-a) are determined to evaluate the performance of the adhesives. E-a data reveal that adhesives prepared at mild alkaline (pH 8) form long-chain polymers. Gel time is higher in the fabricated adhesives than that of the commercial urea formaldehyde (UF). FTIR data suggest that functional groups of the raw RB are chemically modified, which enhances the bondability of the adhesives. Shear strength data indicates that bonding strength increases with increasing pH. Similar results are also observed for physical and mechanical properties of fabricated particleboards with the adhesives. The results demonstrate that RB-based adhesives can be used as a potential alternative to currently used UF-based resin