bluuebunny/crossref_metadata_2025_split huggingface dataset:
Understanding the Surface Reconstruction on Ternary WxCoBx for Water Oxidation and Zinc–Air Battery Applications
Authors: Saad Ali , Gao Yang , Ramiere Aymeric , Chu Tianzhi , Yasin Ghulam , Wu Yanyan , Ibraheem Shumaila , Wang Miao , Guo Haichuan , Tsiakaras Panagiotis , Cai Xingke 
Published: March 2022

AbstractHere, the synthesis of a series of pure phase metal borides is reported, including WB, CoB, WCoB, and W2CoB2, and their surface reconstruction is studied under the electrochemical activation in alkaline solution. A cyclic voltammetric activation is found to enhance the activity of the CoB and W2CoB2 precatalysts due to the transformation of their surfaces into the amorphous CoOOH layer with a thickness of 3–4 nm. However, such surface transformation does not happen on the WB and WCoB due to their superior structure stability under the applied voltage, highlighting the importance of metal components for the surface reconstruction process. It is found that, compared with CoB, the W2CoB2 surface shows a quicker reconstruction with a larger active surface area due to the selective leaching of the W from its surface. In the meantime, the metallic W2CoB2 core underneath the CoOOH layer shows a better promotion of its oxygen evolution reaction (OER) performance than CoB. Therefore, the ternary W2CoB2 shows better OER performance than the CoB, as well as the WB and WCoB. It is also found that the mixture of W2CoB2 with Pt/C as the catalysts in air electrode for rechargeable Zn–air battery (ZAB), shows better performance than the IrO2–Pt/C couple‐based ZAB.
Bilateral trigeminal neuropathy associated with multicentric lymphoma in two dogs: Clinical presentation, MRI findings and flow cytometry characteristics
Authors: Zajc Alenka Lavra , Warwick Harry , Rosa Chantal , Grant Jessica , Marrington Mary 
Published: March 2022

AbstractA 6‐year‐old, female, neutered crossbreed and a 6.5‐year‐old, male, neutered Labrador retriever presented with oral dysphagia. Both dogs underwent investigations, including magnetic resonance imaging of the head, cytology and immunophenotyping. A diagnosis of stage Vb multicentric B‐cell lymphoma with plasmacytoid differentiation, likely Waldenstrom's macroglobulinemia with bilateral trigeminal neuropathy, Horner's syndrome and paraneoplastic hypercalcaemia was obtained in the first case. In the second case, a diagnosis of stage Vb multicentric high‐grade T‐cell lymphoma with bilateral trigeminal neuropathy and suspected paraneoplastic polycythaemia was obtained. There was no evidence of central nervous system involvement in either case. There are very few previous reports of non‐idiopathic bilateral trigeminal neuropathy secondary to multicentric lymphoma, and to the best of the authors’ knowledge, this is the first report describing the phenotypic and magnetic resonance imaging characteristics.
Introduction
Authors: Bremer Anne , Strand Roger 
Published: March 2022

AbstractThis introductory chapter gives an overview of the context in which the book was written, and goes through the central themes being addressed. The book is a result of long-held collaborations between oncologists, clinicians, philosophers, STSers, anthropologists, economists, ethicists, and media studies scholars, who, for the most part, are affiliated to the Centre for Cancer Biomarker (CCBIO), in Bergen, Norway. In addressing the issues at stake and matters of concern around precision oncology and cancer biomarker research, the authors come to see precision oncology as a sociotechnical imaginary, around which a high degree of confusion between hope and reality is observed, and where debates around the feasibility and desirability of precision medicine are altogether political, social, ethical, scientific and medical. The contributions to this book variously approach the culture of biomarker research, powered to a significant extent by a sociotechnical imaginary of precision oncology, with a focus on the following overarching themes: (i) the uncomfortable knowledge that comes to undermine the legitimacy of precision oncology by point at its shortfalls, and the lack of ambivalence in the discourses and practices around precision oncology; (ii) the dynamics of framing and overflowing, when trying to control biological, social and ethical complexity; and (iii) the role of the economy of hope in legitimising and sustaining the imaginary of precision oncology, and the starch dichotomy between illness and disease it leads to.
Cancer Currencies: Making and Marketing Resources in a First-in-Human Drug Trial in Denmark
Authors: Hillersdal Line , Svendsen Mette N. 
Published: March 2022

AbstractWelfare state service delivery is increasingly driven by public-private collaborations and strategies aimed at turning the provision of core welfare services into a profitable business at an international scale. Particularly within cancer treatment development, the cost of medical research is increasing, and many policymakers see partnerships between private and public partners as mandatory to sustain public welfare services. But how do welfare state practices and values intersect with commercial interests as cancer research becomes increasingly entangled with big pharma interests? We explore this question by investigating the collaboration between a public hospital in Denmark and a multi-national pharmaceutical company and the practical work involved in setting up and running early cancer drug trials for personalised medicine. Based on ethnographic research we analyse how competition, investment and exchange practices shape how welfare resources for personalised medicine are defined, produced, and offered. We argue that qualities facilitated by the welfare state – i.e., fast-tracking trial procedures, high-quality data and high compliance of research subjects – become currencies transactable on the global market for drug development.
HER2 Revisited: Reflections on the Future of Cancer Biomarker Research
Authors: Bremer Anne , Wik Elisabeth , Akslen Lars A. 
Published: March 2022

AbstractIn this chapter, we revisit the successful story of the HER2 biomarker for breast cancer, to reflect on the conditions of its inception, some of the reasons for its success, and the challenges met along the way. HER2 is a standard in the field of cancer biomarker research, against which all biomarkers are measured. It is also one of the central arguments used for illustrating the feasibility and desirability of precision oncology. But critically revisiting the story of HER2 shows us that it too faced a winding road from its discovery in the lab to its use in the clinic, and that it currently operates in a context of high levels of biological complexity and persistent uncertainties, in particular with regard to cancer heterogeneity and its implications. By drawing a parallel between the story of HER2 and a ‘scientific bandwagon’, we examine some of the legal, social, and economic challenges and dilemmas that HER2 faces, and conclude with some reflections on the future of cancer biomarker research. Notably, we highlight the need for a greater focus on ‘good enough’ biomarkers, particularly in the setting of precision oncology driven by hyper-precision and the wish for molecular certainty. We emphasise the importance of being open about the low success rate of 1% of published biomarkers which reach clinical practice when justifying the risks and opportunity costs of precision oncology.
Crossing the Styx: If Precision Medicine Were to Become Exact Science
Authors: Strand Roger , Chu Dominique 
Published: March 2022

AbstractThe term “precision medicine” is used to denote existing practices as well as how medical research and practice are imagined to become in the future. One important element of the imaginaries of precision medicine is the development of systems biology and computational models with the promise of numerical precision and conceptual rigour. If precision medicine were to become an exact science that relies on computational models, it might increase precision in diagnosis and treatment, specifying the right drug to the right patient at the right time. It should be noted, though, that computational models require explicit specification of the properties and boundaries of the system to be modelled, whereas cells, tissues and patients are predominantly open systems in their natural state. Accordingly, such models risk being precisely wrong instead of approximately right. Right and wrong, however, are value judgements that depend upon the aims and scope of the scientific and medical enterprise. In order for medicine to become an exact science, cells, tissues and patients would have to be reconceived and/or reconfigured as relatively closed systems with relatively deterministic behaviour. The realization of precision medicine as an exact science may thus be accompanied by a transition from a world of complex natural life to a world of reduced life or a simple delay of death; a transition to be likened with the crossing of the Styx.
A Max-SMT Superoptimizer for EVM handling Memory and Storage
Authors: Albert Elvira , Gordillo Pablo , Hernández-Cerezo Alejandro , Rubio Albert 
Published: March 2022

AbstractSuperoptimization is a compilation technique that searches for the optimal sequence of instructions semantically equivalent to a given (loop-free) initial sequence. With the advent of SMT solvers, it has been successfully applied to LLVM code (to reduce the number of instructions) and to Ethereum EVM bytecode (to reduce its gas consumption). Both applications, when proven practical, have left out memory operations and thus missed important optimization opportunities. A main challenge to superoptimization today is handling memory operations while remaining scalable. We present $$\textsf {GASOL}^{v2}$$

GASOL

v
2

, a gas and bytes-size superoptimization tool for Ethereum smart contracts, that leverages a previous Max-SMT approach for only stack optimization to optimize also wrt. memory and storage. $$\textsf {GASOL}^{v2}$$

GASOL

v
2

can be used to optimize the size in bytes, aligned with the optimization criterion used by the Solidity compiler , and it can also be used to optimize gas consumption. Our experiments on 12,378 blocks from 30 randomly selected real contracts achieve gains of 16.42% in gas wrt. the previous version of the optimizer without memory handling, and gains of 3.28% in bytes-size over code already optimized by .
Inferring Interval-Valued Floating-Point Preconditions
Authors: Krämer Jonas , Blatter Lionel , Darulova Eva , Ulbrich Mattias 
Published: March 2022

AbstractAggregated roundoff errors caused by floating-point arithmetic can make numerical code highly unreliable. Verified postconditions for floating-point functions can guarantee the accuracy of their results under specific preconditions on the function inputs, but how to systematically find an adequate precondition for a desired error bound has not been explored so far. We present two novel techniques for automatically synthesizing preconditions for floating-point functions that guarantee that user-provided accuracy requirements are satisfied. Our evaluation on a standard benchmark set shows that our approaches are complementary and able to find accurate preconditions in reasonable time.
Automated Translation of Natural Language Requirements to Runtime Monitors
Authors: Perez Ivan , Mavridou Anastasia , Pressburger Tom , Goodloe Alwyn , Giannakopoulou Dimitra 
Published: March 2022

AbstractRuntime verification (RV) enables monitoring systems at runtime, to detect property violations early and limit their potential consequences. This paper presents an end-to-end framework to capture requirements in structured natural language and generate monitors that capture their semantics faithfully. We leverage NASA’s Formal Requirement Elicitation Tool (fret), and the RV systemCopilot. We extendfretwith mechanisms to capture additional information needed to generate monitors, and introduceOgma, a new tool to bridge the gap betweenfretandCopilot. With this framework, users can write requirements in an intuitive format and obtain real-time C monitors suitable for use in embedded systems. Our toolchain is available as open source.
MaskD: A Tool for Measuring Masking Fault-Tolerance
Authors: Putruele Luciano , Demasi Ramiro , Castro Pablo F. , D’Argenio Pedro R. 
Published: March 2022

AbstractWe present , an automated tool designed to measure the level of fault-tolerance provided by software components. The tool focuses on measuring masking fault-tolerance, that is, the kind of fault-tolerance that allows systems to mask faults in such a way that they cannot be observed by the users. The tool takes as input a nominal model (which serves as a specification) and its fault-tolerant implementation, described by means of a guarded-command language, and automatically computes the masking distance between them. This value can be understood as the level of fault-tolerance provided by the implementation. The tool is based on a sound and complete framework we have introduced in previous work. We present the ideas behind the tool by means of a simple example and report experiments realized on more complex case studies.
A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic
Authors: Bromberger Martin , Dragoste Irina , Faqeh Rasha , Fetzer Christof , González Larry , Krötzsch Markus , Marx Maximilian , Murali Harish K , Weidenbach Christoph 
Published: March 2022

AbstractIn a previous paper, we have shown that clause sets belonging to the Horn Bernays-Schönfinkel fragment over simple linear real arithmetic (HBS(SLR)) can be translated into HBS clause sets over a finite set of first-order constants. The translation preserves validity and satisfiability and it is still applicable if we extend our input with positive universally or existentially quantified verification conditions (conjectures). We call this translation a Datalog hammer. The combination of its implementation in SPASS-SPL with the Datalog reasoner VLog establishes an effective way of deciding verification conditions in the Horn fragment. We verify supervisor code for two examples: a lane change assistant in a car and an electronic control unit of a supercharged combustion engine.In this paper, we improve our Datalog hammer in several ways: we generalize it to mixed real-integer arithmetic and finite first-order sorts; we extend the class of acceptable inequalities beyond variable bounds and positively grounded inequalities; and we significantly reduce the size of the hammer output by a soft typing discipline. We call the result the sorted Datalog hammer. It not only allows us to handle more complex supervisor code and to model already considered supervisor code more concisely, but it also improves our performance on real world benchmark examples. Finally, we replace the before file-based interface between SPASS-SPL and VLog by a close coupling resulting in a single executable binary.
Comparative Verification of the Digital Library of Mathematical Functions and Computer Algebra Systems
Authors: Greiner-Petter André , Cohl Howard S. , Youssef Abdou , Schubotz Moritz , Trost Avi , Dey Rajen , Aizawa Akiko , Gipp Bela 
Published: March 2022

AbstractDigital mathematical libraries assemble the knowledge of years of mathematical research. Numerous disciplines (e.g., physics, engineering, pure and applied mathematics) rely heavily on compendia gathered findings. Likewise, modern research applications rely more and more on computational solutions, which are often calculated and verified by computer algebra systems. Hence, the correctness, accuracy, and reliability of both digital mathematical libraries and computer algebra systems is a crucial attribute for modern research. In this paper, we present a novel approach to verify a digital mathematical library and two computer algebra systems with one another by converting mathematical expressions from one system to the other. We use our previously developed conversion tool (referred to as

"Image missing"

) to translate formulae from the NIST Digital Library of Mathematical Functions to the computer algebra systems and . The contributions of our presented work are as follows: (1) we present the most comprehensive verification of computer algebra systems and digital mathematical libraries with one another; (2) we significantly enhance the performance of the underlying translator in terms of coverage and accuracy; and (3) we provide open access to translations for and of the formulae in the NIST Digital Library of Mathematical Functions.
Verifying Fortran Programs with CIVL
Authors: Wu Wenhao , Hückelheim Jan , Hovland Paul D. , Siegel Stephen F. 
Published: March 2022

AbstractFortran is widely used in computational science, engineering, and high performance computing. This paper presents an extension to the CIVL verification framework to check correctness properties of Fortran programs. Unlike previous work that translates Fortran to C, LLVM IR, or other intermediate formats before verification, our work allows CIVL to directly consume Fortran source files. We extended the parsing, translation, and analysis phases to support Fortran-specific features such as array slicing and reshaping, and to find program violations that are specific to Fortran, such as argument aliasing rule violations, invalid use of variable and function attributes, or defects due to Fortran’s unspecified expression evaluation order. We demonstrate the usefulness of our tool on a verification benchmark suite and kernels extracted from a real world application.
NORMA: a tool for the analysis of Relay-based Railway Interlocking Systems
Authors: Amendola Arturo , Becchi Anna , Cavada Roberto , Cimatti Alessandro , Ferrando Andrea , Pilati Lorenzo , Scaglione Giuseppe , Tacchella Alberto , Zamboni Marco 
Published: March 2022

AbstractWe present Norma, a tool for the modeling and analysis of Relay-based Railways Interlocking Systems (RRIS). Norma is the result of a research project funded by the Italian Railway Network, to support the reverse engineering and migration to computer-based technology of legacy RRIS. The frontend fully supports the graphical modeling of Italian RRIS, with a palette of over two hundred basic components, stubs to abstract RRIS subcircuits, and requirements in terms of formal properties. The internal component based representation is translated into highly optimized Timed nuXmv models, and supports various syntactic and semantic checks based on formal verification, simulation and test case generation. Norma is experimentally evaluated, demonstrating the practical support for the modelers, and the effectiveness of the underlying optimizations.
From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques
Authors: Koutavas Vasileios , Lin Yu-Yang , Tzevelekos Nikos 
Published: March 2022

AbstractWe present a bounded equivalence verification technique for higher-order programs with local state. This technique combines fully abstract symbolic environmental bisimulations similar to symbolic game semantics, novel up-to techniques, and lightweight state invariant annotations. This yields an equivalence verification technique with no false positives or negatives. The technique is bounded-complete, in that all inequivalences are automatically detected given large enough bounds. Moreover, several hard equivalences are proved automatically or after being annotated with state invariants. We realise the technique in a tool prototype called Hobbit and benchmark it with an extensive set of new and existing examples. Hobbit can prove many classical equivalences including all Meyer and Sieber examples.
A Theoretical Analysis of Random Regression Test Prioritization
Authors: Yi Pu , Wang Hao , Xie Tao , Marinov Darko , Lam Wing 
Published: March 2022

AbstractRegression testing is an important activity to check software changes by running the tests in a test suite to inform the developers whether the changes lead to test failures. Regression test prioritization (RTP) aims to inform the developers faster by ordering the test suite so that tests likely to fail are run earlier. Many RTP techniques have been proposed and are often compared with the random RTP baseline by sampling some of the n! different test-suite orders for a test suite with n tests. However, there is no theoretical analysis of random RTP. We present such an analysis, deriving probability mass functions and expected values for metrics and scenarios commonly used in RTP research. Using our analysis, we revisit some of the most highly cited RTP papers and find that some presented results may be due to insufficient sampling. Future RTP research can leverage our analysis and need not use random sampling but can use our simple formulas or algorithms to more precisely compare with random RTP.
Efficient Analysis of Cyclic Redundancy Architectures via Boolean Fault Propagation
Authors: Bozzano Marco , Cimatti Alessandro , Griggio Alberto , Jonáš Martin 
Published: March 2022

AbstractMany safety critical systems guarantee fault-tolerance by using several redundant copies of their components. When designing such redundancy architectures, it is crucial to analyze their fault trees, which describe combinations of faults of individual components that may cause malfunction of the system. State-of-the-art techniques for fault tree computation use first-order formulas with uninterpreted functions to model the transformations of signals performed by the redundancy system and an AllSMT query for computation of the fault tree from this encoding. Scalability of the analysis can be further improved by techniques such as predicate abstraction, which reduces the problem to Boolean case.In this paper, we show that as far as fault trees of redundancy architectures are concerned, signal transformation can be equivalently viewed in a purely Boolean way as fault propagation. This alternative view has important practical consequences. First, it applies also to general redundancy architectures with cyclic dependencies among components, to which the current state-of-the-art methods based on AllSMT are not applicable, and which currently require expensive sequential reasoning. Second, it allows for a simpler encoding of the problem and usage of efficient algorithms for analysis of fault propagation, which can significantly improve the runtime of the analyses. A thorough experimental evaluation demonstrates the superiority of the proposed techniques.
BRICK: Path Enumeration Based Bounded Reachability Checking of C Program (Competition Contribution)
Authors: Bu Lei , Xie Zhunyi , Lyu Lecheng , Li Yichao , Guo Xiao , Zhao Jianhua , Li Xuandong 
Published: March 2022

AbstractBRICK is a bounded reachability checker for embedded C programs. BRICK conducts a path-oriented style checking of the bounded state space of the program, that enumerates and checks all the possible paths of the program in the threshold one by one. To alleviate the path explosion problem, BRICK locates and records unsatisfiable core path segments during the checking of each path and uses them to prune the search space. Furthermore, derivative free optimization based falsification and loop induction are introduced to handle complex program features like nonlinear path conditions and loops efficiently.
Deagle: An SMT-based Verifier for Multi-threaded Programs (Competition Contribution)
Authors: He Fei , Sun Zhihang , Fan Hongyu 
Published: March 2022

Abstract is an SMT-based multi-threaded program verification tool. It is built on top of (front-end) and (back-end). The basic idea of is to integrate into the SMT solver an ordering consistency theory that handles ordering relations over the shared variable accesses in the program. The front-end encodes the input program into an extended propositional formula that contains ordering constraints. The back-end is reinforced with a solver for the ordering consistency theory. This paper presents the basic idea, architecture, installation, and usage of .