[{"quality_controlled":"1","publisher":"ACM","oa":1,"day":"01","publication":"Proceedings of the 34th ACM Symposium on Applied Computing","has_accepted_license":"1","isi":1,"year":"2019","doi":"10.1145/3297280.3297322","date_published":"2019-04-01T00:00:00Z","date_created":"2019-05-26T21:59:15Z","page":"400-408","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “The Treewidth of Smart Contracts.” In Proceedings of the 34th ACM Symposium on Applied Computing, Part F147772:400–408. ACM, n.d. https://doi.org/10.1145/3297280.3297322.","ista":"Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. Proceedings of the 34th ACM Symposium on Applied Computing. SAC: Symposium on Applied Computing vol. Part F147772, 400–408.","mla":"Chatterjee, Krishnendu, et al. “The Treewidth of Smart Contracts.” Proceedings of the 34th ACM Symposium on Applied Computing, vol. Part F147772, ACM, pp. 400–08, doi:10.1145/3297280.3297322.","ieee":"K. Chatterjee, A. K. Goharshady, and E. K. Goharshady, “The treewidth of smart contracts,” in Proceedings of the 34th ACM Symposium on Applied Computing, Limassol, Cyprus, vol. Part F147772, pp. 400–408.","short":"K. Chatterjee, A.K. Goharshady, E.K. Goharshady, in:, Proceedings of the 34th ACM Symposium on Applied Computing, ACM, n.d., pp. 400–408.","apa":"Chatterjee, K., Goharshady, A. K., & Goharshady, E. K. (n.d.). The treewidth of smart contracts. In Proceedings of the 34th ACM Symposium on Applied Computing (Vol. Part F147772, pp. 400–408). Limassol, Cyprus: ACM. https://doi.org/10.1145/3297280.3297322","ama":"Chatterjee K, Goharshady AK, Goharshady EK. The treewidth of smart contracts. In: Proceedings of the 34th ACM Symposium on Applied Computing. Vol Part F147772. ACM; :400-408. doi:10.1145/3297280.3297322"},"title":"The treewidth of smart contracts","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Goharshady","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar"},{"last_name":"Goharshady","full_name":"Goharshady, Ehsan Kafshdar","first_name":"Ehsan Kafshdar"}],"article_processing_charge":"No","external_id":{"isi":["000474685800052"]},"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"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.\r\n\r\nTwo 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.\r\n\r\nIn 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.\r\n"}],"month":"04","scopus_import":"1","file":[{"access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"dddc20f6d9881f23b8755eb720ec9d6f","file_id":"7827","creator":"dernst","date_updated":"2020-07-14T12:47:32Z","file_size":6937138,"date_created":"2020-05-14T09:50:11Z","file_name":"2019_ACM_Chatterjee.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781450359337"]},"publication_status":"submitted","volume":"Part F147772","related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]},"_id":"6490","status":"public","pubrep_id":"1070","type":"conference","conference":{"name":"SAC: Symposium on Applied Computing","location":"Limassol, Cyprus","end_date":"2019-04-12","start_date":"2019-04-08"},"ddc":["000"],"date_updated":"2024-03-27T23:30:33Z","department":[{"_id":"KrCh"}],"file_date_updated":"2020-07-14T12:47:32Z"},{"issue":"4","volume":41,"related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]},"ec_funded":1,"file":[{"creator":"dernst","file_size":667357,"date_updated":"2020-10-08T12:58:10Z","file_name":"2019_ACMTransactions_Chatterjee.pdf","date_created":"2020-10-08T12:58:10Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"8632","checksum":"291cc86a07bd010d4815e177dac57b70"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0164-0925"]},"publication_status":"published","month":"11","intvolume":" 41","scopus_import":"1","oa_version":"Submitted Version","abstract":[{"text":"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.\r\n\r\nOur 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.\r\n","lang":"eng"}],"department":[{"_id":"KrCh"}],"file_date_updated":"2020-10-08T12:58:10Z","ddc":["000"],"date_updated":"2024-03-27T23:30:34Z","status":"public","article_type":"original","type":"journal_article","_id":"7158","date_published":"2019-11-01T00:00:00Z","doi":"10.1145/3363525","date_created":"2019-12-09T08:33:33Z","day":"01","publication":"ACM Transactions on Programming Languages and Systems","has_accepted_license":"1","isi":1,"year":"2019","publisher":"ACM","quality_controlled":"1","oa":1,"title":"Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","last_name":"Goharshady"},{"full_name":"Goyal, Prateesh","last_name":"Goyal","first_name":"Prateesh"},{"first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus"},{"last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","external_id":{"isi":["000564108400004"]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages and Systems. ACM, 2019. https://doi.org/10.1145/3363525.","ista":"Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. 2019. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. 41(4), 23.","mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 23, ACM, 2019, doi:10.1145/3363525.","short":"K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 41 (2019).","ieee":"K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019.","ama":"Chatterjee K, Goharshady AK, Goyal P, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. 2019;41(4). doi:10.1145/3363525","apa":"Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R., & Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems. ACM. https://doi.org/10.1145/3363525"},"project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"article_number":"23"},{"oa_version":"Preprint","abstract":[{"lang":"eng","text":"We study the problem of developing efficient approaches for proving\r\nworst-case bounds of non-deterministic recursive programs. Ranking functions\r\nare sound and complete for proving termination and worst-case bounds of\r\nnonrecursive programs. First, we apply ranking functions to recursion,\r\nresulting in measure functions. We show that measure functions provide a sound\r\nand complete approach to prove worst-case bounds of non-deterministic recursive\r\nprograms. Our second contribution is the synthesis of measure functions in\r\nnonpolynomial forms. We show that non-polynomial measure functions with\r\nlogarithm and exponentiation can be synthesized through abstraction of\r\nlogarithmic or exponentiation terms, Farkas' Lemma, and Handelman's Theorem\r\nusing linear programming. While previous methods obtain worst-case polynomial\r\nbounds, our approach can synthesize bounds of the form $\\mathcal{O}(n\\log n)$\r\nas well as $\\mathcal{O}(n^r)$ where $r$ is not an integer. We present\r\nexperimental results to demonstrate that our approach can obtain efficiently\r\nworst-case bounds of classical recursive algorithms such as (i) Merge-Sort, the\r\ndivide-and-conquer algorithm for the Closest-Pair problem, where we obtain\r\n$\\mathcal{O}(n \\log n)$ worst-case bound, and (ii) Karatsuba's algorithm for\r\npolynomial multiplication and Strassen's algorithm for matrix multiplication,\r\nwhere we obtain $\\mathcal{O}(n^r)$ bound such that $r$ is not an integer and\r\nclose to the best-known bounds for the respective algorithms."}],"month":"10","intvolume":" 41","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1705.00317"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":41,"related_material":{"record":[{"relation":"earlier_version","id":"639","status":"public"},{"id":"8934","status":"public","relation":"dissertation_contains"}]},"issue":"4","ec_funded":1,"_id":"7014","status":"public","type":"journal_article","article_type":"original","date_updated":"2024-03-27T23:30:33Z","department":[{"_id":"KrCh"}],"publisher":"ACM","quality_controlled":"1","oa":1,"day":"01","publication":"ACM Transactions on Programming Languages and Systems","isi":1,"year":"2019","doi":"10.1145/3339984","date_published":"2019-10-01T00:00:00Z","date_created":"2019-11-13T08:33:43Z","article_number":"20","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","citation":{"apa":"Chatterjee, K., Fu, H., & Goharshady, A. K. (2019). Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. ACM. https://doi.org/10.1145/3339984","ama":"Chatterjee K, Fu H, Goharshady AK. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. 2019;41(4). doi:10.1145/3339984","short":"K. Chatterjee, H. Fu, A.K. Goharshady, ACM Transactions on Programming Languages and Systems 41 (2019).","ieee":"K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst-case analysis of recursive programs,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019.","mla":"Chatterjee, Krishnendu, et al. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4, 20, ACM, 2019, doi:10.1145/3339984.","ista":"Chatterjee K, Fu H, Goharshady AK. 2019. Non-polynomial worst-case analysis of recursive programs. ACM Transactions on Programming Languages and Systems. 41(4), 20.","chicago":"Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming Languages and Systems. ACM, 2019. https://doi.org/10.1145/3339984."},"title":"Non-polynomial worst-case analysis of recursive programs","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Hongfei","full_name":"Fu, Hongfei","last_name":"Fu"},{"id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir Kafshdar","full_name":"Goharshady, Amir Kafshdar","orcid":"0000-0003-1702-6584","last_name":"Goharshady"}],"article_processing_charge":"No","external_id":{"arxiv":["1705.00317"],"isi":["000564108400001"]}},{"citation":{"ieee":"J. Kühnen, D. Scarselli, and B. Hof, “Relaminarization of pipe flow by means of 3D-printed shaped honeycombs,” Journal of Fluids Engineering, vol. 141, no. 11. ASME, 2019.","short":"J. Kühnen, D. Scarselli, B. Hof, Journal of Fluids Engineering 141 (2019).","apa":"Kühnen, J., Scarselli, D., & Hof, B. (2019). Relaminarization of pipe flow by means of 3D-printed shaped honeycombs. Journal of Fluids Engineering. ASME. https://doi.org/10.1115/1.4043494","ama":"Kühnen J, Scarselli D, Hof B. Relaminarization of pipe flow by means of 3D-printed shaped honeycombs. Journal of Fluids Engineering. 2019;141(11). doi:10.1115/1.4043494","mla":"Kühnen, Jakob, et al. “Relaminarization of Pipe Flow by Means of 3D-Printed Shaped Honeycombs.” Journal of Fluids Engineering, vol. 141, no. 11, 111105, ASME, 2019, doi:10.1115/1.4043494.","ista":"Kühnen J, Scarselli D, Hof B. 2019. Relaminarization of pipe flow by means of 3D-printed shaped honeycombs. Journal of Fluids Engineering. 141(11), 111105.","chicago":"Kühnen, Jakob, Davide Scarselli, and Björn Hof. “Relaminarization of Pipe Flow by Means of 3D-Printed Shaped Honeycombs.” Journal of Fluids Engineering. ASME, 2019. https://doi.org/10.1115/1.4043494."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"last_name":"Kühnen","orcid":"0000-0003-4312-0179","full_name":"Kühnen, Jakob","id":"3A47AE32-F248-11E8-B48F-1D18A9856A87","first_name":"Jakob"},{"last_name":"Scarselli","full_name":"Scarselli, Davide","orcid":"0000-0001-5227-4271","first_name":"Davide","id":"40315C30-F248-11E8-B48F-1D18A9856A87"},{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn","full_name":"Hof, Björn","orcid":"0000-0003-2057-2754","last_name":"Hof"}],"external_id":{"arxiv":["1809.07625"],"isi":["000487748600005"]},"article_processing_charge":"No","title":"Relaminarization of pipe flow by means of 3D-printed shaped honeycombs","article_number":"111105","project":[{"call_identifier":"FP7","_id":"25152F3A-B435-11E9-9278-68D0E5697425","name":"Decoding the complexity of turbulence at its origin","grant_number":"306589"}],"isi":1,"year":"2019","day":"01","publication":"Journal of Fluids Engineering","date_published":"2019-11-01T00:00:00Z","doi":"10.1115/1.4043494","date_created":"2019-05-26T21:59:13Z","publisher":"ASME","quality_controlled":"1","oa":1,"date_updated":"2024-03-27T23:30:35Z","department":[{"_id":"BjHo"}],"_id":"6486","article_type":"original","type":"journal_article","status":"public","publication_identifier":{"eissn":["1528901X"],"issn":["00982202"]},"publication_status":"published","language":[{"iso":"eng"}],"issue":"11","related_material":{"record":[{"relation":"dissertation_contains","id":"7258","status":"public"}]},"volume":141,"ec_funded":1,"acknowledged_ssus":[{"_id":"M-Shop"}],"abstract":[{"lang":"eng","text":"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."}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1809.07625","open_access":"1"}],"month":"11","intvolume":" 141"},{"abstract":[{"text":"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.","lang":"eng"}],"oa_version":"Preprint","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1807.05357"}],"month":"05","intvolume":" 867","publication_identifier":{"eissn":["14697645"],"issn":["00221120"]},"publication_status":"published","language":[{"iso":"eng"}],"related_material":{"record":[{"relation":"dissertation_contains","id":"7258","status":"public"}],"link":[{"relation":"supplementary_material","url":"https://doi.org/10.1017/jfm.2019.191"}]},"volume":867,"ec_funded":1,"_id":"6228","type":"journal_article","status":"public","date_updated":"2024-03-27T23:30:35Z","department":[{"_id":"BjHo"}],"quality_controlled":"1","publisher":"Cambridge University Press","oa":1,"isi":1,"year":"2019","day":"25","publication":"Journal of Fluid Mechanics","page":"934-948","date_published":"2019-05-25T00:00:00Z","doi":"10.1017/jfm.2019.191","date_created":"2019-04-07T21:59:14Z","project":[{"name":"Decoding the complexity of turbulence at its origin","grant_number":"306589","call_identifier":"FP7","_id":"25152F3A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"25104D44-B435-11E9-9278-68D0E5697425","name":"Eliminating turbulence in oil pipelines","grant_number":"737549"}],"citation":{"mla":"Scarselli, Davide, et al. “Relaminarising Pipe Flow by Wall Movement.” Journal of Fluid Mechanics, vol. 867, Cambridge University Press, 2019, pp. 934–48, doi:10.1017/jfm.2019.191.","ama":"Scarselli D, Kühnen J, Hof B. Relaminarising pipe flow by wall movement. Journal of Fluid Mechanics. 2019;867:934-948. doi:10.1017/jfm.2019.191","apa":"Scarselli, D., Kühnen, J., & Hof, B. (2019). Relaminarising pipe flow by wall movement. Journal of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2019.191","ieee":"D. Scarselli, J. Kühnen, and B. Hof, “Relaminarising pipe flow by wall movement,” Journal of Fluid Mechanics, vol. 867. Cambridge University Press, pp. 934–948, 2019.","short":"D. Scarselli, J. Kühnen, B. Hof, Journal of Fluid Mechanics 867 (2019) 934–948.","chicago":"Scarselli, Davide, Jakob Kühnen, and Björn Hof. “Relaminarising Pipe Flow by Wall Movement.” Journal of Fluid Mechanics. Cambridge University Press, 2019. https://doi.org/10.1017/jfm.2019.191.","ista":"Scarselli D, Kühnen J, Hof B. 2019. Relaminarising pipe flow by wall movement. Journal of Fluid Mechanics. 867, 934–948."},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","author":[{"first_name":"Davide","id":"40315C30-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5227-4271","full_name":"Scarselli, Davide","last_name":"Scarselli"},{"last_name":"Kühnen","full_name":"Kühnen, Jakob","orcid":"0000-0003-4312-0179","first_name":"Jakob","id":"3A47AE32-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Björn","id":"3A374330-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2057-2754","full_name":"Hof, Björn","last_name":"Hof"}],"external_id":{"arxiv":["1807.05357"],"isi":["000462606100001"]},"article_processing_charge":"No","title":"Relaminarising pipe flow by wall movement"}]