bluuebunny/crossref_metadata_2025_split huggingface dataset:
Stent-assisted coiling of cerebral aneurysms using the Y-stenting technique: a systematic review and meta-analysis
Authors: Granja Manuel F , Cortez Gustavo M , Aguilar-Salinas Pedro , Agnoletto Guilherme Jose , Imbarrato Gregory , Jaume Alejandra , Aghaebrahim Amin , Sauvageau Eric , Hanel Ricardo A 
Published: January 2019

BackgroundBifurcation aneurysms can be treated with stent-assisted coiling using two stents in a Y-configuration. We aim to investigate the angiographic and clinical outcomes of Y-stent constructs for the treatment of intracranial aneurysms.MethodsA systematic review of PubMed, Ovid MEDLINE, and Ovid EMBASE databases was conducted based on PRISMA guidelines. The study selection was performed using the ‘Ryyan’ application. Our analysis included 18 studies with 327 patients. Inclusion criteria were: articles published from January 2000 to November 2017, English language, including cerebral aneurysms treated via Y-stenting, and ≥5 cases with radiographic/clinical outcomes. Technical notes, editorials, reviews, and animal studies were excluded. A random-effect meta-analysis was performed on angiographic and clinical outcomes, including aneurysm occlusion, modified Rankin Scale, neurological outcome, and procedure-related mortality. 95% CIs and event rates were estimated. Statistical heterogeneity was assessed usingI2statistics.ResultsThe procedure-related good outcome rate was 92% and complete occlusion rate was 91%. The permanent neurological deficit rate was 4% and procedure-related mortality was 2%. The procedure-related stroke rate was 12%. A total of 28/146 (19%) patients had ruptured aneurysms. At long-term follow-up, overall stroke rate was 9% in patients with unruptured aneurysm. The mortality rate was higher in cases with ruptured aneurysms than in those with unruptured aneurysms (18% vs 0.8%; p<0.001).ConclusionsY-stenting for bifurcation aneurysms yields a high rate of complete occlusion and low rates of mortality and stroke. Careful patient selection is needed.
Effect of the circular microstructure on absorbing properties of carbonyl iron rubber radar absorbing patch
Authors: Zhou Bi-Cheng , Wang Dong-Hong , Li Bao-Yi , Zhao Ya-Juan , Ma Jiang-Jiang , Li Ke-Xun 
Published: January 2019

A kind of radar absorber is designed and produced based on circular microstructure, which is composed of a circular microstructure, carbonyl iron rubber radar absorbing patch and metal backboard composition. Numerical simulation of effect of the circular microstructure on absorbing properties of carbonyl iron rubber radar absorbing patch is performed by means of the time domain finite integral method. Simulated results indicate that by using the holding absorber with the unchanged thickness of 2.5 mm, when the absorber unit size was P = 30 mm and the circular radius was R = 5 mm, the value of the minimum absorption peak can reach −43 dB, −10 dB absorption band shifted from 5.8–9.3 to 4.6–8.2 GHz, changing the parameters of circular microstructure greatly, expanding the absorbing bandwidth of microwave absorbing patch, reducing the reflectivity of resonance frequency. According to the simulation results, the samples are prepared and tested. The test results are in agreement with the simulation results.
Late Paleozoic extensional reactivation of the Rheic–Rhenohercynian suture zone in SW England, the English Channel and Western Approaches
Authors: Alexander Andrew C. , Shail Robin K. , Leveridge Brian E. 
Published: January 2019

Abstract
The Rheic Ocean is a persistent feature of Paleozoic palaeogeographies whose closure contributed to the development of the Variscan Orogen and the formation of Pangaea. Geological and geophysical data indicate repeated episodes of Paleozoic rifting and plate convergence around SW England and the adjacent offshore areas. SW England occupied a lower plate position during the Devonian–Carboniferous, on the northern passive margin of the short-lived Rhenohercynian Ocean that had formed near a recently closed segment of the Rheic Ocean. Variscan plate convergence resulted in the development of the composite southwards-dipping Rheic–Rhenohercynian suture zone by the latest Devonian and inversion of the lower plate basins during the Carboniferous. Early Permian NNW–SSE extensional reactivation of this suture zone controlled the development of the Western Approaches basins in its hanging wall and provides an excellent example of Wilson cycle structural inheritance. The onshore expression of this episode includes shear zones and detachment faults consistent with top-to-the-SSE extensional reactivation of Variscan thrust faults. There is a progression to higher-angle brittle extensional faults that cut out earlier structures. Exhumation of the lower plate was accompanied by Early Permian mantle and concomitant crustal partial melting, the construction of the Cornubian Batholith and W–Sn–Cu fracture-hosted mineralization.
Describing fluvial systems: linking processes to deposits and stratigraphy
Authors: Best Jim , Fielding Christopher R. 
Published: January 2019

Abstract
The period since the 1960s witnessed significant progress in our ability to decipher the clastic rock record from a wide range of sedimentary environments, and spanning many spatio-temporal scales, from millimetric to that of the sedimentary basin, and involving processes acting on timescales of seconds to millions of years. This review assesses advances in four areas of fluvial sedimentology: the nature of alluvial dunes, the role of fine-grained suspended sediment, the linking of facies models and channel planform, and the reconstruction of drainage networks within ancient sedimentary successions. The synthesis reveals that we require new thinking and research to: (1) address the range of stratification produced by dunes and their palaeohydraulic implications; (2) evolve new bedform phase diagrams capable of incorporating the reality that many fluids transport fine-grained sediment, both in flow and within the bed, which may significantly modify the bedform morphology and phase space when compared with existing bedform stability diagrams; (3) develop new alluvial facies models in which planform channel pattern is not the fundamental discriminant; and (4) re-establish consideration of process mechanics as the heart of developing ideas and debates concerning fluvial deposit preservation and alluvial architecture.
Bisimulation as path type for guarded recursive types
Authors: Møgelberg Rasmus Ejlers , Veltri Niccolò 
Published: January 2019

In type theory, coinductive types are used to represent processes, and are thus crucial for the formal verification of non-terminating reactive programs in proof assistants based on type theory, such as Coq and Agda. Currently, programming and reasoning about coinductive types is difficult for two reasons: The need for recursive definitions to be productive, and the lack of coincidence of the built-in identity types and the important notion of bisimilarity.
Guarded recursion in the sense of Nakano has recently been suggested as a possible approach to dealing with the problem of productivity, allowing this to be encoded in types. Indeed, coinductive types can be encoded using a combination of guarded recursion and universal quantification over clocks. This paper studies the notion of bisimilarity for guarded recursive types in Ticked Cubical Type Theory, an extension of Cubical Type Theory with guarded recursion. We prove that, for any functor, an abstract, category theoretic notion of bisimilarity for the final guarded coalgebra is equivalent (in the sense of homotopy type theory) to path equality (the primitive notion of equality in cubical type theory). As a worked example we study a guarded notion of labelled transition systems, and show that, as a special case of the general theorem, path equality coincides with an adaptation of the usual notion of bisimulation for processes. In particular, this implies that guarded recursion can be used to give simple equational reasoning proofs of bisimilarity. This work should be seen as a step towards obtaining bisimilarity as path equality for coinductive types using the encodings mentioned above.
Exceptional asynchronous session types: session types without tiers
Authors: Fowler Simon , Lindley Sam , Morris J. Garrett , Decova Sára 
Published: January 2019

Session types statically guarantee that communication complies with a protocol. However, most accounts of session typing do not account for failure, which means they are of limited use in real applications---especially distributed applications---where failure is pervasive.
We present the first formal integration of asynchronous session types with exception handling in a functional programming language. We define a core calculus which satisfies preservation and progress properties, is deadlock free, confluent, and terminating.
We provide the first implementation of session types with exception handling for a fully-fledged functional programming language, by extending the Links web programming language; our implementation draws on existing work on effect handlers. We illustrate our approach through a running example of two-factor authentication, and a larger example of a session-based chat application where communication occurs over session-typed channels and disconnections are handled gracefully.
A domain theory for statistical probabilistic programming
Authors: Vákár Matthijs , Kammar Ohad , Staton Sam 
Published: January 2019

We give an adequate denotational semantics for languages with recursive higher-order types, continuous probability distributions, and soft constraints. These are expressive languages for building Bayesian models of the kinds used in computational statistics and machine learning. Among them are untyped languages, similar to Church and WebPPL, because our semantics allows recursive mixed-variance datatypes. Our semantics justifies important program equivalences including commutativity.
Our new semantic model is based on `quasi-Borel predomains'. These are a mixture of chain-complete partial orders (cpos) and quasi-Borel spaces. Quasi-Borel spaces are a recent model of probability theory that focuses on sets of admissible random elements. Probability is traditionally treated in cpo models using probabilistic powerdomains, but these are not known to be commutative on any class of cpos with higher order functions. By contrast, quasi-Borel predomains do support both a commutative probabilistic powerdomain and higher-order functions. As we show, quasi-Borel predomains form both a model of Fiore's axiomatic domain theory and a model of Kock's synthetic measure theory.
code2vec: learning distributed representations of code
Authors: Alon Uri , Zilberstein Meital , Levy Omer , Yahav Eran 
Published: January 2019

We present a neural model for representing snippets of code as continuous distributed vectors (``code embeddings''). The main idea is to represent a code snippet as a single fixed-length code vector, which can be used to predict semantic properties of the snippet. To this end, code is first decomposed to a collection of paths in its abstract syntax tree. Then, the network learns the atomic representation of each path while simultaneously learning how to aggregate a set of them.
We demonstrate the effectiveness of our approach by using it to predict a method's name from the vector representation of its body. We evaluate our approach by training a model on a dataset of 12M methods. We show that code vectors trained on this dataset can predict method names from files that were unobserved during training. Furthermore, we show that our model learns useful method name vectors that capture semantic similarities, combinations, and analogies.
A comparison of our approach to previous techniques over the same dataset shows an improvement of more than 75%, making it the first to successfully predict method names based on a large, cross-project corpus. Our trained model, visualizations and vector similarities are available as an interactive online demo at http://code2vec.org. The code, data and trained models are available at https://github.com/tech-srl/code2vec.
An abstract domain for certifying neural networks
Authors: Singh Gagandeep , Gehr Timon , Püschel Markus , Vechev Martin 
Published: January 2019

We present a novel method for scalable and precise certification of deep neural networks. The key technical insight behind our approach is a new abstract domain which combines floating point polyhedra with intervals and is equipped with abstract transformers specifically tailored to the setting of neural networks. Concretely, we introduce new transformers for affine transforms, the rectified linear unit (ReLU), sigmoid, tanh, and maxpool functions.
We implemented our method in a system called DeepPoly and evaluated it extensively on a range of datasets, neural architectures (including defended networks), and specifications. Our experimental results indicate that DeepPoly is more precise than prior work while scaling to large networks.
We also show how to combine DeepPoly with a form of abstraction refinement based on trace partitioning. This enables us to prove, for the first time, the robustness of the network when the input image is subjected to complex perturbations such as rotations that employ linear interpolation.
Concerto: a framework for combined concrete and abstract interpretation
Authors: Toman John , Grossman Dan 
Published: January 2019

Abstract interpretation promises sound but computable static summarization of program behavior. However, modern software engineering practices pose significant challenges to this vision, specifically the extensive use of frameworks and complex libraries. Frameworks heavily use reflection, metaprogramming, and multiple layers of abstraction, all of which confound even state-of-the-art abstract interpreters. Sound but conservative analysis of frameworks is impractically imprecise, and unsoundly ignoring reflection and metaprogramming is untenable given the prevalence of these features. Manually modeling framework behaviors offers excellent precision, at the cost of immense effort by the tool designer.
To overcome the above difficulties, we present Concerto, a system for analyzing framework-based applications by soundly combining concrete and abstract interpretation. Concerto analyzes framework implementations using concrete interpretation, and application code using abstract interpretation. This technique is possible in practice as framework implementations typically follow a single path of execution when provided a concrete, application-specific configuration file which is often available at analysis time. Concerto exploits this configuration information to precisely resolve reflection and other metaprogramming idioms during concrete execution. In contrast, application code may have infinitely many paths of execution, so Concerto switches to abstract interpretation to analyze application code. Concerto is an analysis framework, and can be instantiated with any abstract interpretation that satisfies a small set of preconditions. In addition, unlike manual modeling, Concerto is not specialized to any specific framework implementation. We have formalized our approach and proved several important properties including soundness and termination. In addition, we have implemented an initial proof of concept prototype of Concerto for a subset of Java, and found that our combined interpretation significantly improves analysis precision and performance.
Fast and exact analysis for LRU caches
Authors: Touzeau Valentin , Maïza Claire , Monniaux David , Reineke Jan 
Published: January 2019

For applications in worst-case execution time analysis and in security, it is desirable to statically classify memory accesses into those that result in cache hits, and those that result in cache misses. Among cache replacement policies, the least recently used (LRU) policy has been studied the most and is considered to be the most predictable.
The state-of-the-art in LRU cache analysis presents a tradeoff between precision and analysis efficiency: The classical approach to analyzing programs running on LRU caches, an abstract interpretation based on a range abstraction, is very fast but can be imprecise. An exact analysis was recently presented, but, as a last resort, it calls a model checker, which is expensive.
In this paper, we develop an analysis based on abstract interpretation that comes close to the efficiency of the classical approach, while achieving exact classification of all memory accesses as the model-checking approach. Compared with the model-checking approach we observe speedups of several orders of magnitude. As a secondary contribution we show that LRU cache analysis problems are in general NP-complete.
On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models
Authors: Raad Azalea , Doko Marko , Rožić Lovro , Lahav Ori , Vafeiadis Viktor 
Published: January 2019

Concurrent libraries are the building blocks for concurrency. They encompass a range of abstractions (locks, exchangers, stacks, queues, sets) built in a layered fashion: more advanced libraries are built out of simpler ones. While there has been a lot of work on verifying such libraries in a sequentially consistent (SC) environment, little is known about how to specify and verify them under weak memory consistency (WMC).
We propose a general declarative framework that allows us to specify concurrent libraries declaratively, and to verify library implementations against their specifications compositionally. Our framework is sufficient to encode standard models such as SC, (R)C11 and TSO. Additionally, we specify several concurrent libraries, including mutual exclusion locks, reader-writer locks, exchangers, queues, stacks and sets. We then use our framework to verify multiple weakly consistent implementations of locks, exchangers, queues and stacks.
CT-wasm: type-driven secure cryptography for the web ecosystem
Authors: Watt Conrad , Renner John , Popescu Natalie , Cauligi Sunjay , Stefan Deian 
Published: January 2019

A significant amount of both client and server-side cryptography is implemented in JavaScript. Despite widespread concerns about its security, no other language has been able to match the convenience that comes from its ubiquitous support on the "web ecosystem" - the wide variety of technologies that collectively underpins the modern World Wide Web. With the introduction of the new WebAssembly bytecode language (Wasm) into the web ecosystem, we have a unique opportunity to advance a principled alternative to existing JavaScript cryptography use cases which does not compromise this convenience.
We present Constant-Time WebAssembly (CT-Wasm), a type-driven, strict extension to WebAssembly which facilitates the verifiably secure implementation of cryptographic algorithms. CT-Wasm's type system ensures that code written in CT-Wasm is both information flow secure and resistant to timing side channel attacks; like base Wasm, these guarantees are verifiable in linear time. Building on an existing Wasm mechanization, we mechanize the full CT-Wasm specification, prove soundness of the extended type system, implement a verified type checker, and give several proofs of the language's security properties.
We provide two implementations of CT-Wasm: an OCaml reference interpreter and a native implementation for Node.js and Chromium that extends Google's V8 engine. We also implement a CT-Wasm to Wasm rewrite tool that allows developers to reap the benefits of CT-Wasm's type system today, while developing cryptographic algorithms for base Wasm environments. We evaluate the language, our implementations, and supporting tools by porting several cryptographic primitives - Salsa20, SHA-256, and TEA - and the full TweetNaCl library. We find that CT-Wasm is fast, expressive, and generates code that we experimentally measure to be constant-time.
Genetic improvement events in 2018
Authors: Danglot Benjamin , An Gabin 
Published: January 2019

Genetic improvement uses optimisation and machine learning techniques, particularly heuristic search and evolutionary algorithms, to improve existing software. The main application is automatic bug fixing, where reducing or eliminating buggy behaviour improves a program. Other applications involve automatically producing a better program that runs faster, uses less memory, uses less energy, or runs on a different type of computer.
This article summarise two international events exclusively devoted to this topic in 2018.
Smarcal1 and Zranb3 Protect Replication Forks from Myc-Induced DNA Replication Stress
Authors: Puccetti Matthew V. , Adams Clare M. , Kushinsky Saul , Eischen Christine M. 
Published: January 2019

Abstract

The cellular DNA replication stress response functions to stabilize DNA replication forks and inhibits genome instability and tumorigenesis induced by oncogenes. However, the specific proteins required for resolving oncogenic stress remain poorly understood. Here we report that Smarcal1 and Zranb3, closely related replication fork–remodeling proteins, have nonredundant functions in resolving Myc-induced DNA replication stress. In Myc-overexpressing primary cells, significant differences in replication fork stalling, collapse, and DNA damage were detected between cells deficient in Smarcal1 or Zranb3, leading to changes in proliferation and apoptosis. These differences were also reflected in Myc-induced lymphoma development; haploinsufficiency of Smarcal1 resulted in accelerated lymphomagenesis, whereas haploinsufficiency of Zranb3 inhibited lymphoma development. Complete loss of either protein resulted in disparate survival outcomes. Our results reveal that endogenous replication stress from Myc in primary cells requires both alleles of Smarcal1 and Zranb3 and demonstrate the requirement of both proteins to stabilize replication forks upon Myc dysregulation in a nonredundant manner.

Significance:
Smarcal1 and Zranb3 are essential, but nonredundant, for responding to DNA replication stress and stabilizing replication forks following Myc overexpression.
See related commentary by Sotiriou and Halazonetis, p. 1297