Breakdown of the Narrow Width Approximation for New Physics

The narrow width approximation is used in high energy physics to reduce the complexity of scattering calculations. It is a fortunate accident that it works so well for the Standard Model, but in general it will fail in the context of new physics. We find numerous examples of significant corrections when the calculation is performed fully off-shell including a finite width, notably from effects from the decay matrix elements. If not taken into account, attempts to reconstruct the Lagrangian of a new physics discovery from data would result in considerable inaccuracies and likely inconsistencies.Comment: 4 p., 3 figs, comments clarified, version to appear in PR

Mixed top-bottom squark production at the LHC

We calculate cross sections for mixed stop-sbottom pair production at the LHC, analogous to single-top production, a weak process involving the W-t(i)-b(j) vertex. While coupling-suppressed relative to QCD same-flavor squark pair production, the signal is distinctive due to heavy-flavor tagging along with a possible same-sign lepton pair in the final state. SUSY backgrounds can often be suppressed many orders of magnitude by taking advantage of distinct kinematic differences from the signal. Measuring the rate of this process would add significant additional information to that gathered from other SUSY processes. If the stop and sbottom mixings can be determined elsewhere, stop-sbottom production would provide for a measurement of the weak squark gauge coupling and super-CKM vertex factor.Comment: typo corrected, comment on W-associated channel added, version to appear in PR

Automated verification of shape and size properties via separation logic.

Despite their popularity and importance, pointer-based programs remain a major challenge for program verification. In this paper, we propose an automated verification system that is concise, precise and expressive for ensuring the safety of pointer-based programs. Our approach uses user-definable shape predicates to allow programmers to describe a wide range of data structures with their associated size properties. To support automatic verification, we design a new entailment checking procedure that can handle well-founded inductive predicates using unfold/fold reasoning. We have proven the soundness and termination of our verification system, and have built a prototype system

Memory usage verification using Hip/Sleek.

Embedded systems often come with constrained memory footprints. It is therefore essential to ensure that software running on such platforms fulfils memory usage specifications at compile-time, to prevent memory-related software failure after deployment. Previous proposals on memory usage verification are not satisfactory as they usually can only handle restricted subsets of programs, especially when shared mutable data structures are involved. In this paper, we propose a simple but novel solution. We instrument programs with explicit memory operations so that memory usage verification can be done along with the verification of other properties, using an automated verification system Hip/Sleek developed recently by Chin et al.[10,19]. The instrumentation can be done automatically and is proven sound with respect to an underlying semantics. One immediate benefit is that we do not need to develop from scratch a specific system for memory usage verification. Another benefit is that we can verify more programs, especially those involving shared mutable data structures, which previous systems failed to handle, as evidenced by our experimental results

Beyond reachability: Shape abstraction in the presence of pointer arithmetic

Abstract. Previous shape analysis algorithms use a memory model where the heap is composed of discrete nodes that can be accessed only via access paths built from variables and field names, an assumption that is violated by pointer arithmetic. In this paper we show how this assumption can be removed, and pointer arithmetic embraced, by using an analysis based on separation logic. We describe an abstract domain whose elements are certain separation logic formulae, and an abstraction mechanism that automatically transits between a low-level RAM view of memory and a higher, fictional, view that abstracts from the representation of nodes and multiword linked-lists as certain configurations of the RAM. A widening operator is used to accelerate the analysis. We report experimental results obtained from running our analysis on a number of classic algorithms for dynamic memory management.

Amortised resource analysis with separation logic

Type-based amortised resource analysis following Hofmann and Jost—where resources are associated with individual elements of data structures and doled out to the programmer under a linear typing discipline—have been successful in providing concrete resource bounds for functional programs, with good support for inference. In this work we translate the idea of amortised resource analysis to imperative languages by embedding a logic of resources, based on Bunched Implications, within Separation Logic. The Separation Logic component allows us to assert the presence and shape of mutable data structures on the heap, while the resource component allows us to state the resources associated with each member of the structure. We present the logic on a small imperative language with procedures and mutable heap, based on Java bytecode. We have formalised the logic within the Coq proof assistant and extracted a certified verification condition generator. We demonstrate the logic on some examples, including proving termination of in-place list reversal on lists with cyclic tails

Predicate Abstraction for Linked Data Structures

We present Alias Refinement Types (ART), a new approach to the verification of correctness properties of linked data structures. While there are many techniques for checking that a heap-manipulating program adheres to its specification, they often require that the programmer annotate the behavior of each procedure, for example, in the form of loop invariants and pre- and post-conditions. Predicate abstraction would be an attractive abstract domain for performing invariant inference, existing techniques are not able to reason about the heap with enough precision to verify functional properties of data structure manipulating programs. In this paper, we propose a technique that lifts predicate abstraction to the heap by factoring the analysis of data structures into two orthogonal components: (1) Alias Types, which reason about the physical shape of heap structures, and (2) Refinement Types, which use simple predicates from an SMT decidable theory to capture the logical or semantic properties of the structures. We prove ART sound by translating types into separation logic assertions, thus translating typing derivations in ART into separation logic proofs. We evaluate ART by implementing a tool that performs type inference for an imperative language, and empirically show, using a suite of data-structure benchmarks, that ART requires only 21% of the annotations needed by other state-of-the-art verification techniques

Spatial Interpolants

We propose Splinter, a new technique for proving properties of heap-manipulating programs that marries (1) a new separation logic-based analysis for heap reasoning with (2) an interpolation-based technique for refining heap-shape invariants with data invariants. Splinter is property directed, precise, and produces counterexample traces when a property does not hold. Using the novel notion of spatial interpolants modulo theories, Splinter can infer complex invariants over general recursive predicates, e.g., of the form all elements in a linked list are even or a binary tree is sorted. Furthermore, we treat interpolation as a black box, which gives us the freedom to encode data manipulation in any suitable theory for a given program (e.g., bit vectors, arrays, or linear arithmetic), so that our technique immediately benefits from any future advances in SMT solving and interpolation.Comment: Short version published in ESOP 201

Racial Differences in Cortical Bone Mass, Size and Estimated Strength at the Tibial Diaphysis in Early Pubertal Children

poster abstractOsteoporotic fracture rates differ according to race, with blacks having up to half the rate of whites. The reduced fracture rate in blacks has been suggested to be due to their superior bone mass; however, mass is not the sole determinant of bone strength. Bone strength, and consequent fracture risk, is also influenced by how bone material is distributed or structured. It is likely bone structure also contributes to the lower incidence of fractures in blacks and that racial differences in bone structure have roots in childhood. The aim of this study was to assess the influence of race on pQCT-derived cortical bone mass, size and estimated strength at the tibial diaphysis in early pubertal children. 160 children were recruited, with equal subjects according to race (black, n=80; white, n=80) and sex (female, n=80; male, n=80). Subjects were at sexual maturation stages 2 or 3. Tomographic slices of the tibial diaphysis at 66% proximal from the medial malleolus were acquired using pQCT. Slices were assessed for cortical volumetric BMD (Ct.vBMD), cortical BMC (Ct.BMC), total (Tt.Ar) and cortical (Ct.Ar) area, density weighted maximum (IMAX) and minimum (IMIN) second moments of area, density-weighted polar strength-strain index (SSIP), and muscle cross-sectional area (mCSA). Group differences were assessed by two-way analysis of covariance, with race (black vs. white) and sex (female vs. male) as independent variables. Covariates included predicted years from peak height velocity (maturity offset), tibial length and mCSA. There were no interactions between race and sex (all P=0.50-0.98) or main effect for sex (all P=0.08-0.45). Blacks had 15.7% more Ct.BMC, and 10.8-11.8% larger Tt.Ar and Ct.Ar than whites (all P<0.001). The greater enhancement of Ct.BMC relative to Ct.Ar resulted in blacks having 3.6% greater Ct.vBMD than whites (P<0.001). The combination of increased cortical bone mass, size and density in blacks contributed to enhanced estimated bone strength, with IMAX, IMIN and SSIP being 20.0%, 34.5% and 25.2% greater in blacks than whites, respectively (all P<0.001). These data indicate that early pubertal black children have enhanced bone mass, size and estimated bone strength at the tibial diaphysis versus whites, independent of tibial length and mCSA. They suggest bone structural differences may contribute to observed racial differences in fracture rates and that structural divergence between races develops during childhood