Dagstuhl reports最新文献

{"title":"Computational Proteomics (Dagstuhl Seminar 21271)","authors":"Sebastian Böcker, R. Gundry, L. Martens, Magnus Palmblad","doi":"10.4230/DagRep.11.6.1","DOIUrl":"https://doi.org/10.4230/DagRep.11.6.1","url":null,"abstract":"","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"11 1","pages":"1-13"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70435248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Behavioural Types: Bridging Theory and Practice (Dagstuhl Seminar 21372)","authors":"M. Dezani-Ciancaglini, Roland Kuhn, S. Lindley, A. Scalas","doi":"10.4230/DagRep.11.8.52","DOIUrl":"https://doi.org/10.4230/DagRep.11.8.52","url":null,"abstract":"Behavioural types specify the way in which software components interact with one another. Unlike data types (which describe the structure of data), behavioural types describe communication protocols, and their verification ensures that programs do not violate such protocols. The behavioural types research community has developed a flourishing literature on communicationcentric programming, exploring many directions. One of the most studied behavioural type systems are session types, introduced by Honda et al. in the ‘90s, and awarded with prizes for their influence in the past 20 and 10 years (by the ESOP and POPL conferences, respectively). Other varieties of behavioural types include typestate systems, choreographies, and behavioural contracts; research on verification techniques covers the spectrum from fully static verification at compile-time to fully dynamic verification at run-time. In the last decade, research on behavioural types has shifted emphasis towards practical applications, using both novel and existing programming languages (e.g., Java, Python, Go, C, Haskell, OCaml, Erlang, Scala, Rust). An earlier Dagstuhl Seminar, 17051 “Theory and Applications of Behavioural Types” (January 29–February 3, 2017), played an important role in coordinating this effort. Yet, despite the vibrant community and the stream of new results, the use of behavioural types for mainstream software development and verification remains limited. This limitation is largely down to the rapid pace at which mainstream industrial practice for the design and development of concurrent and distributed systems evolves, often resulting in substantial divergence from academic research. In the absence of established tools to express communication protocols, widely used implementations concentrate solely on scalability and reliability. The flip side is that these systems are either overly loose, supporting any conceivable communication structure (via brokers), or overly restricted, supporting only simple requestresponse protocols (like HTTP or RPC). In this seminar, experts from academia and industry explored together how best to bridge the gap between theory and mainstream practice. They tackled challenges that are fundamental in practical systems development, but are rarely or only partially addressed in the behavioural types literature – in particular, failure handling, asynchronous communication, and dynamic reconfiguration. Moreover they explored how the tools of behavioural types and programming languages theory (such as linearity, gradual types, and dependent types) can help to address these challenges. Seminar September 12–17, 2021 – http://www.dagstuhl.de/21372 2012 ACM Subject Classification Theory of computation → Models of computation; Theory of computation → Process calculi; Theory of computation → Type structures","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"206 1","pages":"52-75"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70435483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Secure Compilation (Dagstuhl Seminar 21481)","authors":"D. Chisnall, Deepak Garg, Catalin Hritcu, Mathias Payer","doi":"10.4230/DagRep.11.10.173","DOIUrl":"https://doi.org/10.4230/DagRep.11.10.173","url":null,"abstract":"","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"11 1","pages":"173-204"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70434580","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Serverless Computing (Dagstuhl Seminar 21201)","authors":"Cristina L. Abad, Ian T Foster, N. Herbst, A. Iosup","doi":"10.4230/DagRep.11.4.34","DOIUrl":"https://doi.org/10.4230/DagRep.11.4.34","url":null,"abstract":"","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"11 1","pages":"34-93"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70435165","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Quantum Complexity: Theory and Application (Dagstuhl Seminar 21261)","authors":"B. Fefferman, Sevag Gharibian, N. Schuch, B. Terhal","doi":"10.4230/DagRep.11.5.76","DOIUrl":"https://doi.org/10.4230/DagRep.11.5.76","url":null,"abstract":"This report documents the program and outcomes of Dagstuhl Seminar 21261 “Quantum Complexity: Theory and Application”. The seminar ran from June 27 to July 2 , 2021, and was held in a hybrid format (due to COVID travel restrictions). Of the 55 total participants from 14 countries, 17 participants were on-site, and 38 were remote. Recent advances in both theoretic and experimental aspects of quantum complexity theory were presented and discussed, ranging from new theoretical developments via a “Quantum Strong Exponential Time Hypothesis”, to more experimentally oriented talks involving benchmarking of random circuits in quantum supremacy experiments. In addition, an open problem session and a discussion session regarding the current state of the field were included. Seminar June 27 – July 2, 2021 – http://www.dagstuhl.de/21261 2012 ACM Subject Classification Theory of computation → Quantum complexity theory","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"11 1","pages":"76-88"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70435183","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Approximate Systems (Dagstuhl Seminar 21302)","authors":"Eva Darulova, B. Falsafi, A. Gerstlauer, Phillip Stanley-Marbell","doi":"10.4230/DagRep.11.6.147","DOIUrl":"https://doi.org/10.4230/DagRep.11.6.147","url":null,"abstract":"","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"11 1","pages":"147-163"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70435332","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Probabilistic Numerical Methods - From Theory to Implementation (Dagstuhl Seminar 21432)","authors":"Philipp Hennig, Ilse C. F. Ipsen, Maren Mahsereci, Tim Sullivan","doi":"10.4230/DagRep.11.9.102","DOIUrl":"https://doi.org/10.4230/DagRep.11.9.102","url":null,"abstract":"","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"11 1","pages":"102-119"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70435543","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Rigorous Methods for Smart Contracts (Dagstuhl Seminar 21431)","authors":"N. Bjørner, M. Christakis, Matteo Maffei, Grigore Roşu","doi":"10.4230/DagRep.11.9.80","DOIUrl":"https://doi.org/10.4230/DagRep.11.9.80","url":null,"abstract":"","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"11 1","pages":"80-101"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70435623","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Higher-Order Graph Models: From Theoretical Foundations to Machine Learning (Dagstuhl Seminar 21352)","authors":"Tina Eliassi-Rad, V. Latora, M. Rosvall, Ingo Scholtes","doi":"10.4230/DagRep.11.7.139","DOIUrl":"https://doi.org/10.4230/DagRep.11.7.139","url":null,"abstract":"Graph and network models are essential for data science applications in computer science, social sciences, and life sciences. They help to detect patterns in data on dyadic relations between pairs of genes, humans, or documents, and have improved our understanding of complex networks across disciplines. While the advantages of graph models of relational data are undisputed, we often have access to data with multiple types of higher-order relations not captured by simple graphs. Such data arise in social systems with non-dyadic or group-based interactions, multimodal transportation networks with multiple connection types, or time series containing specific sequences of nodes traversed on paths. The complex relational structure of such data questions the validity of graph-based data mining and modelling, and jeopardises interdisciplinary applications of network analysis and machine learning. To address this challenge, researchers in topological data analysis, network science, machine learning, and physics recently started to generalise network analysis to higher-order graph models that capture more than dyadic relations. These higher-order models differ from standard network analysis in assumptions, applications, and mathematical formalisms. As a result, the emerging field lacks a shared terminology, common challenges, benchmark data and metrics to facilitate fair comparisons. By bringing together researchers from different disciplines, Dagstuhl Seminar 21352 “Higher-Order Graph Models: From Theoretical Foundations to Machine Learning” aimed at the development of a common language and a shared understanding of key challenges in the field that foster progress in data analytics and machine learning for data with complex relational structure. This report documents the program and the outcomes of this seminar. Seminar August 29–1, 2021 – http://www.dagstuhl.de/21352 2012 ACM Subject Classification Theory of computation → Graph algorithms analysis; Theory of computation → Machine learning theory; Mathematics of computing → Graph theory; Human-centered computing → Graph drawings; Human-centered computing → Social network analysis","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"11 1","pages":"139-178"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70434961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Autonomous Agents on the Web (Dagstuhl Seminar 21072)","authors":"O. Boissier, A. Ciortea, A. Harth, A. Ricci","doi":"10.4230/DagRep.11.1.24","DOIUrl":"https://doi.org/10.4230/DagRep.11.1.24","url":null,"abstract":"","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"273 1","pages":"24-100"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70434750","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}