@article{6848, abstract = {Proton-translocating transhydrogenase (also known as nicotinamide nucleotide transhydrogenase (NNT)) is found in the plasma membranes of bacteria and the inner mitochondrial membranes of eukaryotes. NNT catalyses the transfer of a hydride between NADH and NADP+, coupled to the translocation of one proton across the membrane. Its main physiological function is the generation of NADPH, which is a substrate in anabolic reactions and a regulator of oxidative status; however, NNT may also fine-tune the Krebs cycle1,2. NNT deficiency causes familial glucocorticoid deficiency in humans and metabolic abnormalities in mice, similar to those observed in type II diabetes3,4. The catalytic mechanism of NNT has been proposed to involve a rotation of around 180° of the entire NADP(H)-binding domain that alternately participates in hydride transfer and proton-channel gating. However, owing to the lack of high-resolution structures of intact NNT, the details of this process remain unclear5,6. Here we present the cryo-electron microscopy structure of intact mammalian NNT in different conformational states. We show how the NADP(H)-binding domain opens the proton channel to the opposite sides of the membrane, and we provide structures of these two states. We also describe the catalytically important interfaces and linkers between the membrane and the soluble domains and their roles in nucleotide exchange. These structures enable us to propose a revised mechanism for a coupling process in NNT that is consistent with a large body of previous biochemical work. Our results are relevant to the development of currently unavailable NNT inhibitors, which may have therapeutic potential in ischaemia reperfusion injury, metabolic syndrome and some cancers7,8,9.}, author = {Kampjut, Domen and Sazanov, Leonid A}, issn = {1476-4687}, journal = {Nature}, number = {7773}, pages = {291–295}, publisher = {Springer Nature}, title = {{Structure and mechanism of mitochondrial proton-translocating transhydrogenase}}, doi = {10.1038/s41586-019-1519-2}, volume = {573}, year = {2019}, } @article{6194, abstract = {Grid cells with their rigid hexagonal firing fields are thought to provide an invariant metric to the hippocampal cognitive map, yet environmental geometrical features have recently been shown to distort the grid structure. Given that the hippocampal role goes beyond space, we tested the influence of nonspatial information on the grid organization. We trained rats to daily learn three new reward locations on a cheeseboard maze while recording from the medial entorhinal cortex and the hippocampal CA1 region. Many grid fields moved toward goal location, leading to long-lasting deformations of the entorhinal map. Therefore, distortions in the grid structure contribute to goal representation during both learning and recall, which demonstrates that grid cells participate in mnemonic coding and do not merely provide a simple metric of space.}, author = {Boccara, Charlotte N. and Nardin, Michele and Stella, Federico and O'Neill, Joseph and Csicsvari, Jozsef L}, issn = {1095-9203}, journal = {Science}, number = {6434}, pages = {1443--1447}, publisher = {American Association for the Advancement of Science}, title = {{The entorhinal cognitive map is attracted to goals}}, doi = {10.1126/science.aav4837}, volume = {363}, year = {2019}, } @phdthesis{7132, abstract = {A major challenge in neuroscience research is to dissect the circuits that orchestrate behavior in health and disease. Proteins from a wide range of non-mammalian species, such as microbial opsins, have been successfully transplanted to specific neuronal targets to override their natural communication patterns. The goal of our work is to manipulate synaptic communication in a manner that closely incorporates the functional intricacies of synapses by preserving temporal encoding (i.e. the firing pattern of the presynaptic neuron) and connectivity (i.e. target specific synapses rather than specific neurons). Our strategy to achieve this goal builds on the use of non-mammalian transplants to create a synthetic synapse. The mode of modulation comes from pre-synaptic uptake of a synthetic neurotransmitter (SN) into synaptic vesicles by means of a genetically targeted transporter selective for the SN. Upon natural vesicular release, exposure of the SN to the synaptic cleft will modify the post-synaptic potential through an orthogonal ligand gated ion channel. To achieve this goal we have functionally characterized a mixed cationic methionine-gated ion channel from Arabidopsis thaliana, designed a method to functionally characterize a synthetic transporter in isolated synaptic vesicles without the need for transgenic animals, identified and extracted multiple prokaryotic uptake systems that are substrate specific for methionine (Met), and established a primary/cell line co-culture system that would allow future combinatorial testing of this orthogonal transmitter-transporter-channel trifecta. Synthetic synapses will provide a unique opportunity to manipulate synaptic communication while maintaining the electrophysiological integrity of the pre-synaptic cell. In this way, information may be preserved that was generated in upstream circuits and that could be essential for concerted function and information processing.}, author = {Mckenzie, Catherine}, issn = {2663-337X}, pages = {95}, publisher = {Institute of Science and Technology Austria}, title = {{Design and characterization of methods and biological components to realize synthetic neurotransmission}}, doi = {10.15479/at:ista:7132}, year = {2019}, } @article{5949, abstract = {Aberrant proteostasis of protein aggregation may lead to behavior disorders including chronic mental illnesses (CMI). Furthermore, the neuronal activity alterations that underlie CMI are not well understood. We recorded the local field potential and single-unit activity of the hippocampal CA1 region in vivo in rats transgenically overexpressing the Disrupted-in-Schizophrenia 1 (DISC1) gene (tgDISC1), modeling sporadic CMI. These tgDISC1 rats have previously been shown to exhibit DISC1 protein aggregation, disturbances in the dopaminergic system and attention-related deficits. Recordings were performed during exploration of familiar and novel open field environments and during sleep, allowing investigation of neuronal abnormalities in unconstrained behavior. Compared to controls, tgDISC1 place cells exhibited smaller place fields and decreased speed-modulation of their firing rates, demonstrating altered spatial coding and deficits in encoding location-independent sensory inputs. Oscillation analyses showed that tgDISC1 pyramidal neurons had higher theta phase locking strength during novelty, limiting their phase coding ability. However, their mean theta phases were more variable at the population level, reducing oscillatory network synchronization. Finally, tgDISC1 pyramidal neurons showed a lack of novelty-induced shift in their preferred theta and gamma firing phases, indicating deficits in coding of novel environments with oscillatory firing. By combining single cell and neuronal population analyses, we link DISC1 protein pathology with abnormal hippocampal neural coding and network synchrony, and thereby gain a more comprehensive understanding of CMI mechanisms.}, author = {Käfer, Karola and Malagon-Vina, Hugo and Dickerson, Desiree and O'Neill, Joseph and Trossbach, Svenja V. and Korth, Carsten and Csicsvari, Jozsef L}, journal = {Hippocampus}, number = {9}, pages = {802--816}, publisher = {Wiley}, title = {{Disrupted-in-schizophrenia 1 overexpression disrupts hippocampal coding and oscillatory synchronization}}, doi = {10.1002/hipo.23076}, volume = {29}, year = {2019}, } @phdthesis{6825, abstract = {The solving of complex tasks requires the functions of more than one brain area and their interaction. Whilst spatial navigation and memory is dependent on the hippocampus, flexible behavior relies on the medial prefrontal cortex (mPFC). To further examine the roles of the hippocampus and mPFC, we recorded their neural activity during a task that depends on both of these brain regions. With tetrodes, we recorded the extracellular activity of dorsal hippocampal CA1 (HPC) and mPFC neurons in Long-Evans rats performing a rule-switching task on the plus-maze. The plus-maze task had a spatial component since it required navigation along one of the two start arms and at the maze center a choice between one of the two goal arms. Which goal contained a reward depended on the rule currently in place. After an uncued rule change the animal had to abandon the old strategy and switch to the new rule, testing cognitive flexibility. Investigating the coordination of activity between the HPC and mPFC allows determination during which task stages their interaction is required. Additionally, comparing neural activity patterns in these two brain regions allows delineation of the specialized functions of the HPC and mPFC in this task. We analyzed neural activity in the HPC and mPFC in terms of oscillatory interactions, rule coding and replay. We found that theta coherence between the HPC and mPFC is increased at the center and goals of the maze, both when the rule was stable or has changed. Similar results were found for locking of HPC and mPFC neurons to HPC theta oscillations. However, no differences in HPC-mPFC theta coordination were observed between the spatially- and cue-guided rule. Phase locking of HPC and mPFC neurons to HPC gamma oscillations was not modulated by maze position or rule type. We found that the HPC coded for the two different rules with cofiring relationships between cell pairs. However, we could not find conclusive evidence for rule coding in the mPFC. Spatially-selective firing in the mPFC generalized between the two start and two goal arms. With Bayesian positional decoding, we found that the mPFC reactivated non-local positions during awake immobility periods. Replay of these non-local positions could represent entire behavioral trajectories resembling trajectory replay of the HPC. Furthermore, mPFC trajectory-replay at the goal positively correlated with rule-switching performance. Finally, HPC and mPFC trajectory replay occurred independently of each other. These results show that the mPFC can replay ordered patterns of activity during awake immobility, possibly underlying its role in flexible behavior. }, author = {Käfer, Karola}, issn = {2663-337X}, pages = {89}, publisher = {Institute of Science and Technology Austria}, title = {{The hippocampus and medial prefrontal cortex during flexible behavior}}, doi = {10.15479/AT:ISTA:6825}, year = {2019}, } @article{6713, abstract = {Evolutionary studies are often limited by missing data that are critical to understanding the history of selection. Selection experiments, which reproduce rapid evolution under controlled conditions, are excellent tools to study how genomes evolve under selection. Here we present a genomic dissection of the Longshanks selection experiment, in which mice were selectively bred over 20 generations for longer tibiae relative to body mass, resulting in 13% longer tibiae in two replicates. We synthesized evolutionary theory, genome sequences and molecular genetics to understand the selection response and found that it involved both polygenic adaptation and discrete loci of major effect, with the strongest loci tending to be selected in parallel between replicates. We show that selection may favor de-repression of bone growth through inactivating two limb enhancers of an inhibitor, Nkx3-2. Our integrative genomic analyses thus show that it is possible to connect individual base-pair changes to the overall selection response.}, author = {Castro, João Pl and Yancoskie, Michelle N. and Marchini, Marta and Belohlavy, Stefanie and Hiramatsu, Layla and Kučka, Marek and Beluch, William H. and Naumann, Ronald and Skuplik, Isabella and Cobb, John and Barton, Nicholas H and Rolian, Campbell and Chan, Yingguang Frank}, journal = {eLife}, publisher = {eLife Sciences Publications}, title = {{An integrative genomic analysis of the Longshanks selection experiment for longer limbs in mice}}, doi = {10.7554/eLife.42014}, volume = {8}, year = {2019}, } @unpublished{10065, abstract = {We study double quantum dots in a Ge/SiGe heterostructure and test their maturity towards singlet-triplet ($S-T_0$) qubits. We demonstrate a large range of tunability, from two single quantum dots to a double quantum dot. We measure Pauli spin blockade and study the anisotropy of the $g$-factor. We use an adjacent quantum dot for sensing charge transitions in the double quantum dot at interest. In conclusion, Ge/SiGe possesses all ingredients necessary for building a singlet-triplet qubit.}, author = {Hofmann, Andrea C and Jirovec, Daniel and Borovkov, Maxim and Prieto Gonzalez, Ivan and Ballabio, Andrea and Frigerio, Jacopo and Chrastina, Daniel and Isella, Giovanni and Katsaros, Georgios}, booktitle = {arXiv}, title = {{Assessing the potential of Ge/SiGe quantum dots as hosts for singlet-triplet qubits}}, doi = {10.48550/arXiv.1910.05841}, year = {2019}, } @article{6187, abstract = {Aberrant display of the truncated core1 O-glycan T-antigen is a common feature of human cancer cells that correlates with metastasis. Here we show that T-antigen in Drosophila melanogaster macrophages is involved in their developmentally programmed tissue invasion. Higher macrophage T-antigen levels require an atypical major facilitator superfamily (MFS) member that we named Minerva which enables macrophage dissemination and invasion. We characterize for the first time the T and Tn glycoform O-glycoproteome of the Drosophila melanogaster embryo, and determine that Minerva increases the presence of T-antigen on proteins in pathways previously linked to cancer, most strongly on the sulfhydryl oxidase Qsox1 which we show is required for macrophage tissue entry. Minerva’s vertebrate ortholog, MFSD1, rescues the minerva mutant’s migration and T-antigen glycosylation defects. We thus identify a key conserved regulator that orchestrates O-glycosylation on a protein subset to activate a program governing migration steps important for both development and cancer metastasis.}, author = {Valosková, Katarina and Biebl, Julia and Roblek, Marko and Emtenani, Shamsi and György, Attila and Misova, Michaela and Ratheesh, Aparna and Rodrigues, Patricia and Shkarina, Katerina and Larsen, Ida Signe Bohse and Vakhrushev, Sergey Y and Clausen, Henrik and Siekhaus, Daria E}, issn = {2050-084X}, journal = {eLife}, publisher = {eLife Sciences Publications}, title = {{A conserved major facilitator superfamily member orchestrates a subset of O-glycosylation to aid macrophage tissue invasion}}, doi = {10.7554/elife.41801}, volume = {8}, year = {2019}, } @phdthesis{6546, abstract = {Invasive migration plays a crucial role not only during development and homeostasis but also in pathological states, such as tumor metastasis. Drosophila macrophage migration into the extended germband is an interesting system to study invasive migration. It carries similarities to immune cell transmigration and cancer cell invasion, therefore studying this process could also bring new understanding of invasion in higher organisms. In our work, we uncover a highly conserved member of the major facilitator family that plays a role in tissue invasion through regulation of glycosylation on a subgroup of proteins and/or by aiding the precise timing of DN-Cadherin downregulation. Aberrant display of the truncated core1 O-glycan T-antigen is a common feature of human cancer cells that correlates with metastasis. Here we show that T-antigen in Drosophila melanogaster macrophages is involved in their developmentally programmed tissue invasion. Higher macrophage T-antigen levels require an atypical major facilitator superfamily (MFS) member that we named Minerva which enables macrophage dissemination and invasion. We characterize for the first time the T and Tn glycoform O-glycoproteome of the Drosophila melanogaster embryo, and determine that Minerva increases the presence of T-antigen on proteins in pathways previously linked to cancer, most strongly on the sulfhydryl oxidase Qsox1 which we show is required for macrophage tissue entry. Minerva’s vertebrate ortholog, MFSD1, rescues the minerva mutant’s migration and T-antigen glycosylation defects. We thus identify a key conserved regulator that orchestrates O-glycosylation on a protein subset to activate a program governing migration steps important for both development and cancer metastasis. }, author = {Valosková, Katarina}, issn = {2663-337X}, pages = {141}, publisher = {Institute of Science and Technology Austria}, title = {{The role of a highly conserved major facilitator superfamily member in Drosophila embryonic macrophage migration}}, doi = {10.15479/AT:ISTA:6546}, year = {2019}, } @phdthesis{6363, abstract = {Distinguishing between similar experiences is achieved by the brain in a process called pattern separation. In the hippocampus, pattern separation reduces the interference of memories and increases the storage capacity by decorrelating similar inputs patterns of neuronal activity into non-overlapping output firing patterns. Winners-take-all (WTA) mechanism is a theoretical model for pattern separation in which a "winner" cell suppresses the activity of the neighboring neurons through feedback inhibition. However, if the network properties of the dentate gyrus support WTA as a biologically conceivable model remains unknown. Here, we showed that the connectivity rules of PV+interneurons and their synaptic properties are optimizedfor efficient pattern separation. We found using multiple whole-cell in vitrorecordings that PV+interneurons mainly connect to granule cells (GC) through lateral inhibition, a form of feedback inhibition in which a GC inhibits other GCs but not itself through the activation of PV+interneurons. Thus, lateral inhibition between GC–PV+interneurons was ~10 times more abundant than recurrent connections. Furthermore, the GC–PV+interneuron connectivity was more spatially confined but less abundant than PV+interneurons–GC connectivity, leading to an asymmetrical distribution of excitatory and inhibitory connectivity. Our network model of the dentate gyrus with incorporated real connectivity rules efficiently decorrelates neuronal activity patterns using WTA as the primary mechanism. This process relied on lateral inhibition, fast-signaling properties of PV+interneurons and the asymmetrical distribution of excitatory and inhibitory connectivity. Finally, we found that silencing the activity of PV+interneurons in vivoleads to acute deficits in discrimination between similar environments, suggesting that PV+interneuron networks are necessary for behavioral relevant computations. Our results demonstrate that PV+interneurons possess unique connectivity and fast signaling properties that confer to the dentate gyrus network properties that allow the emergence of pattern separation. Thus, our results contribute to the knowledge of how specific forms of network organization underlie sophisticated types of information processing. }, author = {Espinoza Martinez, Claudia }, isbn = {978-3-99078-000-8}, issn = {2663-337X}, pages = {140}, publisher = {Institute of Science and Technology Austria}, title = {{Parvalbumin+ interneurons enable efficient pattern separation in hippocampal microcircuits}}, doi = {10.15479/AT:ISTA:6363}, year = {2019}, } @inproceedings{6780, abstract = {In this work, we consider the almost-sure termination problem for probabilistic programs that asks whether a given probabilistic program terminates with probability 1. Scalable approaches for program analysis often rely on modularity as their theoretical basis. In non-probabilistic programs, the classical variant rule (V-rule) of Floyd-Hoare logic provides the foundation for modular analysis. Extension of this rule to almost-sure termination of probabilistic programs is quite tricky, and a probabilistic variant was proposed in [16]. While the proposed probabilistic variant cautiously addresses the key issue of integrability, we show that the proposed modular rule is still not sound for almost-sure termination of probabilistic programs. Besides establishing unsoundness of the previous rule, our contributions are as follows: First, we present a sound modular rule for almost-sure termination of probabilistic programs. Our approach is based on a novel notion of descent supermartingales. Second, for algorithmic approaches, we consider descent supermartingales that are linear and show that they can be synthesized in polynomial time. Finally, we present experimental results on a variety of benchmarks and several natural examples that model various types of nested while loops in probabilistic programs and demonstrate that our approach is able to efficiently prove their almost-sure termination property}, author = {Huang, Mingzhang and Fu, Hongfei and Chatterjee, Krishnendu and Goharshady, Amir Kafshdar}, booktitle = {Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications }, location = {Athens, Greece}, publisher = {ACM}, title = {{Modular verification for almost-sure termination of probabilistic programs}}, doi = {10.1145/3360555}, volume = {3}, year = {2019}, } @article{6380, abstract = {There is a huge gap between the speeds of modern caches and main memories, and therefore cache misses account for a considerable loss of efficiency in programs. The predominant technique to address this issue has been Data Packing: data elements that are frequently accessed within time proximity are packed into the same cache block, thereby minimizing accesses to the main memory. We consider the algorithmic problem of Data Packing on a two-level memory system. Given a reference sequence R of accesses to data elements, the task is to partition the elements into cache blocks such that the number of cache misses on R is minimized. The problem is notoriously difficult: it is NP-hard even when the cache has size 1, and is hard to approximate for any cache size larger than 4. Therefore, all existing techniques for Data Packing are based on heuristics and lack theoretical guarantees. In this work, we present the first positive theoretical results for Data Packing, along with new and stronger negative results. We consider the problem under the lens of the underlying access hypergraphs, which are hypergraphs of affinities between the data elements, where the order of an access hypergraph corresponds to the size of the affinity group. We study the problem parameterized by the treewidth of access hypergraphs, which is a standard notion in graph theory to measure the closeness of a graph to a tree. Our main results are as follows: We show there is a number q* depending on the cache parameters such that (a) if the access hypergraph of order q* has constant treewidth, then there is a linear-time algorithm for Data Packing; (b)the Data Packing problem remains NP-hard even if the access hypergraph of order q*-1 has constant treewidth. Thus, we establish a fine-grained dichotomy depending on a single parameter, namely, the highest order among access hypegraphs that have constant treewidth; and establish the optimal value q* of this parameter. Finally, we present an experimental evaluation of a prototype implementation of our algorithm. Our results demonstrate that, in practice, access hypergraphs of many commonly-used algorithms have small treewidth. We compare our approach with several state-of-the-art heuristic-based algorithms and show that our algorithm leads to significantly fewer cache-misses. }, author = {Chatterjee, Krishnendu and Goharshady, Amir Kafshdar and Okati, Nastaran and Pavlogiannis, Andreas}, issn = {2475-1421}, journal = {Proceedings of the ACM on Programming Languages}, number = {POPL}, publisher = {ACM}, title = {{Efficient parameterized algorithms for data packing}}, doi = {10.1145/3290366}, volume = {3}, year = {2019}, } @inproceedings{6056, abstract = {In today's programmable blockchains, smart contracts are limited to being deterministic and non-probabilistic. This lack of randomness is a consequential limitation, given that a wide variety of real-world financial contracts, such as casino games and lotteries, depend entirely on randomness. As a result, several ad-hoc random number generation approaches have been developed to be used in smart contracts. These include ideas such as using an oracle or relying on the block hash. However, these approaches are manipulatable, i.e. their output can be tampered with by parties who might not be neutral, such as the owner of the oracle or the miners.We propose a novel game-theoretic approach for generating provably unmanipulatable pseudorandom numbers on the blockchain. Our approach allows smart contracts to access a trustworthy source of randomness that does not rely on potentially compromised miners or oracles, hence enabling the creation of a new generation of smart contracts that are not limited to being non-probabilistic and can be drawn from the much more general class of probabilistic programs.}, author = {Chatterjee, Krishnendu and Goharshady, Amir Kafshdar and Pourdamghani, Arash}, booktitle = {IEEE International Conference on Blockchain and Cryptocurrency}, location = {Seoul, Korea}, publisher = {IEEE}, title = {{Probabilistic smart contracts: Secure randomness on the blockchain}}, doi = {10.1109/BLOC.2019.8751326}, year = {2019}, } @inproceedings{6378, abstract = {In today's cryptocurrencies, Hashcash proof of work is the most commonly-adopted approach to mining. In Hashcash, when a miner decides to add a block to the chain, she has to solve the difficult computational puzzle of inverting a hash function. While Hashcash has been successfully adopted in both Bitcoin and Ethereum, it has attracted significant and harsh criticism due to its massive waste of electricity, its carbon footprint and environmental effects, and the inherent lack of usefulness in inverting a hash function. Various other mining protocols have been suggested, including proof of stake, in which a miner's chance of adding the next block is proportional to her current balance. However, such protocols lead to a higher entry cost for new miners who might not still have any stake in the cryptocurrency, and can in the worst case lead to an oligopoly, where the rich have complete control over mining. In this paper, we propose Hybrid Mining: a new mining protocol that combines solving real-world useful problems with Hashcash. Our protocol allows new miners to join the network by taking part in Hashcash mining without having to own an initial stake. It also allows nodes of the network to submit hard computational problems whose solutions are of interest in the real world, e.g.~protein folding problems. Then, miners can choose to compete in solving these problems, in lieu of Hashcash, for adding a new block. Hence, Hybrid Mining incentivizes miners to solve useful problems, such as hard computational problems arising in biology, in a distributed manner. It also gives researchers in other areas an easy-to-use tool to outsource their hard computations to the blockchain network, which has enormous computational power, by paying a reward to the miner who solves the problem for them. Moreover, our protocol provides strong security guarantees and is at least as resilient to double spending as Bitcoin.}, author = {Chatterjee, Krishnendu and Goharshady, Amir Kafshdar and Pourdamghani, Arash}, booktitle = {Proceedings of the 34th ACM Symposium on Applied Computing}, isbn = {9781450359337}, location = {Limassol, Cyprus}, pages = {374--381}, publisher = {ACM}, title = {{Hybrid Mining: Exploiting blockchain’s computational power for distributed problem solving}}, doi = {10.1145/3297280.3297319}, volume = {Part F147772}, year = {2019}, } @inproceedings{6175, abstract = {We consider the problem of expected cost analysis over nondeterministic probabilistic programs, which aims at automated methods for analyzing the resource-usage of such programs. Previous approaches for this problem could only handle nonnegative bounded costs. However, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols, both positive and negative costs are necessary and the costs are unbounded as well. In this work, we present a sound and efficient approach to obtain polynomial bounds on the expected accumulated cost of nondeterministic probabilistic programs. Our approach can handle (a) general positive and negative costs with bounded updates in variables; and (b) nonnegative costs with general updates to variables. We show that several natural examples which could not be handled by previous approaches are captured in our framework. Moreover, our approach leads to an efficient polynomial-time algorithm, while no previous approach for cost analysis of probabilistic programs could guarantee polynomial runtime. Finally, we show the effectiveness of our approach using experimental results on a variety of programs for which we efficiently synthesize tight resource-usage bounds.}, author = {Wang, Peixin and Fu, Hongfei and Goharshady, Amir Kafshdar and Chatterjee, Krishnendu and Qin, Xudong and Shi, Wenjun}, booktitle = {PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation}, keywords = {Program Cost Analysis, Program Termination, Probabilistic Programs, Martingales}, location = {Phoenix, AZ, United States}, pages = {204--220}, publisher = {Association for Computing Machinery}, title = {{Cost analysis of nondeterministic probabilistic programs}}, doi = {10.1145/3314221.3314581}, year = {2019}, } @inproceedings{6490, abstract = {Smart contracts are programs that are stored and executed on the Blockchain and can receive, manage and transfer money (cryptocurrency units). Two important problems regarding smart contracts are formal analysis and compiler optimization. Formal analysis is extremely important, because smart contracts hold funds worth billions of dollars and their code is immutable after deployment. Hence, an undetected bug can cause significant financial losses. Compiler optimization is also crucial, because every action of a smart contract has to be executed by every node in the Blockchain network. Therefore, optimizations in compiling smart contracts can lead to significant savings in computation, time and energy. Two classical approaches in program analysis and compiler optimization are intraprocedural and interprocedural analysis. In intraprocedural analysis, each function is analyzed separately, while interprocedural analysis considers the entire program. In both cases, the analyses are usually reduced to graph problems over the control flow graph (CFG) of the program. These graph problems are often computationally expensive. Hence, there has been ample research on exploiting structural properties of CFGs for efficient algorithms. One such well-studied property is the treewidth, which is a measure of tree-likeness of graphs. It is known that intraprocedural CFGs of structured programs have treewidth at most 6, whereas the interprocedural treewidth cannot be bounded. This result has been used as a basis for many efficient intraprocedural analyses. In this paper, we explore the idea of exploiting the treewidth of smart contracts for formal analysis and compiler optimization. First, similar to classical programs, we show that the intraprocedural treewidth of structured Solidity and Vyper smart contracts is at most 9. Second, for global analysis, we prove that the interprocedural treewidth of structured smart contracts is bounded by 10 and, in sharp contrast with classical programs, treewidth-based algorithms can be easily applied for interprocedural analysis. Finally, we supplement our theoretical results with experiments using a tool we implemented for computing treewidth of smart contracts and show that the treewidth is much lower in practice. We use 36,764 real-world Ethereum smart contracts as benchmarks and find that they have an average treewidth of at most 3.35 for the intraprocedural case and 3.65 for the interprocedural case. }, author = {Chatterjee, Krishnendu and Goharshady, Amir Kafshdar and Goharshady, Ehsan Kafshdar}, booktitle = {Proceedings of the 34th ACM Symposium on Applied Computing}, isbn = {9781450359337}, location = {Limassol, Cyprus}, pages = {400--408}, publisher = {ACM}, title = {{The treewidth of smart contracts}}, doi = {10.1145/3297280.3297322}, volume = {Part F147772}, year = {2019}, } @article{7158, abstract = {Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, and so on. Recursive state machines (RSMs) are standard models for interprocedural analysis. We consider a general framework with RSMs where the transitions are labeled from a semiring and path properties are algebraic with semiring operations. RSMs with algebraic path properties can model interprocedural dataflow analysis problems, the shortest path problem, the most probable path problem, and so on. The traditional algorithms for interprocedural analysis focus on path properties where the starting point is fixed as the entry point of a specific method. In this work, we consider possible multiple queries as required in many applications such as in alias analysis. The study of multiple queries allows us to bring in an important algorithmic distinction between the resource usage of the one-time preprocessing vs for each individual query. The second aspect we consider is that the control flow graphs for most programs have constant treewidth. Our main contributions are simple and implementable algorithms that support multiple queries for algebraic path properties for RSMs that have constant treewidth. Our theoretical results show that our algorithms have small additional one-time preprocessing but can answer subsequent queries significantly faster as compared to the current algorithmic solutions for interprocedural dataflow analysis. We have also implemented our algorithms and evaluated their performance for performing on-demand interprocedural dataflow analysis on various domains, such as for live variable analysis and reaching definitions, on a standard benchmark set. Our experimental results align with our theoretical statements and show that after a lightweight preprocessing, on-demand queries are answered much faster than the standard existing algorithmic approaches. }, author = {Chatterjee, Krishnendu and Goharshady, Amir Kafshdar and Goyal, Prateesh and Ibsen-Jensen, Rasmus and Pavlogiannis, Andreas}, issn = {0164-0925}, journal = {ACM Transactions on Programming Languages and Systems}, number = {4}, publisher = {ACM}, title = {{Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth}}, doi = {10.1145/3363525}, volume = {41}, year = {2019}, } @article{7014, 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 nonrecursive programs. First, we apply ranking functions to recursion, resulting in measure functions. We show that measure functions 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 nonpolynomial 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 $\mathcal{O}(n\log n)$ as well as $\mathcal{O}(n^r)$ where $r$ is not an integer. We present experimental results to demonstrate that our approach can obtain efficiently worst-case bounds of classical recursive algorithms such as (i) Merge-Sort, the divide-and-conquer algorithm for the Closest-Pair problem, where we obtain $\mathcal{O}(n \log n)$ worst-case bound, and (ii) Karatsuba's algorithm for polynomial multiplication and Strassen's algorithm for matrix multiplication, where we obtain $\mathcal{O}(n^r)$ bound such that $r$ is not an integer and close to the best-known bounds for the respective algorithms.}, author = {Chatterjee, Krishnendu and Fu, Hongfei and Goharshady, Amir Kafshdar}, journal = {ACM Transactions on Programming Languages and Systems}, number = {4}, publisher = {ACM}, title = {{Non-polynomial worst-case analysis of recursive programs}}, doi = {10.1145/3339984}, volume = {41}, year = {2019}, } @article{6486, abstract = {Based on a novel control scheme, where a steady modification of the streamwise velocity profile leads to complete relaminarization of initially fully turbulent pipe flow, we investigate the applicability and usefulness of custom-shaped honeycombs for such control. The custom-shaped honeycombs are used as stationary flow management devices which generate specific modifications of the streamwise velocity profile. Stereoscopic particle image velocimetry and pressure drop measurements are used to investigate and capture the development of the relaminarizing flow downstream these devices. We compare the performance of straight (constant length across the radius of the pipe) honeycombs with custom-shaped ones (variable length across the radius) and try to determine the optimal shape for maximal relaminarization at minimal pressure loss. The optimally modified streamwise velocity profile is found to be M-shaped, and the maximum attainable Reynolds number for total relaminarization is found to be of the order of 10,000. Consequently, the respective reduction in skin friction downstream of the device is almost by a factor of 5. The break-even point, where the additional pressure drop caused by the device is balanced by the savings due to relaminarization and a net gain is obtained, corresponds to a downstream stretch of distances as low as approximately 100 pipe diameters of laminar flow.}, author = {Kühnen, Jakob and Scarselli, Davide and Hof, Björn}, issn = {1528901X}, journal = {Journal of Fluids Engineering}, number = {11}, publisher = {ASME}, title = {{Relaminarization of pipe flow by means of 3D-printed shaped honeycombs}}, doi = {10.1115/1.4043494}, volume = {141}, year = {2019}, } @article{6228, abstract = {Following the recent observation that turbulent pipe flow can be relaminarised bya relatively simple modification of the mean velocity profile, we here carry out aquantitative experimental investigation of this phenomenon. Our study confirms thata flat velocity profile leads to a collapse of turbulence and in order to achieve theblunted profile shape, we employ a moving pipe segment that is briefly and rapidlyshifted in the streamwise direction. The relaminarisation threshold and the minimumshift length and speeds are determined as a function of Reynolds number. Althoughturbulence is still active after the acceleration phase, the modulated profile possessesa severely decreased lift-up potential as measured by transient growth. As shown,this results in an exponential decay of fluctuations and the flow relaminarises. Whilethis method can be easily applied at low to moderate flow speeds, the minimumstreamwise length over which the acceleration needs to act increases linearly with theReynolds number.}, author = {Scarselli, Davide and Kühnen, Jakob and Hof, Björn}, issn = {14697645}, journal = {Journal of Fluid Mechanics}, pages = {934--948}, publisher = {Cambridge University Press}, title = {{Relaminarising pipe flow by wall movement}}, doi = {10.1017/jfm.2019.191}, volume = {867}, year = {2019}, }