Interpretable representations of gene expression are used to define cellular identities and the molecular programs active within cells, two related, but distinct phenomena. In the case of microglia, a cell type with high transcriptomic, functional, and morphological heterogeneity, the predominant representation of transcriptomic data presumes the adoption of distinct molecular identities, despite a lack of easily separable transcriptional states. Here, we explore alternative transcriptomic representations by comparing two single-cell analysis methods: differential expression analysis for identities and co-expression network analysis for molecular programs. For microglia, co-expression network analysis identifies highly significant functional ontologies not resolved by differential expression analysis. The identified co-expression modules are preserved across transcriptomic datasets and suggest reducible functional programs that activate and modulate depending on context. We conclude that co-expression analysis constitutes a best practice for single cell analysis of an individual cell type and describing microglia function as concurrent molecular programs offers a more parsimonious model of microglia function.

Hoare-style inference rules for program constructs permit the copying of expressions and tests from program text into logical contexts. It is known that this requires care even for sequential programs but much more serious issues arise with concurrent programs because of potential interference to the values of variables. The “rely-guarantee” approach tackles the challenge of recording acceptable interference and offers a way to provide safe inference rules for concurrent constructs. This paper shows how the algebraic presentation of rely-guarantee ideas can clarify and formalise the conditions for safely re-using expressions and tests from program text in logical contexts for reasoning about concurrent programs; crucially this extends to handling expressions that reference more than one shared variable. A non-trivial example related to the Fischer-Galler forest representation of equivalence relations is treated.

The interference effect associated with concurrent training has been widely debated. A recent model suggests that including sprint interval training as the endurance component may attenuate this effect. However, studies examining the impact of sprint interval training-based concurrent training on neuromuscular and cardiorespiratory adaptations are limited. This systematic review with meta-analysis evaluated the effects of concurrent training programs including sprint interval training on strength, hypertrophy, maximum oxygen consumption, and sprint performance. Searches were conducted in PubMed, Embase, and SPORTDiscus, following Preferred Reporting Items for Systematic Reviews and Meta-Analyses 2020 guidelines. Randomized controlled trials in healthy adults (≥18 y) comparing sprint interval training-based concurrent training with resistance training alone, including at least six supervised sessions over 2 weeks, were eligible. Nine studies (177 participants) met the inclusion criteria. Pooled analyses showed no significant differences between sprint interval training combined with resistance training and resistance training alone for lower-body strength (standardized mean difference=0.01; p = 0.94), upper-body strength (standardized mean difference=- 0.06; p = 0.83), jump performance (standardized mean difference=0.11; p = 0.11), or sprint performance (standardized mean difference=- 0.01; p = 0.95). However, sprint interval training combined with resistance training significantly improved maximum oxygen consumption compared with resistance training alone (standardized mean difference=0.78; p = 0.001). Sensitivity analysis revealed greater jump gains with short sprint protocols (≤10 s; standardized mean difference=0.41; p = 0.025). These findings indicate that introducing sprint interval training into concurrent training enhances cardiorespiratory fitness without compromising strength or power and may potentiate jump performance when short sprints are used.

This systematic review focuses on the effect of concurrent high-intensity interval training (HIIT) and resistance training on musculoskeletal function in adult individuals. Four electronic databases (PubMed, Web of Science Core Collection, Scopus, and PsycINFO) were searched for controlled trials in older or middle-aged adults, in recreationally exercising adults, and in athletic or tactical populations, which completed parallel HIIT and resistance training and described musculoskeletal responses to the intervention up to 30 November 2025. A total of 18 trials fulfilled the eligibility criterion and were synthesized narratively across the domains of maximal strength, explosive performance, neuromuscular activity, muscle morphology and architecture, tendon-related outcomes, and adherence and safety. Most 8- to 12-week interventions maintained two to three weekly resistance sessions and were designed in time-effective HIIT formats, increasing or preserving maximal strength in older subjects as well as younger ones that were trained. Explosive performance metrics, including both jump and sprint tasks, were usually preserved or even improved by the maintenance of the power-oriented component in resistance-based exercise sessions. The limited electromyography data indicated improved neuromuscular activation during submaximal tasks, particularly in older subjects, whereas some studies reported subtle increases or maintenance of muscle size and selective architectural patterns during application of progressive loading. Tendon-specific adaptations are difficult to measure, as imaging was seldom available, but functional tasks influenced by the muscle-tendon unit have been studied in multiple studies. Adherence was good, and adverse events were rare in all studies. Overall, the evidence suggests that well-designed concurrent HIIT and resistance training programs can improve or maintain musculoskeletal performance, although the magnitude and expression of these adaptations vary according to population characteristics and intervention design. Importantly, by integrating neuromuscular, morphological, and performance-related outcomes across diverse adult populations, this review provides a musculoskeletal-centered synthesis that extends prior concurrent training reviews beyond cardiorespiratory or interference-focused perspectives.

Large organizations face a critical systems integration challenge when executing multiple concurrent security modernization programs. This paper examines the U.S. Department of Defense’s simultaneous implementation of three transformational initiatives—post-quantum cryptography (PQC) migration, Zero Trust Architecture (ZTA) deployment, and AI security assurance—each operating under separate governance structures, timelines, and compliance frameworks. Through systematic evidence synthesis of 59 sources (47 policy/standards documents and 12 performance benchmarks), we identify cross-program dependencies that create integration failures when programs operate in isolation. We propose a shared modernization substrate—a four-layer infrastructure architecture (Cryptographic Services, Identity Management, Analytics Pipeline, Policy Orchestration) that enables coordinated execution while preserving program independence. The framework addresses the fundamental systems challenge of achieving interoperability across programs with misaligned schedules and competing resource demands. We introduce a five-level Triad Convergence Maturity Model (TCMM) with operationalized indicators enabling repeatable organizational assessment. Illustrative application to three DoD modernization contexts demonstrates the framework’s ability to differentiate maturity levels. Performance analysis synthesizes published benchmark data: enterprise PQC latency overhead is modest (measured), while tactical environment estimates of 158–383% overhead are derived from benchmark extrapolation under packet-loss assumptions (modeled). Scenario modeling suggests that coordinated incident response through the substrate architecture could substantially reduce risk exposure windows compared to siloed approaches (modeled). The framework transforms fragmented program execution into synchronized systems modernization, offering practical guidance for chief information officers, program managers, and enterprise architects managing concurrent technology transitions.

In concurrent programming, Software Transactional Memory (STM) provides an efficient mechanism formanaging shared memory in parallel computations, avoiding common issues like locks and deadlocks. Acrucial aspect of STM systems is the implementation of transactional variables (TVars), whichsignificantly influence concurrency levels, execution time, and memory overhead. Two primaryimplementations of TVars—nested and non-nested—present distinct advantages and trade-offs. This studyevaluates and compares the effects of nested and non-nested TVar implementations on STM performance,focusing on concurrency, execution time, rollback complexity, and memory overhead. Using the Haskellprogramming language with STM libraries under GHC version 8.6.5, both implementations weredeveloped and tested on a system with an Intel Core i5-1035G1 CPU @ 1.20 GHz, 8 GB DDR4 RAM, anda 512 GB Intel 660p NVMe SSD running Windows 11 Pro. Each configuration executed multiple depositand withdrawal operations over ten iterations: the non-nested version processed approximately 20 STMoperations in a total time of 2.0 seconds, while the nested version performed about 50 operations in 4.0seconds due to additional nested balance adjustments. Execution time and memory usage were measuredusing Haskell’s runtime and heap profiling tools (+RTS -p -hy). The results demonstrate that nested TVarsimprove concurrency by localizing conflicts within sub-transactions, achieving an average operationalthroughput approximately 25% higher than the non-nested version (0.08 seconds per operation for nestedvs. 0.10 seconds for non-nested) and consuming about 38% less total heap memory (38,792 bytes vs.63,080 bytes). Non-nested TVars provide simpler implementation with slightly faster individual executionbut less effective conflict resolution under high load. These insights can guide developers in optimizingSTM-based systems by selecting appropriate TVar models based on the concurrency demands andcomplexity of their applications.

Abstract Abstract: Correlations Between MOTS-c, Body Fat, and Muscle Strength in a Diverse Ethnic Cohort of Breast Cancer Survivors in Hawai'i Background: Mitochondria Open Reading Frame within the Twelve S rRNA c (MOTS-c) is known to respond to exercise, influencing metabolic, cardiovascular, and muscular systems. However, the connection between MOTS-c and markers of health and fitness in Asian cancer survivors is underexplored. Our study aimed to examine the impact of a 12-week concurrent exercise program on MOTS-c levels in Asian breast cancer survivors and determine if anthropometric and fitness-related factors correlate with pre- and post-exercise MOTS-c levels. Methods: Twenty-five breast cancer survivors participated in a 12-week concurrent exercise program. Metrics were assessed before and after the exercise program, including visceral/subcutaneous fat mass, volume, bone mass density (BMD), bone mineral content (BMC), body fat percentage, 1-repetition maximum (1-RM) strength, isokinetic peak torque and maximum work, as well as cardiorespiratory (VO2 peak) and muscular endurance. Plasma MOTS-c was measured using an in-house enzyme-linked immunosorbent assay. Statistical analyses, including t-tests and correlation analyses, were conducted. Results: There was a significant 8.3±13.0% increase in MOTS-c levels following exercise (pre: 254.6±39.9 pg/ml, post: 272.5±36.0 pg/ml, p=0.015). Based on varying responses, the participants were divided into two groups: low responders (n=11) and high responders (n=14). Eight low responders showed a decrease in MOTS-c after exercise, while high responders showed an 18% increase. Pre-exercise MOTS-c levels were positively correlated with baseline body mass, body fat percentage, muscular strength, isokinetic maximum work/torque, and changes in BMD and BMC (p<0.05) but not VO2 peak (p>0.05). When analyzed separately for low and high responders, these significant correlations were only present in the high responder group. Additionally, MOTS-c showed a weak negative correlation with muscular endurance as measured by the chair squat test, but for the high responders, a significant negative relationship was found between MOTS-c and core endurance, assessed by plank hold performance (p=0.0145). Summary: Our study showed significant improvement in MOTS-c levels following our exercise program, with high responders showing significant correlations between MOTS-c and body fat, skeletal muscular strength, and BMD and BMC. This exemplified that MOTS-c is associated with bone and metabolic health. Since MOTS-c is correlated with strength but not endurance, strength training should be emphasized in exercise programs aimed at improving cancer survivorship outcomes. Citation Format: J. Fukui, L. Imai, C. Shen, K. Baron, M. Toyama, I. Pagano, A. Oamil, H. Kumagai, J. Wan, P. Cohen, P. Yamada, C. Teranishi-Hashimoto. Correlations Between MOTS-c, Body Fat, and Muscle Strength in a Diverse Ethnic Cohort of Breast Cancer Survivors in Hawai'i [abstract]. In: Proceedings of the San Antonio Breast Cancer Symposium 2025; 2025 Dec 9-12; San Antonio, TX. Philadelphia (PA): AACR; Clin Cancer Res 2026;32(4 Suppl):Abstract nr PS1-04-21.

In this article, we consider a special class of liveness properties for systems consisting of concurrent objects. These properties ensure the termination of methods calls under certain fairness assumptions and thus the progress of the execution. Liveness properties are defined for concurrent objects and they typically include lock-freedom , wait-freedom , deadlock-freedom , starvation-freedom, and obstruction-freedom . It is known that these five liveness properties are decidable for sequential consistency (SC) memory model of finite-state programs with a bounded number of processes. However, the problem of decidability of liveness for finite state concurrent programs running on relaxed memory models remains open. In this article, we address the decidability problem of liveness properties of concurrent objects for the total store order (TSO) memory model which is used in the x86 architecture. In particular, we prove that for a bounded number of processes, lock-freedom, wait-freedom, deadlock-freedom and starvation-freedom are undecidable, and that obstruction-freedom is decidable on TSO for a bounded number of processes. Further on, we investigate the verification problem of k -bounded wait-freedom , a bounded version of wait-freedom, and show that for each bound k , the problem of checking k -bounded wait-freedom is decidable on TSO for a bounded number of processes. We show that the complexity for checking obstruction-freedom and checking k -bounded wait-freedom are both non-primitive recursive. We also discover an interesting difference between liveness on TSO and that on SC. Our finding is that wait-freedom implies k -bounded wait-freedom for some k on SC memory model, but this implication does not hold on the TSO model. We prove this by generating a concrete object on TSO that is wait-free but not k -bounded wait-free for any k .

Nevin, J, Suffield, C, Mutch, S, Glass, M, Sadler, S, Mclay, W, Coonan, L, Glass, M, Sadler, S, Penver, R, and Beckingham, J. The effectiveness of a 10-week concurrent strength and endurance training program on the physical readiness of trained British Army soldiers. J Strength Cond Res 40(2): e189-e196, 2026-The aim of this study was to investigate the efficacy of a 10-week concurrent strength and endurance training program in comparison with traditional military physical training (PT) practices on the physical readiness of trained British Army personnel. Forty-eight, fully trained British Army infantry soldiers (men: n = 45; women: n = 3) were randomly assigned into either an experimental or control group. Baseline and post-testing measures included body mass, standing broad jump, seated medicine ball throw, 1 repetition maximum (1RM) hex bar deadlift, 100-m shuttle run, pull-ups, and 2-km run. Subjects in the experimental group followed a 10-week concurrent strength and endurance training program based on a block periodization model, whereas subjects in the control group completed a 10-week program based on traditional military PT practices (i.e., circuit training, steady-state running). Results indicated a greater effect size in all measures in the experimental group than in the control group with a significant (p < 0.001) improvement observed in 1RM hex bar deadlift and pull-up performance. Findings from this study demonstrate that a concurrent training program based on a block periodization model elicits superior improvements in certain components of physical than traditional military PT practices. However, data suggest that a greater frequency and/or volume of endurance training may be required to elicit improvements in aerobic capacity. As such, it is recommended that warfighters conduct at least 2 strength and 2 endurance training sessions per week in addition to occupational task-specific training.

Soccer referees are exposed to high aerobic and anaerobic demands during match play, yet evidence regarding training strategies that simultaneously enhance speed and agility in this population remains limited. This study aimed to examine the effects of a 12-week concurrent training program on sprint and agility performance in soccer referees and to evaluate the sustainability of these effects through a follow-up assessment. To our knowledge, few intervention studies have simultaneously examined both sprint speed and agility performance in soccer referees and evaluated whether these adaptations are retained during a follow-up period. Importantly, the inclusion of a follow-up assessment provides evidence on the retention of training-induced adaptations, which has rarely been examined in referee populations under applied field-based training conditions. Fifty male soccer referees officiating in amateur leagues were assigned to a control group (n = 25) or an experimental group (n = 25). Both groups completed standard referee training twice weekly for 12 weeks, while the experimental group additionally performed concurrent training sessions combining endurance-based interval running and strength-power exercises twice per week. Sprint and agility performance were assessed using the 100 m sprint test and the Illinois Agility Test at pre-test, post-test, and 7-week follow-up. Data were analyzed using two-way mixed repeated measures ANOVA. Significant Group × Time interaction effects were observed for both sprint and agility performance (p < 0.01) with moderate-to-large interaction effects. The experimental group demonstrated greater improvements in 100 m sprint and Illinois Agility Test performance compared with the control group following the intervention. Importantly, these performance gains were largely maintained at follow-up, indicating sustained training adaptations. A 12-week concurrent training program integrated into standard referee conditioning resulted in significant and sustained improvements in speed and agility performance. These findings highlight the effectiveness of concurrent training as a multidimensional approach to enhancing physical capacities that are critical for soccer refereeing and support its practical implementation within referee training programs. These results support the integration of concurrent training into referee conditioning programs to improve movement efficiency and match positioning capacity. Practitioners may consider concurrent training as a feasible strategy to improve and maintain key physical qualities required for match positioning across competitive phases.

We consider the System V operation over a set of Dijkstra semaphores as a formal system and prove its Turing completeness. In this way, we define place-transition nets with a novel, stepless semantics, which implement transition firing rules similar to those of Petri and Salwicki. Each transition represents a thread, repeating an operation over a set of semaphores, which specify transition's incident arcs. To represent an efficient Sleptsov-Salwicki firing rule, a generalized operation over a set of semaphores is introduced. This opens prospects for fast asynchronous hardware and software implementations for the corresponding graphical language of concurrent programming.

Type 2 diabetes (T2DM) is linked to impaired metabolic and cardiovascular health, and concurrent exercise is a key intervention to enhance these outcomes. However, the effect of exercise sequence on these outcomes remains unclear. This study aimed to examine the effects of 12 weeks of concurrent training, performed in different sequences of aerobic and resistance exercise, on VO₂ Peak, glucose tolerance area under the curve (GT AUC), waist-to-hip ratio (WHR), and body mass index (BMI) in patients with T2DM. In this randomized controlled trial, participants were allocated to Concurrent Aerobic-Resistance Training (CART = 13), Concurrent Resistance-Aerobic Training (CRAT = 13), or a control group (COG = 13). Training was conducted three times per week for 12 weeks. VO₂ Peak, GT AUC, WHR, and BMI were measured pre- and post-intervention. Data were analyzed using a mixed-model ANOVA to assess Group × Time interactions, followed, when significant, by Bonferroni-adjusted post hoc pairwise comparisons across groups to identify differences in intervention-related changes. Both CART and CRAT significantly improved VO₂ Peak, GT AUC, WHR, and BMI compared to the control group (p < .05). VO₂ Peak increased by 2.999 mL/kg/min in CART and 2.147 mL/kg/min in CRAT, while GT AUC decreased by 23.01 and 24.22 units, respectively, reflecting enhanced cardiovascular fitness and glucose tolerance. WHR decreased by 0.106 in CART and 0.095 in CRAT, whereas BMI reduction was greater in CART (2.76kg/m²) than in CRAT (1.48kg/m²), suggesting a potential effect of exercise sequence on obesity indices. Twelve weeks of concurrent training effectively enhanced cardiovascular fitness, glycemic control, and obesity indices in T2DM patients. While both exercise sequences provided benefits, performing aerobic exercise before resistance training may maximize BMI reduction, whereas improvements in VO₂ Peak, reduction in WHR, and glucose tolerance occur regardless of exercise order. These findings support adopting flexible, evidence-based concurrent training programs for metabolic and cardiovascular health. 02 September 2025, Registration no: PACTR202509591505325.

Recurrence sets characterize non-termination in sequential programs. We present a generalization of recurrence sets to concurrent programs that run on weak memory models. Sequential programs have operational semantics in terms of states and transitions, and classical recurrence sets are defined as sets of states that are existentially closed under transitions. Concurrent programs have axiomatic semantics in terms of executions, and our new recurrence sets are defined as sets of executions that are existentially closed under extensions. The semantics of concurrent programs is not only affected by the memory model, but also by fairness assumptions about its environment, be it the scheduler or the memory subsystems. Our new recurrence sets are formulated relative to such fairness assumptions. We show that our recurrence sets are sound for proving fair non-termination on all practical memory models, and even complete on many. To turn our theory into practice, we develop a new automated technique for proving fair non-termination in concurrent programs on weak memory models. At the heart of this technique is a finite representation of recurrence sets in terms of execution-based lassos. We implemented a lasso-finding algorithm in Dartagnan, and evaluated it on a number of programs running under CPU and GPU memory models.

We use the theory of algebraic effects to give a complete equational axiomatization for dynamic threads. Our method is based on parameterized algebraic theories, which give a concrete syntax for strong monads on functor categories, and are a convenient framework for names and binding. Our programs are built from the key primitives 'fork' and 'wait'. 'Fork' creates a child thread and passes its name (thread ID) to the parent thread. 'Wait' allows us to wait for given child threads to finish. We provide a parameterized algebraic theory built from fork and wait, together with basic atomic actions and laws such as associativity of 'fork'. Our equational axiomatization is complete in two senses. First, for closed expressions, it completely captures equality of labelled posets (pomsets), an established model of concurrency: model complete. Second, any two open expressions are provably equal if they are equal under all closing substitutions: syntactically complete. The benefit of algebraic effects is that the semantic analysis can focus on the algebraic operations of fork and wait. We then extend the analysis to a simple concurrent programming language by giving operational and denotational semantics. The denotational semantics is built using the methods of parameterized algebraic theories and we show that it is sound, adequate, and fully abstract at first order for labelled-poset observations.

Effect handlers offer a powerful and relatively simple mechanism for controlling a program's flow of execution. Since their introduction, an impressive array of verification tools for effect handlers has been developed. However, to this day, no framework can express and prove relational properties about programs that use effect handlers in languages such as OCaml and Links, where programming features like mutable state and concurrency are readily available. To this end, we introduce blaze, the first relational separation logic for effect handlers. We build blaze on top of the Rocq implementation of the Iris separation logic, thereby enjoying the rigour of a mechanised theory and all the reasoning properties of a modern fully-fledged concurrent separation logic, such as modular reasoning about stateful concurrent programs and the ability to introduce user-defined ghost state. In addition to familiar reasoning rules, such as the bind rule and the frame rule, blaze offers rules to reason modularly about programs that perform and handle effects. Significantly, when verifying that two programs are related, blaze does not require that effects and handlers from one program be in correspondence with effects and handlers from the other. To assess this flexibility, we conduct a number of case studies: most noticeably, we show how different implementations of an asynchronous-programming library using effects are related to truly concurrent implementations. As side contributions, we introduce two new, simple, and general reasoning rules for concurrent relational separation logic that are independent of effects: a logical-fork rule that allows one to reason about an arbitrary program phrase as if it had been spawned as a thread and a thread-swap rule that allows one to reason about how threads are scheduled.

A key computational question underpinning the automated testing and verification of concurrent programs is the consistency question — given a partial execution history, can it be completed in a consistent manner? Due to its importance, consistency testing has been studied extensively for memory models, as well as for database isolation levels. A common theme in all these settings is the use of shared-memory as the primal mode of interthread communication. On the other hand, modern programming languages, such as Go, Rust and Kotlin, advocate a paradigm shift towards channel-based (i.e., message-passing) communication. However, the consistency question for channel-based concurrency is currently poorly understood. In this paper we lift the study of fundamental consistency problems to channels, taking into account various input parameters, such as the number of threads executing, the number of channels, and the channel capacities. We draw a rich complexity landscape, including upper bounds that become polynomial when certain input parameters are fixed, as well as hardness lower bounds. Our upper bounds are based on algorithms that can drive the verification of channel consistency in automated verification tools. Our lower bounds characterize minimal input parameters that are sufficient for hardness to arise, and thus shed light on the intricacies of testing channel-based concurrency. In combination, our upper and lower bounds characterize the boundary of tractability/intractability of verifying channel consistency, and imply that our algorithms are often (nearly) optimal. We have also implemented our main consistency checking algorithm and designed optimizations to enhance its performance. We evaluated the performance of our implementation over a set of 103 instances obtained from open source Go projects, and compared it against a constraint-solving based algorithm. Our experimental results demonstrate the power of our consistency-checking algorithm; it scales to around 1M events, and is significantly faster in running-time performance, compared to a constraint-solving approach.

The Message Passing Interface (MPI) is widely used in parallel, high-performance programming, yet writing bug-free software that uses MPI remains difficult. We introduce DafnyMPI, a novel, scalable approach to formally verifying MPI software. DafnyMPI allows proving deadlock freedom, termination, and functional equivalence with simpler sequential implementations. In contrast to existing specialized frameworks, DafnyMPI avoids custom concurrency logics and instead relies on Dafny, a verification-ready programming language used for sequential programs, extending it with concurrent reasoning abilities. DafnyMPI is implemented as a library that enables safe MPI programming by requiring users to specify the communication topology upfront and to verify that calls to communication primitives such as MPI_ISEND and MPI_WAIT meet their preconditions. We formalize DafnyMPI using a core calculus and prove that the preconditions suffice to guarantee deadlock freedom. Functional equivalence is proved via rely-guarantee reasoning over message payloads and a system that guarantees safe use of read and write buffers. Termination and the absence of runtime errors are proved using standard Dafny techniques. To further demonstrate the applicability of DafnyMPI, we verify numerical solutions to three canonical partial differential equations. We believe DafnyMPI demonstrates how to make formal verification viable for a broader class of programs and provides proof engineers with additional tools for software verification of parallel and concurrent systems.

In the current state of global political, environmental and social challenges, it is perhaps unsurprising that digital childhoods and parenting are in continuous flux as well, with families of all configurations experiencing digital and cultural ruptures. In Australia this discontent with the digital world has led to unprecedented legislation banning all children under the age of 16 from having accounts on social media platforms from December 2025. Despite being popular with the broader public, mental health advocates and most academic research suggest the ban is more likely to do harm than good for Australian children’s health and wellbeing. Paper 1 focuses on this rupture to Australian children’s digital lives. Parents are also conflicted in attempting to balance the young children’s privacy with the connectivity and support that may come in sharing images or stories that includes young people’s photos and data. Paper 2 focuses on these privacy ruptures. Despite being widely seen as outdated in scholarly circles, the focus on screen time, measuring children’s time before a screen without context or questioning the quality of the experience, continues to be a dominant idea Australian families wrestle with. Paper 3 focuses on the ruptures that screen time as a concept continues to bring to families and parenting in particular. And now Generative AI tools present new challenges as they are integrated widely into new and existing platforms and apps without concurrent programs to raise users’ literacy as families and children are increasingly using these tools. The way Generative AI ‘imagines’ children, families and Australianess is the focus of paper 4. These Australian examples speak to similar concerns globally, with parents and children around the world wrestling similar issues, contextualized locally. Other national governments are similarly considering social media bans for children, and thus watching the Australian experiences with implementing the ban, and attempting to enforce age verification, with great interest. This panel presents four papers which explore these ruptures in the Australian context, but with clear global implications.

ABSTRACT Memory models define the order in which accesses to shared memory in a concurrent system may be observed to occur. Such models are a necessity since program order is not a reliable indicator of execution order , due to microarchitectural features or compiler transformations. Concurrent programming, already a challenging task, is thus made even harder when weak memory effects must be addressed. A rigorous specification of weak memory models is therefore essential to make this problem tractable for developers of safety‐ and security‐critical, low‐level software. In this paper we survey the field of formalisations of weak memory models, including their specification, their effects on execution, and tools and inference systems for reasoning about code. To assist the discussion we also provide an introduction to two styles of formal representation found commonly in the literature (using a much simplified version of Intel's x86 as the example): a step‐by‐step construction of traces of the system ( operational semantics ); and with respect to relations between memory events ( axiomatic semantics ). The survey covers some long‐standing hardware features that lead to observable weak behaviours, a description of historical developments in practice and in theory, an overview of computability and complexity results, and outlines current and future directions in the field.

ABSTRACT Problematic alcohol use is common among men who perpetrate intimate partner violence (IPV). Alcohol misuse and deficits in social and cognitive skills are risk factors for IPV and general recidivism. The present study assessed data from 7781 men who had perpetrated IPV, collected using the Service Planning Instrument (SPIn). Men who reported that alcohol use had disrupted their functioning or contributed to their criminal activities were more likely to have general and violent reoffenses. We examined the interaction between alcohol use and social and cognitive risk factors and general and violent recidivism at 3‐year follow‐up. Although variables relating to alcohol use and social and cognitive risk factors were individually related to any and violent recidivism, this study found little evidence that these factors interacted together to influence reoffending rates. Recommendations for case management, including concurrent IPV and alcohol treatment programming, and future research are discussed in light of these findings.