[{"page":"773 - 797","publisher":"Academic Press","author":[{"first_name":"Florian","orcid":"0000-0002-8379-3768","last_name":"Pausinger","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","full_name":"Pausinger, Florian"},{"last_name":"Svane","full_name":"Svane, Anne","first_name":"Anne"}],"scopus_import":1,"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Motivated by recent ideas of Harman (Unif. Distrib. Theory, 2010) we develop a new concept of variation of multivariate functions on a compact Hausdorff space with respect to a collection D of subsets. We prove a general version of the Koksma-Hlawka theorem that holds for this notion of variation and discrepancy with respect to D. As special cases, we obtain Koksma-Hlawka inequalities for classical notions, such as extreme or isotropic discrepancy. For extreme discrepancy, our result coincides with the usual Koksma-Hlawka theorem. We show that the space of functions of bounded D-variation contains important discontinuous functions and is closed under natural algebraic operations. Finally, we illustrate the results on concrete integration problems from integral geometry and stereology.","lang":"eng"}],"volume":31,"doi":"10.1016/j.jco.2015.06.002","quality_controlled":"1","date_created":"2018-12-11T11:54:02Z","title":"A Koksma-Hlawka inequality for general discrepancy systems","citation":{"ieee":"F. Pausinger and A. Svane, “A Koksma-Hlawka inequality for general discrepancy systems,” Journal of Complexity, vol. 31, no. 6. Academic Press, pp. 773–797, 2015.","apa":"Pausinger, F., & Svane, A. (2015). A Koksma-Hlawka inequality for general discrepancy systems. Journal of Complexity. Academic Press. https://doi.org/10.1016/j.jco.2015.06.002","chicago":"Pausinger, Florian, and Anne Svane. “A Koksma-Hlawka Inequality for General Discrepancy Systems.” Journal of Complexity. Academic Press, 2015. https://doi.org/10.1016/j.jco.2015.06.002.","ista":"Pausinger F, Svane A. 2015. A Koksma-Hlawka inequality for general discrepancy systems. Journal of Complexity. 31(6), 773–797.","short":"F. Pausinger, A. Svane, Journal of Complexity 31 (2015) 773–797.","mla":"Pausinger, Florian, and Anne Svane. “A Koksma-Hlawka Inequality for General Discrepancy Systems.” Journal of Complexity, vol. 31, no. 6, Academic Press, 2015, pp. 773–97, doi:10.1016/j.jco.2015.06.002.","ama":"Pausinger F, Svane A. A Koksma-Hlawka inequality for general discrepancy systems. Journal of Complexity. 2015;31(6):773-797. doi:10.1016/j.jco.2015.06.002"},"acknowledgement":"F.P. is supported by the Graduate School of IST Austria, A.M.S is supported by the Centre for Stochastic Geometry and Advanced Bioimaging funded by a grant from the Villum Foundation.","oa_version":"None","_id":"1792","related_material":{"record":[{"id":"1399","status":"public","relation":"dissertation_contains"}]},"publication_status":"published","day":"01","department":[{"_id":"HeEd"}],"status":"public","year":"2015","date_updated":"2023-09-07T11:41:25Z","publist_id":"5320","date_published":"2015-12-01T00:00:00Z","issue":"6","language":[{"iso":"eng"}],"publication":"Journal of Complexity","month":"12","intvolume":" 31"},{"month":"06","date_published":"2015-06-01T00:00:00Z","language":[{"iso":"eng"}],"date_updated":"2023-09-07T11:41:25Z","publist_id":"5808","year":"2015","day":"01","publication_status":"published","department":[{"_id":"HeEd"}],"status":"public","oa_version":"None","related_material":{"record":[{"relation":"part_of_dissertation","id":"1662","status":"public"},{"relation":"part_of_dissertation","id":"1792","status":"public"},{"relation":"part_of_dissertation","id":"2255","status":"public"}]},"_id":"1399","publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert"}],"title":"On the approximation of intrinsic volumes","date_created":"2018-12-11T11:51:48Z","citation":{"chicago":"Pausinger, Florian. “On the Approximation of Intrinsic Volumes.” Institute of Science and Technology Austria, 2015.","ista":"Pausinger F. 2015. On the approximation of intrinsic volumes. Institute of Science and Technology Austria.","apa":"Pausinger, F. (2015). On the approximation of intrinsic volumes. Institute of Science and Technology Austria.","ieee":"F. Pausinger, “On the approximation of intrinsic volumes,” Institute of Science and Technology Austria, 2015.","ama":"Pausinger F. On the approximation of intrinsic volumes. 2015.","short":"F. Pausinger, On the Approximation of Intrinsic Volumes, Institute of Science and Technology Austria, 2015.","mla":"Pausinger, Florian. On the Approximation of Intrinsic Volumes. Institute of Science and Technology Austria, 2015."},"article_processing_charge":"No","alternative_title":["ISTA Thesis"],"type":"dissertation","degree_awarded":"PhD","abstract":[{"lang":"eng","text":"This thesis is concerned with the computation and approximation of intrinsic volumes. Given a smooth body M and a certain digital approximation of it, we develop algorithms to approximate various intrinsic volumes of M using only measurements taken from its digital approximations. The crucial idea behind our novel algorithms is to link the recent theory of persistent homology to the theory of intrinsic volumes via the Crofton formula from integral geometry and, in particular, via Euler characteristic computations. Our main contributions are a multigrid convergent digital algorithm to compute the first intrinsic volume of a solid body in R^n as well as an appropriate integration pipeline to approximate integral-geometric integrals defined over the Grassmannian manifold."}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","page":"144","author":[{"orcid":"0000-0002-8379-3768","first_name":"Florian","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","full_name":"Pausinger, Florian","last_name":"Pausinger"}],"publisher":"Institute of Science and Technology Austria"},{"scopus_import":1,"type":"journal_article","has_accepted_license":"1","volume":11,"publisher":"Public Library of Science","author":[{"first_name":"Murat","orcid":"0000-0002-8523-0758","last_name":"Tugrul","id":"37C323C6-F248-11E8-B48F-1D18A9856A87","full_name":"Tugrul, Murat"},{"full_name":"Paixao, Tiago","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","last_name":"Paixao","orcid":"0000-0003-2361-3953","first_name":"Tiago"},{"last_name":"Barton","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkacik, Gasper","last_name":"Tkacik","orcid":"0000-0002-6699-1455","first_name":"Gasper"}],"ddc":["576"],"_id":"1666","quality_controlled":"1","date_updated":"2023-09-07T11:53:49Z","day":"06","month":"11","date_published":"2015-11-06T00:00:00Z","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:45:10Z","file_name":"IST-2016-463-v1+1_journal.pgen.1005639.pdf","access_level":"open_access","creator":"system","date_created":"2018-12-12T10:07:58Z","file_size":2580778,"relation":"main_file","checksum":"a4e72fca5ccf40ddacf4d08c8e46b554","file_id":"4657"}],"project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Evolution of gene regulation is crucial for our understanding of the phenotypic differences between species, populations and individuals. Sequence-specific binding of transcription factors to the regulatory regions on the DNA is a key regulatory mechanism that determines gene expression and hence heritable phenotypic variation. We use a biophysical model for directional selection on gene expression to estimate the rates of gain and loss of transcription factor binding sites (TFBS) in finite populations under both point and insertion/deletion mutations. Our results show that these rates are typically slow for a single TFBS in an isolated DNA region, unless the selection is extremely strong. These rates decrease drastically with increasing TFBS length or increasingly specific protein-DNA interactions, making the evolution of sites longer than ∼ 10 bp unlikely on typical eukaryotic speciation timescales. Similarly, evolution converges to the stationary distribution of binding sequences very slowly, making the equilibrium assumption questionable. The availability of longer regulatory sequences in which multiple binding sites can evolve simultaneously, the presence of “pre-sites” or partially decayed old sites in the initial sequence, and biophysical cooperativity between transcription factors, can all facilitate gain of TFBS and reconcile theoretical calculations with timescales inferred from comparative genomics."}],"doi":"10.1371/journal.pgen.1005639","file_date_updated":"2020-07-14T12:45:10Z","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"oa_version":"Published Version","ec_funded":1,"related_material":{"record":[{"id":"9712","status":"public","relation":"research_data"},{"relation":"dissertation_contains","id":"1131","status":"public"}]},"title":"Dynamics of transcription factor binding site evolution","date_created":"2018-12-11T11:53:21Z","citation":{"ieee":"M. Tugrul, T. Paixao, N. H. Barton, and G. Tkačik, “Dynamics of transcription factor binding site evolution,” PLoS Genetics, vol. 11, no. 11. Public Library of Science, 2015.","apa":"Tugrul, M., Paixao, T., Barton, N. H., & Tkačik, G. (2015). Dynamics of transcription factor binding site evolution. PLoS Genetics. Public Library of Science. https://doi.org/10.1371/journal.pgen.1005639","ista":"Tugrul M, Paixao T, Barton NH, Tkačik G. 2015. Dynamics of transcription factor binding site evolution. PLoS Genetics. 11(11).","chicago":"Tugrul, Murat, Tiago Paixao, Nicholas H Barton, and Gašper Tkačik. “Dynamics of Transcription Factor Binding Site Evolution.” PLoS Genetics. Public Library of Science, 2015. https://doi.org/10.1371/journal.pgen.1005639.","mla":"Tugrul, Murat, et al. “Dynamics of Transcription Factor Binding Site Evolution.” PLoS Genetics, vol. 11, no. 11, Public Library of Science, 2015, doi:10.1371/journal.pgen.1005639.","short":"M. Tugrul, T. Paixao, N.H. Barton, G. Tkačik, PLoS Genetics 11 (2015).","ama":"Tugrul M, Paixao T, Barton NH, Tkačik G. Dynamics of transcription factor binding site evolution. PLoS Genetics. 2015;11(11). doi:10.1371/journal.pgen.1005639"},"year":"2015","publist_id":"5483","publication_status":"published","department":[{"_id":"NiBa"},{"_id":"CaGu"},{"_id":"GaTk"}],"status":"public","publication":"PLoS Genetics","pubrep_id":"463","intvolume":" 11","issue":"11"},{"quality_controlled":"1","acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) projects S11402-N23(RiSE) and Z211-N23 (Wittgestein Award), by People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA grant agreement 291734, and by the ARTEMIS JU under grant agreement 295373 (nSafeCer). Jan Křetínský has been partially supported by the Czech Science Foundation, grant No. P202/12/G061. Nikola Beneš has been supported by the\r\nMEYS project No. CZ.1.07/2.3.00/30.0009 Employment of Newly Graduated Doctors of Science for Scientific Excellence.","ddc":["000"],"_id":"1502","publication_identifier":{"isbn":["978-1-4503-3471-6"]},"author":[{"first_name":"Nikola","full_name":"Beneš, Nikola","last_name":"Beneš"},{"first_name":"Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","full_name":"Daca, Przemyslaw","last_name":"Daca"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan","last_name":"Kretinsky","orcid":"0000-0002-8122-2881","first_name":"Jan"},{"first_name":"Dejan","full_name":"Nickovic, Dejan","last_name":"Nickovic"}],"publisher":"ACM","scopus_import":1,"type":"conference","has_accepted_license":"1","date_published":"2015-05-01T00:00:00Z","language":[{"iso":"eng"}],"conference":{"location":"Montreal, QC, Canada","start_date":"2015-05-04","end_date":"2015-05-08","name":"CBSE: Component-Based Software Engineering "},"month":"05","day":"01","date_updated":"2023-09-07T11:58:33Z","date_created":"2018-12-11T11:52:24Z","title":"Complete composition operators for IOCO-testing theory","alternative_title":["Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based Software Engineering "],"citation":{"short":"N. Beneš, P. Daca, T.A. Henzinger, J. Kretinsky, D. Nickovic, in:, ACM, 2015, pp. 101–110.","mla":"Beneš, Nikola, et al. Complete Composition Operators for IOCO-Testing Theory. ACM, 2015, pp. 101–10, doi:10.1145/2737166.2737175.","ama":"Beneš N, Daca P, Henzinger TA, Kretinsky J, Nickovic D. Complete composition operators for IOCO-testing theory. In: ACM; 2015:101-110. doi:10.1145/2737166.2737175","ieee":"N. Beneš, P. Daca, T. A. Henzinger, J. Kretinsky, and D. Nickovic, “Complete composition operators for IOCO-testing theory,” presented at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada, 2015, pp. 101–110.","apa":"Beneš, N., Daca, P., Henzinger, T. A., Kretinsky, J., & Nickovic, D. (2015). Complete composition operators for IOCO-testing theory (pp. 101–110). Presented at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada: ACM. https://doi.org/10.1145/2737166.2737175","ista":"Beneš N, Daca P, Henzinger TA, Kretinsky J, Nickovic D. 2015. Complete composition operators for IOCO-testing theory. CBSE: Component-Based Software Engineering , Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based Software Engineering , , 101–110.","chicago":"Beneš, Nikola, Przemyslaw Daca, Thomas A Henzinger, Jan Kretinsky, and Dejan Nickovic. “Complete Composition Operators for IOCO-Testing Theory,” 101–10. ACM, 2015. https://doi.org/10.1145/2737166.2737175."},"oa_version":"Submitted Version","related_material":{"record":[{"id":"1155","status":"public","relation":"dissertation_contains"}]},"ec_funded":1,"page":"101 - 110","oa":1,"project":[{"call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF"},{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:44:59Z","access_level":"open_access","file_name":"IST-2016-625-v1+1_conf-cbse-BenesDHKN15.pdf","creator":"system","file_size":467561,"date_created":"2018-12-12T10:17:46Z","relation":"main_file","checksum":"c6ce681035c163a158751f240cb7d389","file_id":"5303"}],"doi":"10.1145/2737166.2737175","file_date_updated":"2020-07-14T12:44:59Z","abstract":[{"lang":"eng","text":"We extend the theory of input-output conformance with operators for merge and quotient. The former is useful when testing against multiple requirements or views. The latter can be used to generate tests for patches of an already tested system. Both operators can combine systems with different action alphabets, which is usually the case when constructing complex systems and specifications from parts, for instance different views as well as newly defined functionality of a~previous version of the system."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pubrep_id":"625","publication_status":"published","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"status":"public","publist_id":"5676","year":"2015"},{"quality_controlled":"1","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No. P23499- N23, FWF NFN Grant No. S11407-N23, FWF Grant S11403-N23 (RiSE), and FWF Grant Z211-N23 (Wittgenstein Award), ERC Start Grant (279307: Graph Games), Microsoft faculty fellows award, the ERC Advanced Grant QUAREM (Quantitative Reactive Modeling).","_id":"1501","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","last_name":"Chmelik"},{"first_name":"Przemyslaw","full_name":"Daca, Przemyslaw","id":"49351290-F248-11E8-B48F-1D18A9856A87","last_name":"Daca"}],"publisher":"Springer","scopus_import":1,"type":"journal_article","volume":47,"date_published":"2015-10-01T00:00:00Z","language":[{"iso":"eng"}],"month":"10","day":"01","date_updated":"2023-09-07T11:58:33Z","date_created":"2018-12-11T11:52:23Z","title":"CEGAR for compositional analysis of qualitative properties in Markov decision processes","citation":{"ama":"Chatterjee K, Chmelik M, Daca P. CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. 2015;47(2):230-264. doi:10.1007/s10703-015-0235-2","short":"K. Chatterjee, M. Chmelik, P. Daca, Formal Methods in System Design 47 (2015) 230–264.","mla":"Chatterjee, Krishnendu, et al. “CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes.” Formal Methods in System Design, vol. 47, no. 2, Springer, 2015, pp. 230–64, doi:10.1007/s10703-015-0235-2.","chicago":"Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes.” Formal Methods in System Design. Springer, 2015. https://doi.org/10.1007/s10703-015-0235-2.","ista":"Chatterjee K, Chmelik M, Daca P. 2015. CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. 47(2), 230–264.","ieee":"K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for compositional analysis of qualitative properties in Markov decision processes,” Formal Methods in System Design, vol. 47, no. 2. Springer, pp. 230–264, 2015.","apa":"Chatterjee, K., Chmelik, M., & Daca, P. (2015). CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-015-0235-2"},"oa_version":"Preprint","main_file_link":[{"url":"https://arxiv.org/abs/1405.0835","open_access":"1"}],"related_material":{"record":[{"status":"public","id":"1155","relation":"dissertation_contains"}]},"ec_funded":1,"page":"230 - 264","oa":1,"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"doi":"10.1007/s10703-015-0235-2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability. We introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph algorithms with quadratic complexity to compute the simulation relation. We present an automated technique for assume-guarantee style reasoning for compositional analysis of two-player games by giving a counterexample guided abstraction-refinement approach to compute our new simulation relation. We show a tight link between two-player games and MDPs, and as a consequence the results for games are lifted to MDPs with qualitative properties. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. "}],"issue":"2","publication":"Formal Methods in System Design","intvolume":" 47","publication_status":"published","status":"public","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publist_id":"5677","year":"2015"},{"issue":"1","intvolume":" 50","publication":"ACM SIGPLAN Notices","status":"public","department":[{"_id":"KrCh"}],"publication_status":"published","year":"2015","publist_id":"5565","citation":{"mla":"Chatterjee, Krishnendu, et al. “Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.” ACM SIGPLAN Notices, vol. 50, no. 1, ACM, 2015, pp. 97–109, doi:10.1145/2676726.2676979.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, P. Goyal, ACM SIGPLAN Notices 50 (2015) 97–109.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A, Goyal P. Faster algorithms for algebraic path properties in recursive state machines with constant treewidth. ACM SIGPLAN Notices. 2015;50(1):97-109. doi:10.1145/2676726.2676979","apa":"Chatterjee, K., Ibsen-Jensen, R., Pavlogiannis, A., & Goyal, P. (2015). Faster algorithms for algebraic path properties in recursive state machines with constant treewidth. ACM SIGPLAN Notices. Mumbai, India: ACM. https://doi.org/10.1145/2676726.2676979","ieee":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, and P. Goyal, “Faster algorithms for algebraic path properties in recursive state machines with constant treewidth,” ACM SIGPLAN Notices, vol. 50, no. 1. ACM, pp. 97–109, 2015.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, and Prateesh Goyal. “Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.” ACM SIGPLAN Notices. ACM, 2015. https://doi.org/10.1145/2676726.2676979.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A, Goyal P. 2015. Faster algorithms for algebraic path properties in recursive state machines with constant treewidth. ACM SIGPLAN Notices. 50(1), 97–109."},"date_created":"2018-12-11T11:52:58Z","title":"Faster algorithms for algebraic path properties in recursive state machines with constant treewidth","ec_funded":1,"related_material":{"record":[{"id":"821","status":"public","relation":"dissertation_contains"}]},"main_file_link":[{"url":"https://arxiv.org/abs/1410.7724","open_access":"1"}],"oa_version":"Preprint","oa":1,"page":"97 - 109","abstract":[{"lang":"eng","text":"Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, etc. 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, etc. 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 a very important algorithmic distinction between the resource usage of the one-time preprocessing vs for each individual query. The second aspect that we consider is that the control flow graphs for most programs have constant treewidth. Our main contributions are simple and implementable algorithms that supportmultiple 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 best-known solutions for several important problems, such as interprocedural reachability and shortest path. We provide a prototype implementation for interprocedural reachability and intraprocedural shortest path that gives a significant speed-up on several benchmarks."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.1145/2676726.2676979","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"conference":{"location":"Mumbai, India","name":"SIGPLAN: Symposium on Principles of Programming Languages","end_date":"2015-01-17","start_date":"2015-01-15"},"language":[{"iso":"eng"}],"date_published":"2015-01-01T00:00:00Z","external_id":{"arxiv":["1410.7724"]},"month":"01","day":"01","date_updated":"2023-09-07T12:01:58Z","acknowledgement":"We thank anonymous reviewers for helpful comments to improve the presentation of the paper.","quality_controlled":"1","_id":"1602","publisher":"ACM","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","last_name":"Ibsen-Jensen","orcid":"0000-0003-4783-0389","first_name":"Rasmus"},{"full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","first_name":"Andreas"},{"last_name":"Goyal","full_name":"Goyal, Prateesh","first_name":"Prateesh"}],"volume":50,"scopus_import":1,"type":"journal_article"},{"day":"01","date_updated":"2023-09-07T12:01:59Z","language":[{"iso":"eng"}],"conference":{"location":"Mumbai, India","end_date":"2015-01-17","start_date":"2015-01-15","name":"SIGPLAN: Symposium on Principles of Programming Languages"},"date_published":"2015-01-01T00:00:00Z","month":"01","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"orcid":"0000-0002-8943-0722","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis"},{"first_name":"Yaron","full_name":"Velner, Yaron","last_name":"Velner"}],"publisher":"ACM","volume":50,"scopus_import":1,"type":"journal_article","quality_controlled":"1","_id":"1604","publication_identifier":{"isbn":["978-1-4503-3300-9"]},"department":[{"_id":"KrCh"}],"status":"public","publication_status":"published","publist_id":"5563","year":"2015","issue":"1","intvolume":" 50","pubrep_id":"523","publication":"Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT ","page":"539 - 551","doi":"10.1145/2676726.2676968","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We consider the quantitative analysis problem for interprocedural control-flow graphs (ICFGs). The input consists of an ICFG, a positive weight function that assigns every transition a positive integer-valued number, and a labelling of the transitions (events) as good, bad, and neutral events. The weight function assigns to each transition a numerical value that represents ameasure of how good or bad an event is. The quantitative analysis problem asks whether there is a run of the ICFG where the ratio of the sum of the numerical weights of good events versus the sum of weights of bad events in the long-run is at least a given threshold (or equivalently, to compute the maximal ratio among all valid paths in the ICFG). The quantitative analysis problem for ICFGs can be solved in polynomial time, and we present an efficient and practical algorithm for the problem. We show that several problems relevant for static program analysis, such as estimating the worst-case execution time of a program or the average energy consumption of a mobile application, can be modeled in our framework. We have implemented our algorithm as a tool in the Java Soot framework. We demonstrate the effectiveness of our approach with two case studies. First, we show that our framework provides a sound approach (no false positives) for the analysis of inefficiently-used containers. Second, we show that our approach can also be used for static profiling of programs which reasons about methods that are frequently invoked. Our experimental results show that our tool scales to relatively large benchmarks, and discovers relevant and useful information that can be used to optimize performance of the programs.","lang":"eng"}],"project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"citation":{"ieee":"K. Chatterjee, A. Pavlogiannis, and Y. Velner, “Quantitative interprocedural analysis,” Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT , vol. 50, no. 1. ACM, pp. 539–551, 2015.","apa":"Chatterjee, K., Pavlogiannis, A., & Velner, Y. (2015). Quantitative interprocedural analysis. Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . Mumbai, India: ACM. https://doi.org/10.1145/2676726.2676968","ista":"Chatterjee K, Pavlogiannis A, Velner Y. 2015. Quantitative interprocedural analysis. Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . 50(1), 539–551.","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. “Quantitative Interprocedural Analysis.” Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . ACM, 2015. https://doi.org/10.1145/2676726.2676968.","mla":"Chatterjee, Krishnendu, et al. “Quantitative Interprocedural Analysis.” Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT , vol. 50, no. 1, ACM, 2015, pp. 539–51, doi:10.1145/2676726.2676968.","short":"K. Chatterjee, A. Pavlogiannis, Y. Velner, Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT 50 (2015) 539–551.","ama":"Chatterjee K, Pavlogiannis A, Velner Y. Quantitative interprocedural analysis. Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . 2015;50(1):539-551. doi:10.1145/2676726.2676968"},"date_created":"2018-12-11T11:52:59Z","title":"Quantitative interprocedural analysis","related_material":{"record":[{"status":"public","id":"5445","relation":"earlier_version"},{"id":"821","status":"public","relation":"dissertation_contains"}]},"ec_funded":1,"oa_version":"None"},{"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","orcid":"0000-0003-4783-0389"},{"orcid":"0000-0002-8943-0722","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","last_name":"Pavlogiannis"}],"publisher":"Springer","volume":9206,"type":"conference","scopus_import":1,"acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","quality_controlled":"1","_id":"1607","day":"16","date_updated":"2023-09-07T12:01:59Z","language":[{"iso":"eng"}],"conference":{"name":"CAV: Computer Aided Verification","end_date":"2015-07-24","start_date":"2015-07-18","location":"San Francisco, CA, USA"},"date_published":"2015-07-16T00:00:00Z","month":"07","oa":1,"page":"140 - 157","doi":"10.1007/978-3-319-21690-4_9","abstract":[{"text":"We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff property, the ratio property, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let n denote the number of nodes of a graph, m the number of edges (for constant treewidth graphs m=O(n)) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a multiplicative factor of ϵ in time O(n⋅log(n/ϵ)) and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time O(n⋅log(|a⋅b|))=O(n⋅log(n⋅W)), when the output is ab, as compared to the previously best known algorithm with running time O(n2⋅log(n⋅W)). Third, for the minimum initial credit problem we show that (i) for general graphs the problem can be solved in O(n2⋅m) time and the associated decision problem can be solved in O(n⋅m) time, improving the previous known O(n3⋅m⋅log(n⋅W)) and O(n2⋅m) bounds, respectively; and (ii) for constant treewidth graphs we present an algorithm that requires O(n⋅logn) time, improving the previous known O(n4⋅log(n⋅W)) bound. We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks.","lang":"eng"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"citation":{"ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for quantitative verification in constant treewidth graphs. In: Vol 9206. Springer; 2015:140-157. doi:10.1007/978-3-319-21690-4_9","mla":"Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. Vol. 9206, Springer, 2015, pp. 140–57, doi:10.1007/978-3-319-21690-4_9.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Springer, 2015, pp. 140–157.","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for quantitative verification in constant treewidth graphs. CAV: Computer Aided Verification, LNCS, vol. 9206, 140–157.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs,” 9206:140–57. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_9.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in constant treewidth graphs,” presented at the CAV: Computer Aided Verification, San Francisco, CA, USA, 2015, vol. 9206, pp. 140–157.","apa":"Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs (Vol. 9206, pp. 140–157). Presented at the CAV: Computer Aided Verification, San Francisco, CA, USA: Springer. https://doi.org/10.1007/978-3-319-21690-4_9"},"alternative_title":["LNCS"],"date_created":"2018-12-11T11:52:59Z","title":"Faster algorithms for quantitative verification in constant treewidth graphs","related_material":{"record":[{"status":"public","id":"5430","relation":"earlier_version"},{"relation":"earlier_version","id":"5437","status":"public"},{"status":"public","id":"821","relation":"dissertation_contains"}]},"main_file_link":[{"url":"http://arxiv.org/abs/1504.07384","open_access":"1"}],"ec_funded":1,"oa_version":"Preprint","department":[{"_id":"KrCh"}],"status":"public","publication_status":"published","publist_id":"5560","year":"2015","intvolume":" 9206"},{"doi":"10.1109/RTSS.2014.9","abstract":[{"text":"We present a flexible framework for the automated competitive analysis of on-line scheduling algorithms for firm-deadline real-time tasks based on multi-objective graphs: Given a task set and an on-line scheduling algorithm specified as a labeled transition system, along with some optional safety, liveness, and/or limit-average constraints for the adversary, we automatically compute the competitive ratio of the algorithm w.r.t. A clairvoyant scheduler. We demonstrate the flexibility and power of our approach by comparing the competitive ratio of several on-line algorithms, including Dover, that have been proposed in the past, for various task sets. Our experimental results reveal that none of these algorithms is universally optimal, in the sense that there are task sets where other schedulers provide better performance. Our framework is hence a very useful design tool for selecting optimal algorithms for a given application.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"118 - 127","related_material":{"record":[{"relation":"earlier_version","id":"5423","status":"public"},{"relation":"dissertation_contains","id":"821","status":"public"}]},"oa_version":"None","citation":{"ieee":"K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks,” in Real-Time Systems Symposium, Rome, Italy, 2015, vol. 2015, no. January, pp. 118–127.","apa":"Chatterjee, K., Pavlogiannis, A., Kößler, A., & Schmid, U. (2015). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. In Real-Time Systems Symposium (Vol. 2015, pp. 118–127). Rome, Italy: IEEE. https://doi.org/10.1109/RTSS.2014.9","chicago":"Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks.” In Real-Time Systems Symposium, 2015:118–27. IEEE, 2015. https://doi.org/10.1109/RTSS.2014.9.","ista":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. 2015. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. Real-Time Systems Symposium. RTSS: Real-Time Systems Symposium vol. 2015, 118–127.","mla":"Chatterjee, Krishnendu, et al. “A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks.” Real-Time Systems Symposium, vol. 2015, no. January, IEEE, 2015, pp. 118–27, doi:10.1109/RTSS.2014.9.","short":"K. Chatterjee, A. Pavlogiannis, A. Kößler, U. Schmid, in:, Real-Time Systems Symposium, IEEE, 2015, pp. 118–127.","ama":"Chatterjee K, Pavlogiannis A, Kößler A, Schmid U. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. In: Real-Time Systems Symposium. Vol 2015. IEEE; 2015:118-127. doi:10.1109/RTSS.2014.9"},"title":"A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks","date_created":"2018-12-11T11:53:37Z","publist_id":"5417","year":"2015","status":"public","department":[{"_id":"KrCh"}],"publication_status":"published","intvolume":" 2015","publication":"Real-Time Systems Symposium","issue":"January","volume":2015,"scopus_import":1,"type":"conference","author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","first_name":"Andreas"},{"first_name":"Alexander","last_name":"Kößler","full_name":"Kößler, Alexander"},{"first_name":"Ulrich","full_name":"Schmid, Ulrich","last_name":"Schmid"}],"publisher":"IEEE","_id":"1714","article_processing_charge":"No","quality_controlled":"1","date_updated":"2023-09-07T12:01:59Z","day":"15","month":"01","language":[{"iso":"eng"}],"conference":{"location":"Rome, Italy","name":"RTSS: Real-Time Systems Symposium","start_date":"2014-12-02","end_date":"2014-12-05"},"date_published":"2015-01-15T00:00:00Z"},{"publication_status":"published","status":"public","department":[{"_id":"ChWo"}],"publist_id":"5522","year":"2015","issue":"4","pubrep_id":"609","intvolume":" 34","oa":1,"project":[{"call_identifier":"H2020","grant_number":"638176","name":"Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425"}],"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:45:07Z","file_size":20154270,"date_created":"2018-12-12T10:15:13Z","relation":"main_file","file_name":"IST-2016-609-v1+1_FractureBEM.pdf","access_level":"open_access","creator":"system","file_id":"5131","checksum":"955aee971983f6b6152bcc1c9b4a7c20"}],"file_date_updated":"2020-07-14T12:45:07Z","doi":"10.1145/2766896","abstract":[{"text":"We present a method for simulating brittle fracture under the assumptions of quasi-static linear elastic fracture mechanics (LEFM). Using the boundary element method (BEM) and Lagrangian crack-fronts, we produce highly detailed fracture surfaces. The computational cost of the BEM is alleviated by using a low-resolution mesh and interpolating the resulting stress intensity factors when propagating the high-resolution crack-front.\r\n\r\nOur system produces physics-based fracture surfaces with high spatial and temporal resolution, taking spatial variation of material toughness and/or strength into account. It also allows for crack initiation to be handled separately from crack propagation, which is not only more reasonable from a physics perspective, but can also be used to control the simulation.\r\n\r\nSeparating the resolution of the crack-front from the resolution of the computational mesh increases the efficiency and therefore the amount of visual detail on the resulting fracture surfaces. The BEM also allows us to re-use previously computed blocks of the system matrix.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:53:09Z","title":"High-resolution brittle fracture simulation with boundary elements","citation":{"ama":"Hahn D, Wojtan C. High-resolution brittle fracture simulation with boundary elements. In: Vol 34. ACM; 2015. doi:10.1145/2766896","short":"D. Hahn, C. Wojtan, in:, ACM, 2015.","mla":"Hahn, David, and Chris Wojtan. High-Resolution Brittle Fracture Simulation with Boundary Elements. Vol. 34, no. 4, 151, ACM, 2015, doi:10.1145/2766896.","chicago":"Hahn, David, and Chris Wojtan. “High-Resolution Brittle Fracture Simulation with Boundary Elements,” Vol. 34. ACM, 2015. https://doi.org/10.1145/2766896.","ista":"Hahn D, Wojtan C. 2015. High-resolution brittle fracture simulation with boundary elements. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques vol. 34, 151.","apa":"Hahn, D., & Wojtan, C. (2015). High-resolution brittle fracture simulation with boundary elements (Vol. 34). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States: ACM. https://doi.org/10.1145/2766896","ieee":"D. Hahn and C. Wojtan, “High-resolution brittle fracture simulation with boundary elements,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States, 2015, vol. 34, no. 4."},"oa_version":"Submitted Version","related_material":{"record":[{"id":"839","status":"public","relation":"dissertation_contains"}]},"ec_funded":1,"day":"27","date_updated":"2023-09-07T12:02:56Z","date_published":"2015-07-27T00:00:00Z","language":[{"iso":"eng"}],"conference":{"location":"Los Angeles, CA, United States","start_date":"2015-08-09","end_date":"2015-08-13","name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques"},"month":"07","author":[{"last_name":"Hahn","id":"357A6A66-F248-11E8-B48F-1D18A9856A87","full_name":"Hahn, David","first_name":"David"},{"last_name":"Wojtan","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","orcid":"0000-0001-6646-5546"}],"publisher":"ACM","type":"conference","scopus_import":1,"has_accepted_license":"1","volume":34,"quality_controlled":"1","article_number":"151","ddc":["000"],"_id":"1633"}]