bluuebunny/crossref_metadata_2025_split huggingface dataset:
The Rainbow Connection: A Time-Series Study of Rainbow Flag Display Across Nine Toronto Neighborhoods
Authors: Bitterman Alex 
Published: March 2021

AbstractRecently, the display and use of the rainbow flag in historically defined gay neighborhoods has grown even as gay residents and businesses have been driven away by gentrification, rising real-estate costs, and cultural homogenization. At the same time, prevelence and use of the rainbow flag and the rainbow motif has increased in areas not usually considered part of recognized gay neighborhoods. This chapter explores the prevalence and persistence of the display of the rainbow flag and rainbow motif in nine neighborhoods across Toronto, Ontario, Canada. The visual assessment of rainbow flag use across these neighborhoods serves as a potential model for examining the rate of spread of rainbow flags and visual rainbow motif symbols as a means for tracking the movement of the LGBTQ+ community across urban neighborhoods. Initial results suggest potential significance of the prevalence and persistence of the rainbow flag and the rainbow motif. These include; (1) a possible diaspora of LGBTQ+ residents from traditionally defined gay neighborhoods to newly emerging gay or LGBTQ-friendly neighborhoods, (2) a newfound inclusivity or pride among residents of other neighborhoods, and (3) “rainbow washing” due to overuse of the rainbow motif by non-LGBTQ businesses and organizations connected with pride celebrations. While overuse of the rainbow flag may diminish historically coded meaning of the rainbow, that well-intentioned use of the rainbow flag is a positive and welcoming indicator for LGBTQ+ individuals and it may lead to the emergence of additional LGBTQ-friendly enclaves that, over time, could potentially emerge as new gay neighborhoods.
Are “Gay” and “Queer-Friendly” Neighborhoods Healthy? Assessing How Areas with High Densities of Same-Sex Couples Impact the Mental Health of Sexual Minority and Majority Young Adults
Authors: Wienke Chris , Whaley Rachel B. , Braatz Rick 
Published: March 2021

AbstractNeighborhoods with large concentrations of gay men, lesbians, and other sexual minorities have long served as places where sexual minority young adults find self-enhancing resources. Yet, it is unclear whether such neighborhood environments also confer health benefits. Using data from the National Longitudinal Study of Adolescent Health, we explored the relationship between the proportion of same-sex couples in neighborhoods and the mental health of sexual minority and majority young adults, controlling for other neighborhood- and individual-level factors. Results indicate that for sexual minorities, neighborhoods with higher percentages of same-sex couples are associated with lower levels of depression symptoms and higher levels of self-esteem. Conversely, for heterosexuals, there are no differences in health outcomes across neighborhood contexts. Taken together, the findings highlight the importance of striving for neighborhood-level understandings of sexual minority young adults and their mental health problems.
Introduction
Authors: Theisen-Womersley Ph.D. Gail 
Published: March 2021

AbstractThis chaper aims to offer an introduction to trauma and resilience among displaced communities in humanitarian contexts across the globe. Key
themes being introduced include the various definitions of trauma, the importance of the sociocultural environment on the ways in which trauma manifests, factors
influencing individual and group resilience, and a consideration of the impact of political and economic factors on the mental health of displaced and forced migrant
populations.
Working with PTSD in the Asylum Procedure
Authors: Theisen-Womersley Gail 
Published: March 2021

AbstractEurope is living through a refugee crisis of historic proportions, with subsequent evolving responses having now become one of the continent’s defining challenges of the early twenty-first century (Médécins Sans Frontières, 2016; UNHCR, .The sea route to Europe: The Mediterranean passage in the age of refugees, United Nations High Commissioner for Refugees, Geneva, 2015).
Prevalence of PTSD Among Displaced Populations—Three Case Studies
Authors: Theisen-Womersley Gail 
Published: March 2021

AbstractAs explored in chapter two, displaced populations face a myriad of traumatic events, throughout the migration process. It comes as no surprise than, that two landmark, systematic meta-reviews found prevalence rates among refugee populations of 40% (Turrini et al., .International Journal of Mental Health Systems 11:51, 2017) and 30.6% (Steel et al., .JAMA 302:537–549, 2009) respectively.
Culturally Informed Manifestations of Trauma
Authors: Theisen-Womersley Gail 
Published: March 2021

AbstractHuman beings have an inherent need to make sense of their experiences. This may be particularly true of traumatic experiences which have the potential to shake the bedrock on which one’s belief systems are based (Drožđek & Wilson, 2007; Herman, 1992). Globally, the literature attests to substantial variations in how people worldwide respond to traumatic events.
Marketplace-Level Domain Ontologies
Authors: Horsch Martin Thomas , Chiacchiera Silvia , Cavalcanti Welchy Leite , Schembera Björn 
Published: March 2021

AbstractTo enable semantic interoperability with external services and platforms, the Virtual Materials Marketplace (VIMMP) project has developed a system of marketplace-level domain ontologies, supporting the ingest and retrieval of data and metadata at the VIMMP marketplace front end; these ontologies are expressed in OWL2 using TTL notation [1]. Internally, VIMMP uses the marketplace-level domain ontologies as a part of its approach to data management, underlying the interactions with users. This chapter and the subsequent two chapters present ontologies from the VIMMP project and their relation to other work, including other ontologies.
Compositional Analysis of Probabilistic Timed Graph Transformation Systems
Authors: Maximova Maria , Schneider Sven , Giese Holger 
Published: March 2021

AbstractThe analysis of behavioral models is of high importance for cyber-physical systems, as the systems often encompass complex behavior based on e.g. concurrent components with mutual exclusion or probabilistic failures on demand. The rule-based formalism of probabilistic timed graph transformation systems is a suitable choice when the models representing states of the system can be understood as graphs and timed and probabilistic behavior is important. However, model checking PTGTSs is limited to systems with rather small state spaces.We present an approach for the analysis of large-scale systems modeled as probabilistic timed graph transformation systems by systematically decomposing their state spaces into manageable fragments. To obtain qualitative and quantitative analysis results for a large-scale system, we verify that results obtained for its fragments serve as overapproximations for the corresponding results of the large-scale system. Hence, our approach allows for the detection of violations of qualitative and quantitative safety properties for the large-scale system under analysis. We consider a running example in which we model shuttles driving on tracks of a large-scale topology and for which we verify that shuttles never collide and are unlikely to execute emergency brakes. In our evaluation, we apply an implementation of our approach to the running example.
Effects of Program Representation on Pointer Analyses — An Empirical Study
Authors: Prakash Jyoti , Tiwari Abhishek , Hammer Christian 
Published: March 2021

AbstractStatic analysis frameworks, such as Soot and Wala, are used by researchers to prototype and compare program analyses. These frameworks vary on heap abstraction, modeling library classes, and underlying intermediate program representation (IR). Often, these variations pose a threat to the validity of the results as the implications of comparing the same analysis implementation in different frameworks are still unexplored. Earlier studies have focused on the precision, soundness, and recall of the algorithms implemented in these frameworks; however, little to no work has been done to evaluate the effects of program representation. In this work, we fill this gap and study the impact of program representation on pointer analysis. Unfortunately, existing metrics are insufficient for such a comparison due to their inability to isolate each aspect of the program representation. Therefore, we define two novel metrics that measure these analyses’ precision after isolating the influence of class-hierarchy and intermediate representation. Our results establish that the minor differences in the class hierarchy and IR do not impact program analysis significantly. Besides, they reveal the sources of unsoundness that aid researchers in developing program analysis.
Certified Abstract Cost Analysis
Authors: Albert Elvira , Hähnle Reiner , Merayo Alicia , Steinhöfel Dominic 
Published: March 2021

AbstractA program containing placeholders for unspecified statements or expressions is called an abstract (or schematic) program. Placeholder symbols occur naturally in program transformation rules, as used in refactoring, compilation, optimization, or parallelization. We present a generalization of automated cost analysis that can handle abstract programs and, hence, can analyze the impact on the cost of program transformations. This kind of relational property requires provably precise cost bounds which are not always produced by cost analysis. Therefore, we certify by deductive verification that the inferred abstract cost bounds are correct and sufficiently precise. It is the first approach solving this problem. Both, abstract cost analysis and certification, are based on quantitative abstract execution (QAE) which in turn is a variation of abstract execution, a recently developed symbolic execution technique for abstract programs. To realize QAE the new concept of a cost invariant is introduced. QAE is implemented and runs fully automatically on a benchmark set consisting of representative optimization rules.
Bootstrapping Automated Testing for RESTful Web Services
Authors: Chen Yixiong , Yang Yang , Lei Zhanyao , Xia Mingyuan , Qi Zhengwei 
Published: March 2021

AbstractModern RESTful services expose RESTful APIs to integrate with diversified applications. Most RESTful API parameters are weakly typed, which greatly increases the possible input value space. This poses difficulties for automated testing tools to generate effective test cases to reveal web service defects related to parameter validation. We call this phenomenon the type collapse problem. To remedy this problem, we introduce FET (Format-encoded Type) techniques, including the FET, the FET lattice, and the FET inference to model fine-grained information for API parameters. Enhanced by FET techniques, automated testing tools can generate targeted test cases. We demonstrate Leif, a trace-driven fuzzing tool, as a proof-of-concept implementation of FET techniques. Experiment results on 27 commercial services show that FET inference precisely captures documented parameter definitions, which helps Leif to discover 11 new bugs and reduce $$72\% \sim 86\%$$

72
%
∼
86
%

fuzzing time as compared to state-of-the-art fuzzers.
Finding a Universal Execution Strategy for Model Transformation Networks
Authors: Gleitze Joshua , Klare Heiko , Burger Erik 
Published: March 2021

AbstractWhen using multiple models to describe a (software) system, one can use a network of model transformations to keep the models consistent after changes. No strategy exists, however, to orchestrate the execution of transformations if the network has an arbitrary topology. In this paper, we analyse how often and in which order transformations need to be executed. We argue why linear execution bounds are too restrictive to be useful in practice and prove that there is no upper bound for the number of necessary executions. To avoid non-termination, we propose a conservative strategy that makes execution failures easier to understand. These insights help developers and users of transformation networks to understand under which circumstances their networks can terminate. Additionally, the proposed strategy helps them to find the cause when a network cannot restore consistency.
CoVEGI: Cooperative Verification via Externally Generated Invariants
Authors: Haltermann Jan , Wehrheim Heike 
Published: March 2021

AbstractSoftware verification has recently made enormous progress due to the development of novel verification methods and the speed-up of supporting technologies like SMT solving. To keep software verification tools up to date with these advances, tool developers keep on integrating newly designed methods into their tools, almost exclusively by re-implementing the method within their own framework. While this allows for a conceptual re-use of methods, it nevertheless requires novel implementations for every new technique.In this paper, we employ cooperative verification in order to avoid re-implementation and enable usage of novel tools as black-box components in verification. Specifically, cooperation is employed for the core ingredient of software verification which is invariant generation. Finding an adequate loop invariant is key to the success of a verification run. Our framework named CoVEGI allows a master verification tool to delegate the task of invariant generation to one or several specialized helper invariant generators. Their results are then utilized within the verification run of the master verifier, allowing in particular for crosschecking the validity of the invariant. We experimentally evaluate our framework on an instance with two masters and three different invariant generators using a number of benchmarks from SV-COMP 2020. The experiments show that the use of CoVEGI can increase the number of correctly verified tasks without increasing the used resources.
Paracosm: A Test Framework for Autonomous Driving Simulations
Authors: Majumdar Rupak , Mathur Aman , Pirron Marcus , Stegner Laura , Zufferey Damien 
Published: March 2021

AbstractSystematic testing of autonomous vehicles operating in complex real-world scenarios is a difficult and expensive problem. We present Paracosm, a framework for writing systematic test scenarios for autonomous driving simulations. Paracosm allows users to programmatically describe complex driving situations with specific features, e.g., road layouts and environmental conditions, as well as reactive temporal behaviors of other cars and pedestrians. A systematic exploration of the state space, both for visual features and for reactive interactions with the environment is made possible. We define a notion of test coverage for parameter configurations based on combinatorial testing and low dispersion sequences. Using fuzzing on parameter configurations, our automatic test generator can maximize coverage of various behaviors and find problematic cases. Through empirical evaluations, we demonstrate the capabilities of Paracosm in programmatically modeling parameterized test environments, and in finding problematic scenarios.
Inductive Synthesis for Probabilistic Programs Reaches New Horizons
Authors: Andriushchenko Roman , Češka Milan , Junges Sebastian , Katoen Joost-Pieter 
Published: March 2021

AbstractThis paper presents a novel method for the automated synthesis of probabilistic programs. The starting point is a program sketch representing a finite family of finite-state Markov chains with related but distinct topologies, and a reachability specification. The method builds on a novel inductive oracle that greedily generates counter-examples (CEs) for violating programs and uses them to prune the family. These CEs leverage the semantics of the family in the form of bounds on its best- and worst-case behaviour provided by a deductive oracle using an MDP abstraction. The method further monitors the performance of the synthesis and adaptively switches between inductive and deductive reasoning. Our experiments demonstrate that the novel CE construction provides a significantly faster and more effective pruning strategy leading to an accelerated synthesis process on a wide range of benchmarks. For challenging problems, such as the synthesis of decentralized partially-observable controllers, we reduce the run-time from a day to minutes.
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
Authors: Meyer Fabian , Hark Marcel , Giesl Jürgen 
Published: March 2021

AbstractWe present a novel modular approach to infer upper bounds on the expected runtimes of probabilistic integer programs automatically. To this end, it computes bounds on the runtimes of program parts and on the sizes of their variables in an alternating way. To evaluate its power, we implemented our approach in a new version of our open-source tool .
Timed Automata Relaxation for Reachability
Authors: Bendík Jaroslav , Sencan Ahmet , Gol Ebru Aydin , Černá Ivana 
Published: March 2021

AbstractTimed automata (TA) have shown to be a suitable formalism for modeling real-time systems. Moreover, modern model-checking tools allow a designer to check whether a TA complies with the system specification. However, the exact timing constraints of the system are often uncertain during the design phase. Consequently, the designer is able to build a TA with a correct structure, however, the timing constraints need to be tuned to make the TA comply with the specification.In this work, we assume that we are given a TA together with an existential property, such as reachability, that is not satisfied by the TA. We propose a novel concept of a minimal sufficient reduction (MSR) that allows us to identify the minimal setSof timing constraints of the TA that needs to be tuned to meet the specification. Moreover, we employ mixed-integer linear programming to actually find a tuning ofSthat leads to meeting the specification.
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
Authors: Majumdar Rupak , Thinniyam Ramanathan S. , Zetzsche Georg 
Published: March 2021

AbstractThe model of asynchronous programming arises in many contexts, from low-level systems software to high-level web programming. We take a language-theoretic perspective and show general decidability and undecidability results for asynchronous programs that capture all known results as well as show decidability of new and important classes. As a main consequence, we show decidability of safety, termination and boundedness verification for higher-order asynchronous programs—such as OCaml programs using Lwt—and undecidability of liveness verification already for order-2 asynchronous programs. We show that under mild assumptions, surprisingly, safety and termination verification of asynchronous programs with handlers from a language class are decidable iff emptiness is decidable for the underlying language class. Moreover, we show that configuration reachability and liveness (fair termination) verification are equivalent, and decidability of these problems implies decidability of the well-known “equal-letters” problem on languages. Our results close the decidability frontier for asynchronous programs.
Quasipolynomial Computation of Nested Fixpoints
Authors: Hausmann Daniel , Schröder Lutz 
Published: March 2021

AbstractIt is well-known that the winning region of a parity game with n nodes and k priorities can be computed as a k-nested fixpoint of a suitable function; straightforward computation of this nested fixpoint requires $$\mathcal {O}(n^{\frac{k}{2}})$$

O
(

n

k
2

)

iterations of the function. Calude et al.’s recent quasipolynomial-time parity game solving algorithm essentially shows how to compute the same fixpoint in only quasipolynomially many iterations by reducing parity games to quasipolynomially sized safety games. Universal graphs have been used to modularize this transformation of parity games to equivalent safety games that are obtained by combining the original game with a universal graph. We show that this approach naturally generalizes to the computation of solutions of systems of any fixpoint equations over finite lattices; hence, the solution of fixpoint equation systems can be computed by quasipolynomially many iterations of the equations. We present applications to modal fixpoint logics and games beyond relational semantics. For instance, the model checking problems for the energy $$\mu $$
μ
-calculus, finite latticed $$\mu $$
μ
-calculi, and the graded and the (two-valued) probabilistic $$\mu $$
μ
-calculus – with numbers coded in binary – can be solved via nested fixpoints of functions that differ substantially from the function for parity games but still can be computed in quasipolynomial time; our result hence implies that model checking for these $$\mu $$
μ
-calculi is in $$\textsc {QP}$$

QP

. Moreover, we improve the exponent in known exponential bounds on satisfiability checking.
Bounded Model Checking for Hyperproperties
Authors: Hsu Tzu-Han , Sánchez César , Bonakdarpour Borzoo 
Published: March 2021

AbstractThis paper introduces a bounded model checking (BMC) algorithm for hyperproperties expressed in HyperLTL, which — to the best of our knowledge — is the first such algorithm. Just as the classic BMC technique for LTL primarily aims at finding bugs, our approach also targets identifying counterexamples. BMC for LTL is reduced to SAT solving, because LTL describes a property via inspecting individual traces. Our BMC approach naturally reduces to QBF solving, as HyperLTL allows explicit and simultaneous quantification over multiple traces. We report on successful and efficient model checking, implemented in our tool called , of a rich set of experiments on a variety of case studies, including security, concurrent data structures, path planning for robots, and mutation testing.
Nachwuchsförderung als Legitimationsmythos
Authors: Hoesch Benjamin 
Published: March 2021

ZusammenfassungDie Entwicklung der künstlerischen Nachwuchsförderung zu einer kulturpolitischen Leitidee wird anhand der Theater im Hamburg der 1990er Jahre sowie des Münchner Volkstheaters bis in die Gegenwart nachgezeichnet. Dabei wird insbesondere der strategische Nutzen zur öffentlichen Legitimierung der Theater selbst – und damit für Aufmerksamkeitsgewinne und die Sicherung von Fördermitteln – hinterfragt. Schließlich werden erste Infragestellungen des Legitimationsmythos Nachwuchsförderung im Praxisfeld sowie Widerstand von Künstler*innen im Rahmen einer Kulturpolitik von unten registriert.
Kaltstart: Kulturpolitik und Theater in Ostdeutschland – gestern und heute
Authors: Althoff Lara , Marggraf Jonas , Zimmer Annette 
Published: March 2021

ZusammenfassungBehandelt wird die Transformation der DDR-Theaterlandschaft, wobei der Fokus zum einen auf den Veränderungen der kulturpolitischen Steuerung und zum anderen auf den Führungs- und Leitungsstrukturen der Theater liegt. Hierbei steht die Fragestellung im Zentrum, ob sich hinsichtlich der Governance – der politischen wie der theaterinternen Steuerung – noch Unterschiede zwischen Theatern in Ost- und Westdeutschland feststellen lassen. Einleitend wird ein knapper Überblick über die Theaterlandschaft und -politik der DDR gegeben. Daran anschließend wird literaturgestützt die Transformation der DDR-Theater unter besonderer Berücksichtigung der Rolle des Bundes und der ostdeutschen Länder behandelt. Für den Vergleich der kulturpolitischen Governance sowie der Leitungs- und Führungsstrukturen der Theater wird auf Ergebnisse einer im Rahmen der Teilstudie „Passion als Beruf“ durchgeführten Multiple-Case-Study an sechs Stadttheatern rekurriert, die jeweils zur Hälfte in den östlichen Bundesländern und Nordrhein-Westfalen liegen. Es zeigen sich Unterschiede im Hinblick auf die kulturpolitische Steuerung der Stadttheater durch die Kommune und insbesondere durch die Länder. Insgesamt überwiegen aber die Gemeinsamkeiten, und zwar hinsichtlich der Erfahrung einer essenziellen Krise, der Verselbständigung und Etablierung als Theaterbetriebe sowie der ausgeprägten Abhängigkeit von der Politik.