Provably Correct Control-Flow Graphs from Java Programs with Exceptions

We present an algorithm to extract flow graphs from Java bytecode, focusing on exceptional control flows. We prove its correctness, meaning that the behaviour of the extracted control-flow graph is an over-approximation of the behaviour of the original program. Thus any safety property that holds for the extracted control-flow graph also holds for the original program. This makes control-flow graphs suitable for performing different static analyses. For precision and efficiency, the extraction is performed in two phases. In the first phase the program is transformed into a BIR program, where BIR is a stack-less intermediate representation of Java bytecode; in the second phase the control-flow graph is extracted from the BIR representation. To prove the correctness of the two-phase extraction, we also define a direct extraction algorithm, whose correctness can be proven immediately. Then we show that the behaviour of the control-flow graph extracted via the intermediate representation is an over-approximation of the behaviour of the directly extracted graphs, and thus of the original program

The study of probability model for compound similarity searching

Information Retrieval or IR system main task is to retrieve relevant documents according to the users query. One of IR most popular retrieval model is the Vector Space Model. This model assumes relevance based on similarity, which is defined as the distance between query and document in the concept space. All currently existing chemical compound database systems have adapt the vector space model to calculate the similarity of a database entry to a query compound. However, it assumes that fragments represented by the bits are independent of one another, which is not necessarily true. Hence, the possibility of applying another IR model is explored, which is the Probabilistic Model, for chemical compound searching. This model estimates the probabilities of a chemical structure to have the same bioactivity as a target compound. It is envisioned that by ranking chemical structures in decreasing order of their probability of relevance to the query structure, the effectiveness of a molecular similarity searching system can be increased. Both fragment dependencies and independencies assumption are taken into consideration in achieving improvement towards compound similarity searching system. After conducting a series of simulated similarity searching, it is concluded that PM approaches really did perform better than the existing similarity searching. It gave better result in all evaluation criteria to confirm this statement. In terms of which probability model performs better, the BD model shown improvement over the BIR model

Positivity Constraints on Anomalies in Supersymmetric Gauge Theories

The relation between the trace and R-current anomalies in supersymmetric theories implies that the U$(1)_RF^2$, U$(1)_R$ and U$(1)_R^3$ anomalies which are matched in studies of N=1 Seiberg duality satisfy positivity constraints. Some constraints are rigorous and others conjectured as four-dimensional generalizations of the Zamolodchikov $c$-theorem. These constraints are tested in a large number of N=1 supersymmetric gauge theories in the non-Abelian Coulomb phase, and they are satisfied in all renormalizable models with unique anomaly-free R-current, including those with accidental symmetry. Most striking is the fact that the flow of the Euler anomaly coefficient, $a_{UV}-a_{IR}$, is always positive, as conjectured by Cardy.Comment: latex, 36 page

Attacks on midwives, attacks on women’s choices

Nadine Edwards, Jo Murphy-Lawless, Mavis Kirkham and Sarah Davies ask whether recent attacks on midwives are a Human Rights issu