A Branching Time Model of CSP

I present a branching time model of CSP that is finer than all other models of CSP proposed thus far. It is obtained by taking a semantic equivalence from the linear time - branching time spectrum, namely divergence-preserving coupled similarity, and showing that it is a congruence for the operators of CSP. This equivalence belongs to the bisimulation family of semantic equivalences, in the sense that on transition systems without internal actions it coincides with strong bisimilarity. Nevertheless, enough of the equational laws of CSP remain to obtain a complete axiomatisation for closed, recursion-free terms.Comment: Dedicated to Bill Roscoe, on the occasion of his 60th birthda

A wide-spectrum language for verification of programs on weak memory models

Modern processors deploy a variety of weak memory models, which for efficiency reasons may (appear to) execute instructions in an order different to that specified by the program text. The consequences of instruction reordering can be complex and subtle, and can impact on ensuring correctness. Previous work on the semantics of weak memory models has focussed on the behaviour of assembler-level programs. In this paper we utilise that work to extract some general principles underlying instruction reordering, and apply those principles to a wide-spectrum language encompassing abstract data types as well as low-level assembler code. The goal is to support reasoning about implementations of data structures for modern processors with respect to an abstract specification. Specifically, we define an operational semantics, from which we derive some properties of program refinement, and encode the semantics in the rewriting engine Maude as a model-checking tool. The tool is used to validate the semantics against the behaviour of a set of litmus tests (small assembler programs) run on hardware, and also to model check implementations of data structures from the literature against their abstract specifications

Automated Algebraic Reasoning for Collections and Local Variables with Lenses

Lenses are a useful algebraic structure for giving a unifying semantics to program variables in a variety of store models. They support efficient automated proof in the Isabelle/UTP verification framework. In this paper, we expand our lens library with (1) dynamic lenses, that support mutable indexed collections, such as arrays, and (2) symmetric lenses, that allow partitioning of a state space into disjoint local and global regions to support variable scopes. From this basis, we provide an enriched program model in Isabelle/UTP for collection variables and variable blocks. For the latter, we adopt an approach first used by Back and von Wright, and derive weakest precondition and Hoare calculi. We demonstrate several examples, including verification of insertion sor

Applications of Fair Testing

In this paper we present the application of the fair testing pre-order, introduced in a previous paper, to the specification and analysis of distributed systems. This pre-order combines some features of the standard testing pre-orders, viz. the possibility to refine a specification by the resolution of nondeterminism, with a powerful feature of standard observation congruence, viz. the fair abstraction from divergences. Moreover, it is a pre-congruence with respect to all standard process-algebraic combinators, thus allowing for the standard algebraic proof techniques by substitution and rewriting. In this paper we will demonstrate advantages of the fair testing pre-order by the application to a number of examples, including a scheduling problem, a version of the Alternating Bit-protocol, and fair communication channels

Automating Verification of State Machines with Reactive Designs and Isabelle/UTP

State-machine based notations are ubiquitous in the description of component systems, particularly in the robotic domain. To ensure these systems are safe and predictable, formal verification techniques are important, and can be cost-effective if they are both automated and scalable. In this paper, we present a verification approach for a diagrammatic state machine language that utilises theorem proving and a denotational semantics based on Unifying Theories of Programming (UTP). We provide the necessary theory to underpin state machines (including induction theorems for iterative processes), mechanise an action language for states and transitions, and use these to formalise the semantics. We then describe the verification approach, which supports infinite state systems, and exemplify it with a fully automated deadlock-freedom check. The work has been mechanised in our proof tool, Isabelle/UTP, and so also illustrates the use of UTP to build practical verification tools.Comment: 18 pages, 16th Intl. Conf. on Formal Aspects of Component Software (FACS 2018), October 2018, Pohang, South Kore

Two-dimensional S-matrices from unitarity cuts

Using unitarity methods, we compute, for several massive two-dimensional models, the cut-constructible part of the one-loop 2 → 2 scattering S-matrices from the tree-level amplitudes. We apply our method to various integrable theories, finding evidence that for supersymmetric models the one-loop S-matrix is cut-constructible, while for models without supersymmetry (but with integrability) the missing rational terms are proportional to the tree-level S-matrix and therefore can be interpreted as a shift in the coupling. Finally, applying our procedure to the world-sheet theory for the light-cone gauge-fixed AdS5 × S 5 superstring we reproduce, at one-loop in the near-BMN expansion, the S-matrix known from integrability techniques

Improvement over time in outcomes for patients undergoing endoscopic therapy for Barrett's oesophagus-related neoplasia: 6-year experience from the first 500 patients treated in the UK patient registry.

BACKGROUND: Barrett's oesophagus (BE) is a pre-malignant condition leading to oesophageal adenocarcinoma (OAC). Treatment of neoplasia at an early stage is desirable. Combined endoscopic mucosal resection (EMR) followed by radiofrequency ablation (RFA) is an alternative to surgery for patients with BE-related neoplasia. METHODS: We examined prospective data from the UK registry of patients undergoing RFA/EMR for BE-related neoplasia from 2008 to 2013. Before RFA, visible lesions were removed by EMR. Thereafter, patients had RFA 3-monthly until all BE was ablated or cancer developed (endpoints). End of treatment biopsies were recommended at around 12 months from first RFA treatment or when endpoints were reached. Outcomes for clearance of dysplasia (CR-D) and BE (CR-IM) at end of treatment were assessed over two time periods (2008-2010 and 2011-2013). Durability of successful treatment and progression to OAC were also evaluated. RESULTS: 508 patients have completed treatment. CR-D and CR-IM improved significantly between the former and later time periods, from 77% and 56% to 92% and 83%, respectively (p<0.0001). EMR for visible lesions prior to RFA increased from 48% to 60% (p=0.013). Rescue EMR after RFA decreased from 13% to 2% (p<0.0001). Progression to OAC at 12 months is not significantly different (3.6% vs 2.1%, p=0.51). CONCLUSIONS: Clinical outcomes for BE neoplasia have improved significantly over the past 6 years with improved lesion recognition and aggressive resection of visible lesions before RFA. Despite advances in technique, the rate of cancer progression remains 2-4% at 1 year in these high-risk patients. TRIAL REGISTRATION NUMBER: ISRCTN93069556

Modified constraint-induced movement therapy or bimanual occupational therapy following injection of Botulinum toxin-A to improve bimanual performance in young children with hemiplegic cerebral palsy: a randomised controlled trial methods paper

<p>Abstract</p> <p>Background</p> <p>Use of Botulinum toxin-A (BoNT-A) for treatment of upper limb spasticity in children with cerebral palsy has become routine clinical practice in many paediatric treatment centres worldwide. There is now high-level evidence that upper limb BoNT-A injection, in combination with occupational therapy, improves outcomes in children with cerebral palsy at both the body function/structure and activity level domains of the International Classification of Functioning, Disability and Health. Investigation is now required to establish what amount and specific type of occupational therapy will further enhance functional outcomes and prolong the beneficial effects of BoNT-A.</p> <p>Methods/Design</p> <p>A randomised, controlled, evaluator blinded, prospective parallel-group trial. Eligible participants were children aged 18 months to 6 years, diagnosed with spastic hemiplegic cerebral palsy and who were able to demonstrate selective motor control of the affected upper limb. Both groups received upper limb injections of BoNT-A. Children were randomised to either the modified constraint-induced movement therapy group (experimental) or bimanual occupational therapy group (control). Outcome assessments were undertaken at pre-injection and 1, 3 and 6 months following injection of BoNT-A. The primary outcome measure was the Assisting Hand Assessment. Secondary outcomes included: the Quality of Upper Extremity Skills Test; Pediatric Evaluation of Disability Inventory; Canadian Occupational Performance Measure; Goal Attainment Scaling; Pediatric Motor Activity Log; modified Ashworth Scale and; the modified Tardieu Scale.</p> <p>Discussion</p> <p>The aim of this paper is to describe the methodology of a randomised controlled trial comparing the effects of modified constraint-induced movement therapy (a uni-manual therapy) versus bimanual occupational therapy (a bimanual therapy) on improving bimanual upper limb performance of children with hemiplegic cerebral palsy following upper limb injection of BoNT-A. The paper outlines the background to the study, the study hypotheses, outcome measures and trial methodology. It also provides a comprehensive description of the interventions provided.</p> <p>Trial Registration</p> <p>ACTRN12605000002684</p