发布求助
文献互助 智能选刊 最新文献

International Colloquium on Theoretical Aspects of Computing最新文献

筛选
英文 中文
Efficient Reactive Synthesis Using Mode Decomposition 利用模式分解实现高效反应式合成
International Colloquium on Theoretical Aspects of Computing Pub Date : 2023-12-14 DOI: 10.1007/978-3-031-47963-2_16
Matías Brizzio, César Sánchez
{"title":"Efficient Reactive Synthesis Using Mode Decomposition","authors":"Matías Brizzio, César Sánchez","doi":"10.1007/978-3-031-47963-2_16","DOIUrl":"https://doi.org/10.1007/978-3-031-47963-2_16","url":null,"abstract":"","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"2 4","pages":"256-275"},"PeriodicalIF":0.0,"publicationDate":"2023-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139002888","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}
引用次数: 0
Reachability Games and Parity Games 可达性游戏和平价游戏
International Colloquium on Theoretical Aspects of Computing Pub Date : 2022-08-22 DOI: 10.48550/arXiv.2208.10121
V. Diekert, Manfred Kufleitner
{"title":"Reachability Games and Parity Games","authors":"V. Diekert, Manfred Kufleitner","doi":"10.48550/arXiv.2208.10121","DOIUrl":"https://doi.org/10.48550/arXiv.2208.10121","url":null,"abstract":"Parity games are positionally determined. This is a fundamental and classical result. In 2010, Calude et al. showed a breakthrough result for finite parity games: the winning regions and their positional winning strategies can be computed in quasi-polynomial time. In the present paper we give a self-contained and detailed proofs for both results. The results in this paper are not meant to be original. The positional determinacy result is shown for possibly infinite parity games using the ideas of Zielonka which he published in 1998. In order to show quasi-polynomial time, we follow Lehtinen's register games, which she introduced in 2018. Although the time complexity of Lehtinen's algorithm is not optimal, register games are conceptually simple and interesting in their own right. Various of our proofs are either new or simplifications of the original proofs. The topics in this paper include the definition and the computation of optimal attractors for reachability games, too.","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":" 28","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132012307","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}
引用次数: 0
Active Learning for Deterministic Bottom-up Nominal Tree Automata 确定性自底向上标称树自动机的主动学习
International Colloquium on Theoretical Aspects of Computing Pub Date : 2022-08-17 DOI: 10.48550/arXiv.2208.08319
R. Nakanishi, Y. Takata, Hiroshi Seki
{"title":"Active Learning for Deterministic Bottom-up Nominal Tree Automata","authors":"R. Nakanishi, Y. Takata, Hiroshi Seki","doi":"10.48550/arXiv.2208.08319","DOIUrl":"https://doi.org/10.48550/arXiv.2208.08319","url":null,"abstract":"Nominal set plays a central role in a group-theoretic extension of finite automata to those over an infinite set of data values. Moerman et al. proposed an active learning algorithm for nominal word automata with the equality symmetry. In this paper, we introduce deterministic bottom-up nominal tree automata (DBNTA), which operate on trees whose nodes are labelled with elements of an orbit finite nominal set. We then prove a Myhill-Nerode theorem for the class of languages recognized by DBNTA and propose an active learning algorithm for DBNTA. The algorithm can deal with any data symmetry that admits least support, not restricted to the equality symmetry and/or the total order symmetry. To prove the termination of the algorithm, we define a partial order on nominal sets and show that there is no infinite chain of orbit finite nominal sets with respect to this partial order between any two orbit finite sets.","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115546992","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}
引用次数: 0
Structural Rules and Algebraic Properties of Intersection Types 交型的结构规则和代数性质
International Colloquium on Theoretical Aspects of Computing Pub Date : 2022-04-26 DOI: 10.48550/arXiv.2204.12376
Sandra Alves, Mário Florido
{"title":"Structural Rules and Algebraic Properties of Intersection Types","authors":"Sandra Alves, Mário Florido","doi":"10.48550/arXiv.2204.12376","DOIUrl":"https://doi.org/10.48550/arXiv.2204.12376","url":null,"abstract":"In this paper we define several notions of term expansion, used to define terms with less sharing, but with the same computa- tional properties of terms typable in an intersection type system. Expansion relates terms typed by associative, commutative and idempotent intersections with terms typed in the Curry type system and the relevant type system; terms typed by non-idempotent intersections with terms typed in the affine and linear type systems; and terms typed by non-idempotent and non-commutative intersections with terms typed in an ordered type system. Finally, we show how idempotent intersection is related with the contraction rule, commutative intersection with the exchange rule and associative intersection with the lack of structural rules in a type system.","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134546003","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}
引用次数: 0
Alternating Automatic Register Machines 交替自动登记机
International Colloquium on Theoretical Aspects of Computing Pub Date : 2021-11-08 DOI: 10.1007/978-3-031-17715-6_14
Ziyuan Gao, Sanjay Jain, Zeyong Li, A. F. Sabili, F. Stephan
{"title":"Alternating Automatic Register Machines","authors":"Ziyuan Gao, Sanjay Jain, Zeyong Li, A. F. Sabili, F. Stephan","doi":"10.1007/978-3-031-17715-6_14","DOIUrl":"https://doi.org/10.1007/978-3-031-17715-6_14","url":null,"abstract":"","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122047091","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}
引用次数: 1
Functional Choreographic Programming 函数式舞蹈编程
International Colloquium on Theoretical Aspects of Computing Pub Date : 2021-11-05 DOI: 10.1007/978-3-031-17715-6_15
L. Cruz-Filipe, Eva Graversen, Lovro Lugovi'c, F. Montesi, Marco Peressotti
{"title":"Functional Choreographic Programming","authors":"L. Cruz-Filipe, Eva Graversen, Lovro Lugovi'c, F. Montesi, Marco Peressotti","doi":"10.1007/978-3-031-17715-6_15","DOIUrl":"https://doi.org/10.1007/978-3-031-17715-6_15","url":null,"abstract":"","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124774035","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}
引用次数: 5
A Set Automaton to Locate All Pattern Matches in a Term 定位一个词中所有模式匹配的集合自动机
International Colloquium on Theoretical Aspects of Computing Pub Date : 2021-06-29 DOI: 10.1007/978-3-030-85315-0_5
Rick Erkens, J. F. Groote
{"title":"A Set Automaton to Locate All Pattern Matches in a Term","authors":"Rick Erkens, J. F. Groote","doi":"10.1007/978-3-030-85315-0_5","DOIUrl":"https://doi.org/10.1007/978-3-030-85315-0_5","url":null,"abstract":"","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122307759","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}
引用次数: 1
Normalising Lustre Preserves Security 使光泽正常化保持安全
International Colloquium on Theoretical Aspects of Computing Pub Date : 2021-05-22 DOI: 10.1007/978-3-030-85315-0_16
Sanjiva Prasad, R. Yerraguntla
{"title":"Normalising Lustre Preserves Security","authors":"Sanjiva Prasad, R. Yerraguntla","doi":"10.1007/978-3-030-85315-0_16","DOIUrl":"https://doi.org/10.1007/978-3-030-85315-0_16","url":null,"abstract":"","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124169237","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}
引用次数: 1
Certifying Choreography Compilation 认证编舞编译
International Colloquium on Theoretical Aspects of Computing Pub Date : 2021-02-21 DOI: 10.1007/978-3-030-85315-0_8
L. Cruz-Filipe, F. Montesi, Marco Peressotti
{"title":"Certifying Choreography Compilation","authors":"L. Cruz-Filipe, F. Montesi, Marco Peressotti","doi":"10.1007/978-3-030-85315-0_8","DOIUrl":"https://doi.org/10.1007/978-3-030-85315-0_8","url":null,"abstract":"","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"384 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116637563","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}
引用次数: 17
A Flight Rule Checker for the LADEE Lunar Spacecraft 月球探测器LADEE的飞行规则检查员
International Colloquium on Theoretical Aspects of Computing Pub Date : 2020-11-30 DOI: 10.1007/978-3-030-64276-1_1
Elif Kürklü, K. Havelund
{"title":"A Flight Rule Checker for the LADEE Lunar Spacecraft","authors":"Elif Kürklü, K. Havelund","doi":"10.1007/978-3-030-64276-1_1","DOIUrl":"https://doi.org/10.1007/978-3-030-64276-1_1","url":null,"abstract":"","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130581562","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}
引用次数: 4
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信