bluuebunny/crossref_metadata_2025_split huggingface dataset:
The WhyRel Prototype for Modular Relational Verification of Pointer Programs
Authors: Nagasamudram Ramana , Banerjee Anindya , Naumann David A. 
Published: April 2023

Abstract Verifying relations between programs arises as a task in various verification contexts such as optimizing transformations, relating new versions of programs with older versions (regression verification), and noninterference. However, relational verification for programs acting on dynamically allocated mutable state is not well supported by existing tools, which provide a high level of automation at the cost of restricting the programs considered. Auto-active tools, on the other hand, require more user interaction but enable verification of a broader class of programs. This article presents WhyRel, a tool for the auto-active verification of relational properties of pointer programs based on relational region logic. WhyRel is evaluated through verification case studies, relying on SMT solvers orchestrated by the Why3 platform on which it builds. Case studies include establishing representation independence of ADTs, showing noninterference, and challenge problems from recent literature.
Computing Adequately Permissive Assumptions for Synthesis
Authors: Anand Ashwani , Mallik Kaushik , Nayak Satya Prakash , Schmuck Anne-Kathrin 
Published: April 2023

AbstractWe automatically compute a new class of environment assumptions in two-player turn-based finite graph games which characterize an “adequate cooperation” needed from the environment to allow the system player to win. Given an $$\omega $$-regular winning condition $$\varPhi $$ for the system player, we compute an $$\omega $$-regular assumption $$\varPsi $$ for the environment player, such that (i) every environment strategy compliant with $$\varPsi $$ allows the system to fulfill $$\varPhi $$ (sufficiency), (ii) $$\varPsi $$ can be fulfilled by the environment for every strategy of the system (implementability), and (iii) $$\varPsi $$ does not prevent any cooperative strategy choice (permissiveness).For parity games, which are canonical representations of $$\omega $$-regular games, we present a polynomial-time algorithm for the symbolic computation of adequately permissive assumptions and show that our algorithm runs faster and produces better assumptions than existing approaches—both theoretically and empirically. To the best of our knowledge, for $$\omega $$-regular games, we provide the first algorithm to compute sufficient and implementable environment assumptions that are also permissive.
WASIM: A Word-level Abstract Symbolic Simulation Framework for Hardware Formal Verification
Authors: Fang Wenji , Zhang Hongce 
Published: April 2023

AbstractThis paper demonstrates the design and usage of WASIM, a word-level abstract symbolic simulation framework with pluggable abstraction/refinement functions. WASIM is useful in the formal verification of functional properties on register-transfer level (RTL) hardware designs. Users can control the symbolic simulation process and tune the level of abstraction by interacting with WASIM through its Python API. WASIM can be used to directly check formal properties on symbolic traces or to extract useful fragments from symbolic representations to construct safe inductive invariants as a correctness certificate. We demonstrate the utility of WASIM on the verification of two pipelined hardware designs. WASIM and the case studies are available under open-source license at: [9].
Industrial-Strength Controlled Concurrency Testing for $$\textsc {C}{} \texttt {\#} $$ Programs with $$\textsc {Coyote} $$
Authors: Deligiannis Pantazis , Senthilnathan Aditya , Nayyar Fahad , Lovett Chris , Lal Akash 
Published: April 2023

AbstractThis paper describes the design and implementation of the open-source tool $$\textsc {Coyote} $$ for testing concurrent programs written in the $$\textsc {C}{} \texttt {\#} $$ language. $$\textsc {Coyote} $$ provides algorithmic capabilities to explore the state-space of interleavings of a concurrent program, with deterministic repro for any bug that it finds. $$\textsc {Coyote} $$ encapsulates multiple ideas from the research community to offer state-of-the-art testing for $$\textsc {C}{} \texttt {\#} $$ programs, as well as an efficiently engineered implementation that has been shown robust enough to support industrial use.
Symbiotic-Witch 2: More Efficient Algorithm and Witness Refutation
Authors: Ayaziová Paulína , Strejček Jan 
Published: April 2023

AbstractThe new version of the witness validator Symbiotic-Witch follows more precisely the (fixed version of the) semantics of verification witnesses. This makes the tool more efficient as it can benefit from sink nodes. Further, the tool can now refute a witness. To sum up, Symbiotic-Witch 2 can confirm or refute violation witnesses of reachability safety, memory safety, memory cleanup, and overflow properties of sequential C programs.
EBF 4.2: Black-Box Cooperative Verification for Concurrent Programs
Authors: Aljaafari Fatimah , Shmarov Fedor , Manino Edoardo , Menezes Rafael , Cordeiro Lucas C. 
Published: April 2023

AbstractCombining different verification and testing techniques together could, at least in theory, achieve better results than each individual one on its own. The challenge in doing so is how to take advantage of the strengths of each technique while compensating for their weaknesses. EBF 4.2 addresses this challenge for concurrency vulnerabilities by creating Ensembles of Bounded model checkers and gray-box Fuzzers. In contrast with portfolios, which simply run all possible techniques in parallel, EBF strives to obtain closer cooperation between them. This goal is achieved in a black-box fashion. On the one hand, the model checkers are forced to provide seeds to the fuzzers by injecting additional vulnerabilities in the program under test. On the other hand, off-the-shelf fuzzers are forced to explore different interleavings by adding lightweight instrumentation and systematically re-seeding them.
Mopsa-C: Modular Domains and Relational Abstract Interpretation for C Programs (Competition Contribution)
Authors: Monat Raphaël , Ouadjaout Abdelraouf , Miné Antoine 
Published: April 2023

AbstractMopsa is a multilanguage static analysis platform relying on abstract interpretation. It is able to analyze C, Python, and programs mixing these two languages; we focus on the C analysis here. It provides a novel way to combine abstract domains, in order to offer extensibility and cooperation between them, which is especially beneficial when relational numerical domains are used. The analyses are currently flow-sensitive and fully context-sensitive. We focus only on proving programs to be correct, as our analyses are designed to be sound and terminating but not complete. We present our first participation to SV-Comp, where Mopsa earned a bronze medal in the SoftwareSystems category.
PIChecker: A POR and Interpolation based Verifier for Concurrent Programs (Competition Contribution)
Authors: Su Jie , Yang Zuchao , Xing Hengrui , Yang Jiyu , Tian Cong , Duan Zhenhua 
Published: April 2023

Abstract is a tool for verifying reachability properties of concurrent C programs. It moderates the trace-space explosion problem, aggravated by thread alternation, through utilizing the PC-DPOR and C-Intp techniques. The PC-DPOR technique constructs a constrained dependency graph to refine dependencies between transitions. With this basis, the inherent imprecision of the dependence over-approximation can be overcome. Thereby, many redundant equivalent traces are prevented from being explored. On the other hand, the C-Intp technique performs conditional interpolation to confine the reachable regions of states, so that infeasible conditional branches which occur more frequently in concurrent verification tasks could be pruned automatically. We have implemented the above techniques on top of the open-source program analysis framework .
Ultimate Automizer and the CommuHash Normal Form
Authors: Heizmann Matthias , Barth Max , Dietsch Daniel , Fichtner Leonard , Hoenicke Jochen , Klumpp Dominik , Naouar Mehdi , Schindler Tanja , Schüssele Frank , Podelski Andreas 
Published: April 2023

AbstractThe verification approach of Ultimate Automizer utilizes SMT formulas. This paper presents techniques to keep the size of the formulas small. We focus especially on a normal form, called CommuHash normal form that was easy to implement and had a significant impact on the runtime of our tool.
Ultimate Taipan and Race Detection in Ultimate
Authors: Dietsch Daniel , Heizmann Matthias , Klumpp Dominik , Schüssele Frank , Podelski Andreas 
Published: April 2023

AbstractUltimate Taipan integrates trace abstraction with algebraic program analysis on path programs. Taipan supports data race checking in concurrent programs through a reduction to reachability checking. Though the subsequent verification is not tuned for data race checking, the results are encouraging.
Parallel Program Analysis via Range Splitting
Authors: Haltermann Jan , Jakobs Marie-Christine , Richter Cedric , Wehrheim Heike 
Published: April 2023

AbstractRanged symbolic execution has been proposed as a way of scaling symbolic execution by splitting the task of path exploration onto several workers running in parallel. The split is conducted along path ranges which – simply speaking – describe sets of paths. Workers can then explore path ranges in parallel.In this paper, we propose ranged analysis as the generalization of ranged symbolic execution to arbitrary program analyses. This allows us to not only parallelize a single analysis, but also run different analyses on different ranges of a program in parallel. Besides this generalization, we also provide a novel range splitting strategy operating along loop bounds, complementing the existing random strategy of the original proposal. We implemented ranged analysis within the tool CPAchecker and evaluated it on programs from the SV-COMP benchmark. The evaluation in particular shows the superiority of loop bounds splitting over random splitting. We furthermore find that compositions of ranged analyses can solve analysis tasks that none of the constituent analysis alone can solve.
Towards Log Slicing
Authors: Dawes Joshua Heneage , Shin Donghwan , Bianculli Domenico 
Published: April 2023

AbstractThis short paper takes initial steps towards developing a novel approach, called log slicing, that aims to answer a practical question in the field of log analysis: Can we automatically identify log messages related to a specific message (e.g., an error message)? The basic idea behind log slicing is that we can consider how different log messages are “computationally related” to each other by looking at the corresponding logging statements in the source code. These logging statements are identified by 1) computing a backwards program slice, using as criterion the logging statement that generated a problematic log message; and 2) extending that slice to include relevant logging statements.The paper presents a problem definition of log slicing, describes an initial approach for log slicing, and discusses a key open issue that can lead towards new research directions.
Renewed Aspirations for Schools as Community Hubs
Authors: Cleveland Benjamin , McShane Ian , Chandler Philippa , Backhouse Sarah , Aston Ruth , Clinton Janet M. 
Published: April 2023

AbstractThis book explores the expanded roles of schools, investigating how they may offer more to their communities than formal education. It also discusses what schools can gain from their communities through various forms of partnership and collaboration. We explore this ‘more than a school’ idea through past examples, in current practice, and as a model for schools into the future. Uniquely, the book investigates these issues from a spatial perspective, adopting the view that school and urban infrastructure, including buildings and landscaped outdoor areas (i.e., space), matters in the context of school-community relations. Indeed, we suggest that it mediates these relations, even though such influence is infrequently mentioned in the existing literature. Aligning our research with the spatial turn in the social sciences, we argue that research into school-community connections has tended to view such relations as fundamentally social, omitting adequate consideration of the role that space plays in enabling and/or constraining connections between school administrators, students, teachers, parents, carers, and members of the wider community. Adopting a spatial approach, a range of new perspectives are offered with respect to fostering stronger school-community connections through engaging thoughtfully with the built environment. The recurring themes of partnering, planning, designing, and enabling schools as community hubs are used to structure the 20 chapters that follow the initial scene-settings chapters.
Schools as ‘Sacred Enclaves’ or ‘Community Hubs’? South Korean Experiences
Authors: Kim Hyung Min , Han GwangYa 
Published: April 2023

AbstractThis chapter illustrates the South Korean perception of and policy approaches to schools from the perspective of ‘schools as community hubs’ versus ‘schools as sacred enclaves.’ It historically reviews aspiration to education and the geographical settings for it. High residential density characteristics have created superior environments for independent commutes and interactions between pupils and community members in South Korea. While planning approaches have advocated the role of schools in community building, there have been barriers, among which children’s safety is the most crucial. This chapter juxtaposes these two views by illustrating recent challenges in the removal of school fences and providing an example of community multi-functional buildings on a school site, arguing safety should be a firm pre-condition to leverage school facilities for society-wide community benefits.
Policy for Schools as Community Hubs: Insights Into a Fragmented Environment
Authors: Polglase Robert , McShane Ian , Cleveland Benjamin 
Published: April 2023

AbstractSchools as community hubs are recognised for their significant contributions to communities. Yet, these projects must negotiate complex and often fragmented policy environments that cross government jurisdictions and disciplines to achieve stakeholder support, funding, and operate over the longer-term to deliver benefits to communities. Policy research in this area is scarce. This chapter discusses policy for schools as community hubs through the lenses of Bacchi and Goodwin’s ‘problem representation’ approach and ideas about performative and locally enacted policy. This theoretical framework is applied to Yuille Park Community College, in Victoria, Australia, as an interpretive policy analysis to reveal insights into the policy environment that was negotiated to develop this community-facing school. Now proclaimed as a ‘whole of life’ community centre, Yuille Park relied on the skill and continuity of key actors who—with little formal policy direction—coordinated solutions across service provision, urban planning, and facility design to make a difference to a struggling community, generating neighbourhood uplift and helping to overcome entrenched intergenerational challenges.
School and Community Infrastructure Networks: What Might These Look Like?
Authors: Miles Natalie , Cleveland Benjamin , Chandler Philippa 
Published: April 2023

AbstractThis chapter asks, ‘How might school and community infrastructure networks be conceived, and what might they look like?’ Through an exploratory review of the literature, the relationships between school and community infrastructures are investigated and connections and boundaries between different forms of infrastructure for community use are discussed. A network theory approach is adopted to explore emerging insights into how school facilities and other community assets (buildings and landscaped areas) might better support whole-of-community development, education, and wellbeing. Historically, the opposing design objectives of connection and security have challenged the development of schools as locations for community use, often resulting in facilities that are inadequately planned or resolved in their design to meet the needs of multiple user-groups. Might the reappraisal of school planning and design enable new and improved connections with other community infrastructures? Might planning and designing community facilities with school users in mind improve their utility? Drawing together various discourses in the literature, a network model is proposed to represent relationships between school and community infrastructures. This is intended to encourage planning authorities to explore potentially better integrated, more effective, and financially more efficient models of infrastructure provision for community use—especially in fast growing areas on the edges of Australia’s largest cities where demand for community services and infrastructure is high, but resources are stretched.
Simplified likelihoods using linearized systematic uncertainties
Authors: Berger N. 
Published: April 2023

Abstract
This paper presents a simplified likelihood framework designed to facilitate the reuse, reinterpretation and combination of LHC experimental results. The framework is based on the same underlying structure as the widely used HistFactory format, but with systematic uncertainties considered at linear order only. This simplification leads to large gains in computing performance for the evaluation and maximization of the likelihood function, compared to the original statistical model. The framework accurately describes non-Gaussian effects from low event counts, as well as correlated uncertainties in combinations. While primarily targeted towards binned descriptions of the data, it is also applicable to unbinned models.
In planta interactions of a novel bacteriophage against Pseudomonas syringae pv. tomato
Authors: Skliros Dimitrios , Papazoglou Polyxeni , Gkizi Danai , Paraskevopoulou Eleni , Katharios Pantelis , Goumas Dimitrios E , Tjamos Sotirios , Flemetakis Emmanouil 
Published: April 2023

Abstract
The biology and biotechnology of bacteriophages have been extensively studied in recent years to explore new and environmentally friendly methods of controlling phytopathogenic bacteria. Pseudomonas syringae pv. tomato (Pst) is responsible for bacterial speck disease in tomato plants, leading to decreased yield. Disease management strategies rely on the use of copper-based pesticides. The biological control of Pst with the use of bacteriophages could be an alternative environmentally friendly approach to diminish the detrimental effects of Pst in tomato cultivations. The lytic efficacy of bacteriophages can be used in biocontrol-based disease management strategies. Here, we report the isolation and complete characterization of a bacteriophage, named Medea1, which was also tested in planta against Pst, under greenhouse conditions. The application of Medea1 as a root drenching inoculum or foliar spraying reduced 2.5- and fourfold on average, respectively, Pst symptoms in tomato plants, compared to a control group. In addition, it was observed that defense-related genes PR1b and Pin2 were upregulated in the phage-treated plants. Our research explores a new genus of Pseudomonas phages and explores its biocontrol potential against Pst, by utilizing its lytic nature and ability to trigger the immune response of plants.

Key points
• Medea1 is a newly reported bacteriophage against Pseudomonas syringae pv. tomato having genomic similarities with the phiPSA1 bacteriophage
• Two application strategies were reported, one by root drenching the plants with a phage-based solution and one by foliar spraying, showing up to 60- and 6-fold reduction of Pst population and disease severity in some cases, respectively, compared to control
• Bacteriophage Medea1 induced the expression of the plant defense-related genes Pin2 and PR1b
Multimodal imaging findings of intrahepatic cholangiocarcinoma arising from a biliary adenofibroma: a case report with radiological–pathological correlation
Authors: Kanemaru Noriko , Nakai Yudai , Watadani Takeyuki , Nakao Takahiro , Hinata Munetoshi , Nakazawa Akiko , Akamatsu Nobuhisa , Ushiku Tetsuo , Hasegawa Kiyoshi , Abe Osamu 
Published: April 2023

Abstract
Purpose
Biliary adenofibroma is a solid microcystic epithelial neoplasm in the liver, comprising microcystic and tubuloacinar glandular tissues lined by a non-mucin secreting biliary epithelium and supported by a fibrous stroma. It is an extremely rare benign tumor with potential for malignant transformation. Herein, we report the case of a 64-year-old woman diagnosed with intrahepatic cholangiocarcinoma arising from biliary adenofibroma.

Methods
Imaging studies revealed a tumor of 50 mm diameter, consisting of two components in S1 of the liver. The ventral portion of the tumor showed an ill-defined mass with early peripheral and gradual centripetal enhancement invading to the middle hepatic vein on computed tomography (CT), diffusion restriction on magnetic resonance images, and high fluorine-18-2-deoxy-d-glucose (FDG) uptake on positron emission tomography, like conventional intrahepatic cholangiocarcinoma. The dorsal portion showed a well-defined and low-attenuated mass with heterogeneous early enhancement and partial wash-out on CT, marked hyperintensity on heavily T2-weighted images, and low FDG uptake. The patient subsequently underwent extended left hepatectomy.

Results
Pathologically, the former was diagnosed as cholangiocarcinoma and the latter as biliary adenofibroma. We discuss the radiological-pathological correlation of the tumor with a literature review.

Conclusion
Preoperative diagnosis of biliary adenofibroma is extremely challenging; however, clinically, it is crucial not to miss the presence of malignant findings.

Graphical abstract
Allogeneic hematopoietic stem cell transplantation remains a feasible approach for elderly with acute myeloid leukemia: a 10-year experience
Authors: Duda Katarzyna , Wieczorkiewicz-Kabut Agata , Koclęga Anna , Zielińska Patrycja , Woźniczka Krzysztof , Krzemień Helena , Armatys Anna , Helbig Grzegorz 
Published: April 2023

AbstractThe incidence of AML increases with age. The implementation of reduced intensity conditioning and progress in supportive care enabled to perform allo-HSCT in elderly patients. The main objective of the study was to assess the safety and efficacy of allotransplantation in elderly AML.Forty nine patients (33 males) at median age of 68 years were identified. Data on patients’ and transplant’s related variables were retrieved from our local transplant registry. Most patients (65%) were transplanted from 10/10-HLA or 9/10-HLA matched unrelated donor, seven patients (14%) received stem cells from matched related donor and ten patients (20%) from haploidentical donor. All patients received reduced-intensity conditioning (RIC). Peripheral blood was a source of stem cells in all patients except one (98%). Acute GVHD developed in 22 patients (44%) with 5 individuals presenting grade III-IV. CMV reactivation was demonstrated in 19 patients (39%) till day + 100. In total, 22 patients (45%) have died. The main causes of death included infectious complications (n = 9), relapse with subsequent chemotherapy resistance (n = 7), steroid-resistant GvHD (n = 4) and other causes (n = 2). Twenty-seven patients (55%) were alive at the last contact, presented full donor chimerism and remained in the complete remission. The probability of OS and relapse-free survival (RFS) were 57% and 81% at 2 years, respectively. Older donor age showed negative impact on relapse. CMV reactivation, the severity of acute graft versus host disease and older donor age negatively influenced survival. Allo-HSCT remains a safe, feasible and effective procedure for elderly AML patients.