@inproceedings{631,
  abstract     = {Template polyhedra generalize intervals and octagons to polyhedra whose facets are orthogonal to a given set of arbitrary directions. They have been employed in the abstract interpretation of programs and, with particular success, in the reachability analysis of hybrid automata. While previously, the choice of directions has been left to the user or a heuristic, we present a method for the automatic discovery of directions that generalize and eliminate spurious counterexamples. We show that for the class of convex hybrid automata, i.e., hybrid automata with (possibly nonlinear) convex constraints on derivatives, such directions always exist and can be found using convex optimization. We embed our method inside a CEGAR loop, thus enabling the time-unbounded reachability analysis of an important and richer class of hybrid automata than was previously possible. We evaluate our method on several benchmarks, demonstrating also its superior efficiency for the special case of linear hybrid automata.},
  author       = {Bogomolov, Sergiy and Frehse, Goran and Giacobbe, Mirco and Henzinger, Thomas A},
  isbn         = {978-366254576-8},
  location     = {Uppsala, Sweden},
  pages        = {589 -- 606},
  publisher    = {Springer},
  title        = {{Counterexample guided refinement of template polyhedra}},
  doi          = {10.1007/978-3-662-54577-5_34},
  volume       = {10205},
  year         = {2017},
}

@article{632,
  abstract     = {We consider a 2D quantum system of N bosons in a trapping potential |x|s, interacting via a pair potential of the form N2β−1 w(Nβ x). We show that for all 0 < β < (s + 1)/(s + 2), the leading order behavior of ground states of the many-body system is described in the large N limit by the corresponding cubic nonlinear Schrödinger energy functional. Our result covers the focusing case (w < 0) where even the stability of the many-body system is not obvious. This answers an open question mentioned by X. Chen and J. Holmer for harmonic traps (s = 2). Together with the BBGKY hierarchy approach used by these authors, our result implies the convergence of the many-body quantum dynamics to the focusing NLS equation with harmonic trap for all 0 < β < 3/4. },
  author       = {Lewin, Mathieu and Nam, Phan and Rougerie, Nicolas},
  journal      = {Proceedings of the American Mathematical Society},
  number       = {6},
  pages        = {2441 -- 2454},
  publisher    = {American Mathematical Society},
  title        = {{A note on 2D focusing many boson systems}},
  doi          = {10.1090/proc/13468},
  volume       = {145},
  year         = {2017},
}

@inproceedings{633,
  abstract     = {A Rapidly-exploring Random Tree (RRT) is an algorithm which can search a non-convex region of space by incrementally building a space-filling tree. The tree is constructed from random points drawn from system’s state space and is biased to grow towards large unexplored areas in the system. RRT can provide better coverage of a system’s possible behaviors compared with random simulations, but is more lightweight than full reachability analysis. In this paper, we explore some of the design decisions encountered while implementing a hybrid extension of the RRT algorithm, which have not been elaborated on before. In particular, we focus on handling non-determinism, which arises due to discrete transitions. We introduce the notion of important points to account for this phenomena. We showcase our ideas using heater and navigation benchmarks.},
  author       = {Bak, Stanley and Bogomolov, Sergiy and Henzinger, Thomas A and Kumar, Aviral},
  editor       = {Abate, Alessandro and Bodo, Sylvie},
  isbn         = {978-331963500-2},
  location     = {Heidelberg, Germany},
  pages        = {83 -- 89},
  publisher    = {Springer},
  title        = {{Challenges and tool implementation of hybrid rapidly exploring random trees}},
  doi          = {10.1007/978-3-319-63501-9_6},
  volume       = {10381},
  year         = {2017},
}

@inbook{634,
  abstract     = {As autism spectrum disorder (ASD) is largely regarded as a neurodevelopmental condition, long-time consensus was that its hallmark features are irreversible. However, several studies from recent years using defined mouse models of ASD have provided clear evidence that in mice neurobiological and behavioural alterations can be ameliorated or even reversed by genetic restoration or pharmacological treatment either before or after symptom onset. Here, we review findings on genetic and pharmacological reversibility of phenotypes in mouse models of ASD. Our review should give a comprehensive overview on both aspects and encourage future studies to better understand the underlying molecular mechanisms that might be translatable from animals to humans.},
  author       = {Schroeder, Jan and Deliu, Elena and Novarino, Gaia and Schmeisser, Michael},
  booktitle    = {Translational Anatomy and Cell Biology of Autism Spectrum Disorder},
  editor       = {Schmeisser, Michael and Boekers, Tobias},
  pages        = {189 -- 211},
  publisher    = {Springer},
  title        = {{Genetic and pharmacological reversibility of phenotypes in mouse models of autism spectrum disorder}},
  doi          = {10.1007/978-3-319-52498-6_10},
  volume       = {224},
  year         = {2017},
}

@inproceedings{635,
  abstract     = {Memory-hard functions (MHFs) are hash algorithms whose evaluation cost is dominated by memory cost. As memory, unlike computation, costs about the same across different platforms, MHFs cannot be evaluated at significantly lower cost on dedicated hardware like ASICs. MHFs have found widespread applications including password hashing, key derivation, and proofs-of-work. This paper focuses on scrypt, a simple candidate MHF designed by Percival, and described in RFC 7914. It has been used within a number of cryptocurrencies (e.g., Litecoin and Dogecoin) and has been an inspiration for Argon2d, one of the winners of the recent password-hashing competition. Despite its popularity, no rigorous lower bounds on its memory complexity are known. We prove that scrypt is optimally memory-hard, i.e., its cumulative memory complexity (cmc) in the parallel random oracle model is Ω(n2w), where w and n are the output length and number of invocations of the underlying hash function, respectively. High cmc is a strong security target for MHFs introduced by Alwen and Serbinenko (STOC’15) which implies high memory cost even for adversaries who can amortize the cost over many evaluations and evaluate the underlying hash functions many times in parallel. Our proof is the first showing optimal memory-hardness for any MHF. Our result improves both quantitatively and qualitatively upon the recent work by Alwen et al. (EUROCRYPT’16) who proved a weaker lower bound of Ω(n2w/ log2 n) for a restricted class of adversaries.},
  author       = {Alwen, Joel F and Chen, Binchi and Pietrzak, Krzysztof Z and Reyzin, Leonid and Tessaro, Stefano},
  editor       = {Coron, Jean-Sébastien and Buus Nielsen, Jesper},
  isbn         = {978-331956616-0},
  location     = {Paris, France},
  pages        = {33 -- 62},
  publisher    = {Springer},
  title        = {{Scrypt is maximally memory hard}},
  doi          = {10.1007/978-3-319-56617-7_2},
  volume       = {10212},
  year         = {2017},
}

@inproceedings{636,
  abstract     = {Signal regular expressions can specify sequential properties of real-valued signals based on threshold conditions, regular operations, and duration constraints. In this paper we endow them with a quantitative semantics which indicates how robustly a signal matches or does not match a given expression. First, we show that this semantics is a safe approximation of a distance between the signal and the language defined by the expression. Then, we consider the robust matching problem, that is, computing the quantitative semantics of every segment of a given signal relative to an expression. We present an algorithm that solves this problem for piecewise-constant and piecewise-linear signals and show that for such signals the robustness map is a piecewise-linear function. The availability of an indicator describing how robustly a signal segment matches some regular pattern provides a general framework for quantitative monitoring of cyber-physical systems.},
  author       = {Bakhirkin, Alexey and Ferrere, Thomas and Maler, Oded and Ulus, Dogan},
  editor       = {Abate, Alessandro and Geeraerts, Gilles},
  isbn         = {978-331965764-6},
  location     = {Berlin, Germany},
  pages        = {189 -- 206},
  publisher    = {Springer},
  title        = {{On the quantitative semantics of regular expressions over real-valued signals}},
  doi          = {10.1007/978-3-319-65765-3_11},
  volume       = {10419},
  year         = {2017},
}

@inproceedings{637,
  abstract     = {For many cryptographic primitives, it is relatively easy to achieve selective security (where the adversary commits a-priori to some of the choices to be made later in the attack) but appears difficult to achieve the more natural notion of adaptive security (where the adversary can make all choices on the go as the attack progresses). A series of several recent works shows how to cleverly achieve adaptive security in several such scenarios including generalized selective decryption (Panjwani, TCC ’07 and Fuchsbauer et al., CRYPTO ’15), constrained PRFs (Fuchsbauer et al., ASIACRYPT ’14), and Yao garbled circuits (Jafargholi and Wichs, TCC ’16b). Although the above works expressed vague intuition that they share a common technique, the connection was never made precise. In this work we present a new framework that connects all of these works and allows us to present them in a unified and simplified fashion. Moreover, we use the framework to derive a new result for adaptively secure secret sharing over access structures defined via monotone circuits. We envision that further applications will follow in the future. Underlying our framework is the following simple idea. It is well known that selective security, where the adversary commits to n-bits of information about his future choices, automatically implies adaptive security at the cost of amplifying the adversary’s advantage by a factor of up to 2n. However, in some cases the proof of selective security proceeds via a sequence of hybrids, where each pair of adjacent hybrids locally only requires some smaller partial information consisting of m ≪ n bits. The partial information needed might be completely different between different pairs of hybrids, and if we look across all the hybrids we might rely on the entire n-bit commitment. Nevertheless, the above is sufficient to prove adaptive security, at the cost of amplifying the adversary’s advantage by a factor of only 2m ≪ 2n. In all of our examples using the above framework, the different hybrids are captured by some sort of a graph pebbling game and the amount of information that the adversary needs to commit to in each pair of hybrids is bounded by the maximum number of pebbles in play at any point in time. Therefore, coming up with better strategies for proving adaptive security translates to various pebbling strategies for different types of graphs.},
  author       = {Jafargholi, Zahra and Kamath Hosdurg, Chethan and Klein, Karen and Komargodski, Ilan and Pietrzak, Krzysztof Z and Wichs, Daniel},
  editor       = {Katz, Jonathan and Shacham, Hovav},
  isbn         = {978-331963687-0},
  location     = {Santa Barbara, CA, United States},
  pages        = {133 -- 163},
  publisher    = {Springer},
  title        = {{Be adaptive avoid overcommitting}},
  doi          = {10.1007/978-3-319-63688-7_5},
  volume       = {10401},
  year         = {2017},
}

@proceedings{638,
  abstract     = {This book constitutes the refereed proceedings of the 9th InternationalWorkshop on Numerical Software Verification, NSV 2016, held in Toronto, ON, Canada in July 2011 - colocated with CAV 2016, the 28th International Conference on Computer Aided Verification.
The NSV workshop is dedicated to the development of logical and mathematical techniques for the reasoning about programmability and reliability.},
  editor       = {Bogomolov, Sergiy and Martel, Matthieu and Prabhakar, Pavithra},
  issn         = {0302-9743},
  location     = {Toronto, ON, Canada},
  publisher    = {Springer},
  title        = {{Numerical Software Verification}},
  doi          = {10.1007/978-3-319-54292-8},
  volume       = {10152},
  year         = {2017},
}

@inproceedings{639,
  abstract     = {We study the problem of developing efficient approaches for proving worst-case bounds of non-deterministic recursive programs. Ranking functions are sound and complete for proving termination and worst-case bounds of non-recursive programs. First, we apply ranking functions to recursion, resulting in measure functions, and show that they provide a sound and complete approach to prove worst-case bounds of non-deterministic recursive programs. Our second contribution is the synthesis of measure functions in non-polynomial forms. We show that non-polynomial measure functions with logarithm and exponentiation can be synthesized through abstraction of logarithmic or exponentiation terms, Farkas’ Lemma, and Handelman’s Theorem using linear programming. While previous methods obtain worst-case polynomial bounds, our approach can synthesize bounds of the form O(n log n) as well as O(nr) where r is not an integer. We present experimental results to demonstrate that our approach can efficiently obtain worst-case bounds of classical recursive algorithms such as Merge-Sort, Closest-Pair, Karatsuba’s algorithm and Strassen’s algorithm.},
  author       = {Chatterjee, Krishnendu and Fu, Hongfei and Goharshady, Amir},
  editor       = {Majumdar, Rupak and Kunčak, Viktor},
  isbn         = {978-331963389-3},
  location     = {Heidelberg, Germany},
  pages        = {41 -- 63},
  publisher    = {Springer},
  title        = {{Non-polynomial worst case analysis of recursive programs}},
  doi          = {10.1007/978-3-319-63390-9_3},
  volume       = {10427},
  year         = {2017},
}

@inproceedings{640,
  abstract     = {Data-independent Memory Hard Functions (iMHFS) are finding a growing number of applications in security; especially in the domain of password hashing. An important property of a concrete iMHF is specified by fixing a directed acyclic graph (DAG) Gn on n nodes. The quality of that iMHF is then captured by the following two pebbling complexities of Gn: – The parallel cumulative pebbling complexity Π∥cc(Gn) must be as high as possible (to ensure that the amortized cost of computing the function on dedicated hardware is dominated by the cost of memory). – The sequential space-time pebbling complexity Πst(Gn) should be as close as possible to Π∥cc(Gn) (to ensure that using many cores in parallel and amortizing over many instances does not give much of an advantage). In this paper we construct a family of DAGs with best possible parameters in an asymptotic sense, i.e., where Π∥cc(Gn) = Ω(n2/ log(n)) (which matches a known upper bound) and Πst(Gn) is within a constant factor of Π∥cc(Gn). Our analysis relies on a new connection between the pebbling complexity of a DAG and its depth-robustness (DR) – a well studied combinatorial property. We show that high DR is sufficient for high Π∥cc. Alwen and Blocki (CRYPTO’16) showed that high DR is necessary and so, together, these results fully characterize DAGs with high Π∥cc in terms of DR. Complementing these results, we provide new upper and lower bounds on the Π∥cc of several important candidate iMHFs from the literature. We give the first lower bounds on the memory hardness of the Catena and Balloon Hashing functions in a parallel model of computation and we give the first lower bounds of any kind for (a version) of Argon2i. Finally we describe a new class of pebbling attacks improving on those of Alwen and Blocki (CRYPTO’16). By instantiating these attacks we upperbound the Π∥cc of the Password Hashing Competition winner Argon2i and one of the Balloon Hashing functions by O (n1.71). We also show an upper bound of O(n1.625) for the Catena functions and the two remaining Balloon Hashing functions.},
  author       = {Alwen, Joel F and Blocki, Jeremiah and Pietrzak, Krzysztof Z},
  editor       = {Coron, Jean-Sébastien and Buus Nielsen, Jesper},
  isbn         = {978-331956616-0},
  location     = {Paris, France},
  pages        = {3 -- 32},
  publisher    = {Springer},
  title        = {{Depth-robust graphs and their cumulative memory complexity}},
  doi          = {10.1007/978-3-319-56617-7_1},
  volume       = {10212},
  year         = {2017},
}

@inproceedings{641,
  abstract     = {We introduce two novel methods for learning parameters of graphical models for image labelling. The following two tasks underline both methods: (i) perturb model parameters based on given features and ground truth labelings, so as to exactly reproduce these labelings as optima of the local polytope relaxation of the labelling problem; (ii) train a predictor for the perturbed model parameters so that improved model parameters can be applied to the labelling of novel data. Our first method implements task (i) by inverse linear programming and task (ii) using a regressor e.g. a Gaussian process. Our second approach simultaneously solves tasks (i) and (ii) in a joint manner, while being restricted to linearly parameterised predictors. Experiments demonstrate the merits of both approaches.},
  author       = {Trajkovska, Vera and Swoboda, Paul and Åström, Freddie and Petra, Stefanie},
  editor       = {Lauze, François and Dong, Yiqiu and Bjorholm Dahl, Anders},
  isbn         = {978-331958770-7},
  location     = {Kolding, Denmark},
  pages        = {323 -- 334},
  publisher    = {Springer},
  title        = {{Graphical model parameter learning by inverse linear programming}},
  doi          = {10.1007/978-3-319-58771-4_26},
  volume       = {10302},
  year         = {2017},
}

@article{642,
  abstract     = {Cauchy problems with SPDEs on the whole space are localized to Cauchy problems on a ball of radius R. This localization reduces various kinds of spatial approximation schemes to finite dimensional problems. The error is shown to be exponentially small. As an application, a numerical scheme is presented which combines the localization and the space and time discretization, and thus is fully implementable.},
  author       = {Gerencser, Mate and Gyöngy, István},
  issn         = {00255718},
  journal      = {Mathematics of Computation},
  number       = {307},
  pages        = {2373 -- 2397},
  publisher    = {American Mathematical Society},
  title        = {{Localization errors in solving stochastic partial differential equations in the whole space}},
  doi          = {10.1090/mcom/3201},
  volume       = {86},
  year         = {2017},
}

@misc{6426,
  abstract     = {Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent asynchronous computation threads. We show that specifications and correctness proofs for asynchronous programs can be structured by introducing the fiction, for proof purposes, that intermediate, non-quiescent states of asynchronous operations can be ignored. Then, the task of specification becomes relatively simple and the task of verification can be naturally decomposed into smaller sub-tasks. The sub-tasks iteratively summarize, guided by the structure of an asynchronous program, the atomic effect of non-atomic operations and the synchronous effect of asynchronous operations. This structuring of specifications and proofs corresponds to the introduction of multiple layers of stepwise refinement for asynchronous programs. We present the first proof rule, called synchronization, to reduce asynchronous invocations on a lower layer to synchronous invocations on a higher layer. We implemented our proof method in CIVL and evaluated it on a collection of benchmark programs.},
  author       = {Henzinger, Thomas A and Kragl, Bernhard and Qadeer, Shaz},
  issn         = {2664-1690},
  pages        = {28},
  publisher    = {IST Austria},
  title        = {{Synchronizing the asynchronous}},
  doi          = {10.15479/AT:IST-2018-853-v2-2},
  year         = {2017},
}

@article{643,
  abstract     = {It has been reported that nicotinamide-overload induces oxidative stress associated with insulin resistance, the key feature of type 2 diabetes mellitus (T2DM). This study aimed to investigate the effects of B vitamins in T2DM. Glucose tolerance tests (GTT) were carried out in adult Sprague-Dawley rats treated with or without cumulative doses of B vitamins. More specifically, insulin tolerance tests (ITT) were also carried out in adult Sprague-Dawley rats treated with or without cumulative doses of Vitamin B3. We found that cumulative Vitamin B1 and Vitamin B3 administration significantly increased the plasma H2O2 levels associated with high insulin levels. Only Vitamin B3 reduced muscular and hepatic glycogen contents. Cumulative administration of nicotinic acid, another form of Vitamin B3, also significantly increased plasma insulin level and H2O2 generation. Moreover, cumulative administration of nicotinic acid or nicotinamide impaired glucose metabolism. This study suggested that excess Vitamin B1 and Vitamin B3 caused oxidative stress and insulin resistance.},
  author       = {Sun, Wuping and Zhai, Ming-Zhu and Zhou, Qian and Qian, Chengrui and Jiang, Changyu},
  issn         = {03044920},
  journal      = {Chinese Journal of Physiology},
  number       = {4},
  pages        = {207 -- 214},
  publisher    = {Chinese Physiological Society},
  title        = {{Effects of B vitamins overload on plasma insulin level and hydrogen peroxide generation in rats}},
  doi          = {10.4077/CJP.2017.BAF469},
  volume       = {60},
  year         = {2017},
}

@article{644,
  abstract     = {An instance of the valued constraint satisfaction problem (VCSP) is given by a finite set of variables, a finite domain of labels, and a sum of functions, each function depending on a subset of the variables. Each function can take finite values specifying costs of assignments of labels to its variables or the infinite value, which indicates an infeasible assignment. The goal is to find an assignment of labels to the variables that minimizes the sum. We study, assuming that P 6= NP, how the complexity of this very general problem depends on the set of functions allowed in the instances, the so-called constraint language. The case when all allowed functions take values in f0;1g corresponds to ordinary CSPs, where one deals only with the feasibility issue, and there is no optimization. This case is the subject of the algebraic CSP dichotomy conjecture predicting for which constraint languages CSPs are tractable (i.e., solvable in polynomial time) and for which they are NP-hard. The case when all allowed functions take only finite values corresponds to a finitevalued CSP, where the feasibility aspect is trivial and one deals only with the optimization issue. The complexity of finite-valued CSPs was fully classified by Thapper and Živný. An algebraic necessary condition for tractability of a general-valued CSP with a fixed constraint language was recently given by Kozik and Ochremiak. As our main result, we prove that if a constraint language satisfies this algebraic necessary condition, and the feasibility CSP (i.e., the problem of deciding whether a given instance has a feasible solution) corresponding to the VCSP with this language is tractable, then the VCSP is tractable. The algorithm is a simple combination of the assumed algorithm for the feasibility CSP and the standard LP relaxation. As a corollary, we obtain that a dichotomy for ordinary CSPs would imply a dichotomy for general-valued CSPs.},
  author       = {Kolmogorov, Vladimir and Krokhin, Andrei and Rolinek, Michal},
  journal      = {SIAM Journal on Computing},
  number       = {3},
  pages        = {1087 -- 1110},
  publisher    = {SIAM},
  title        = {{The complexity of general-valued CSPs}},
  doi          = {10.1137/16M1091836},
  volume       = {46},
  year         = {2017},
}

@inproceedings{645,
  abstract     = {Markov decision processes (MDPs) are standard models for probabilistic systems with non-deterministic behaviours. Long-run average rewards provide a mathematically elegant formalism for expressing long term performance. Value iteration (VI) is one of the simplest and most efficient algorithmic approaches to MDPs with other properties, such as reachability objectives. Unfortunately, a naive extension of VI does not work for MDPs with long-run average rewards, as there is no known stopping criterion. In this work our contributions are threefold. (1) We refute a conjecture related to stopping criteria for MDPs with long-run average rewards. (2) We present two practical algorithms for MDPs with long-run average rewards based on VI. First, we show that a combination of applying VI locally for each maximal end-component (MEC) and VI for reachability objectives can provide approximation guarantees. Second, extending the above approach with a simulation-guided on-demand variant of VI, we present an anytime algorithm that is able to deal with very large models. (3) Finally, we present experimental results showing that our methods significantly outperform the standard approaches on several benchmarks.},
  author       = {Ashok, Pranav and Chatterjee, Krishnendu and Daca, Przemyslaw and Kretinsky, Jan and Meggendorfer, Tobias},
  editor       = {Majumdar, Rupak and Kunčak, Viktor},
  isbn         = {978-331963386-2},
  location     = {Heidelberg, Germany},
  pages        = {201 -- 221},
  publisher    = {Springer},
  title        = {{Value iteration for long run average reward in markov decision processes}},
  doi          = {10.1007/978-3-319-63387-9_10},
  volume       = {10426},
  year         = {2017},
}

@inproceedings{646,
  abstract     = {We present a novel convex relaxation and a corresponding inference algorithm for the non-binary discrete tomography problem, that is, reconstructing discrete-valued images from few linear measurements. In contrast to state of the art approaches that split the problem into a continuous reconstruction problem for the linear measurement constraints and a discrete labeling problem to enforce discrete-valued reconstructions, we propose a joint formulation that addresses both problems simultaneously, resulting in a tighter convex relaxation. For this purpose a constrained graphical model is set up and evaluated using a novel relaxation optimized by dual decomposition. We evaluate our approach experimentally and show superior solutions both mathematically (tighter relaxation) and experimentally in comparison to previously proposed relaxations.},
  author       = {Kuske, Jan and Swoboda, Paul and Petra, Stefanie},
  editor       = {Lauze, François and Dong, Yiqiu and Bjorholm Dahl, Anders},
  isbn         = {978-331958770-7},
  location     = {Kolding, Denmark},
  pages        = {235 -- 246},
  publisher    = {Springer},
  title        = {{A novel convex relaxation for non binary discrete tomography}},
  doi          = {10.1007/978-3-319-58771-4_19},
  volume       = {10302},
  year         = {2017},
}

@inproceedings{647,
  abstract     = {Despite researchers’ efforts in the last couple of decades, reachability analysis is still a challenging problem even for linear hybrid systems. Among the existing approaches, the most practical ones are mainly based on bounded-time reachable set over-approximations. For the purpose of unbounded-time analysis, one important strategy is to abstract the original system and find an invariant for the abstraction. In this paper, we propose an approach to constructing a new kind of abstraction called conic abstraction for affine hybrid systems, and to computing reachable sets based on this abstraction. The essential feature of a conic abstraction is that it partitions the state space of a system into a set of convex polyhedral cones which is derived from a uniform conic partition of the derivative space. Such a set of polyhedral cones is able to cut all trajectories of the system into almost straight segments so that every segment of a reach pipe in a polyhedral cone tends to be straight as well, and hence can be over-approximated tightly by polyhedra using similar techniques as HyTech or PHAVer. In particular, for diagonalizable affine systems, our approach can guarantee to find an invariant for unbounded reachable sets, which is beyond the capability of bounded-time reachability analysis tools. We implemented the approach in a tool and experiments on benchmarks show that our approach is more powerful than SpaceEx and PHAVer in dealing with diagonalizable systems.},
  author       = {Bogomolov, Sergiy and Giacobbe, Mirco and Henzinger, Thomas A and Kong, Hui},
  isbn         = {978-331965764-6},
  location     = {Berlin, Germany},
  pages        = {116 -- 132},
  publisher    = {Springer},
  title        = {{Conic abstractions for hybrid systems}},
  doi          = {10.1007/978-3-319-65765-3_7},
  volume       = {10419 },
  year         = {2017},
}

@inproceedings{648,
  abstract     = {Pseudoentropy has found a lot of important applications to cryptography and complexity theory. In this paper we focus on the foundational problem that has not been investigated so far, namely by how much pseudoentropy (the amount seen by computationally bounded attackers) differs from its information-theoretic counterpart (seen by unbounded observers), given certain limits on attacker’s computational power? We provide the following answer for HILL pseudoentropy, which exhibits a threshold behavior around the size exponential in the entropy amount:– If the attacker size (s) and advantage () satisfy s (formula presented) where k is the claimed amount of pseudoentropy, then the pseudoentropy boils down to the information-theoretic smooth entropy. – If s (formula presented) then pseudoentropy could be arbitrarily bigger than the information-theoretic smooth entropy. Besides answering the posted question, we show an elegant application of our result to the complexity theory, namely that it implies the clas-sical result on the existence of functions hard to approximate (due to Pippenger). In our approach we utilize non-constructive techniques: the duality of linear programming and the probabilistic method.},
  author       = {Skórski, Maciej},
  editor       = {Jäger, Gerhard and Steila, Silvia},
  isbn         = {978-331955910-0},
  location     = {Bern, Switzerland},
  pages        = {600 -- 613},
  publisher    = {Springer},
  title        = {{On the complexity of breaking pseudoentropy}},
  doi          = {10.1007/978-3-319-55911-7_43},
  volume       = {10185},
  year         = {2017},
}

@inbook{649,
  abstract     = {We give a short overview on a recently developed notion of Ricci curvature for discrete spaces. This notion relies on geodesic convexity properties of the relative entropy along geodesics in the space of probability densities, for a metric which is similar to (but different from) the 2-Wasserstein metric. The theory can be considered as a discrete counterpart to the theory of Ricci curvature for geodesic measure spaces developed by Lott–Sturm–Villani.},
  author       = {Maas, Jan},
  booktitle    = {Modern Approaches to Discrete Curvature},
  editor       = {Najman, Laurent and Romon, Pascal},
  isbn         = {978-3-319-58001-2},
  issn         = {978-3-319-58002-9},
  pages        = {159 -- 174},
  publisher    = {Springer},
  title        = {{Entropic Ricci curvature for discrete spaces}},
  doi          = {10.1007/978-3-319-58002-9_5},
  volume       = {2184},
  year         = {2017},
}