Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science最新文献_第3页

On the Satisfiability of Context-free String Constraints with Subword-Ordering 具有子词排序的上下文无关字符串约束的可满足性

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-08-02 DOI: 10.1145/3531130.3533329

C. Aiswarya, Soumodev Mal, Prakash Saivasan

引用次数: 1

Concrete categories and higher-order recursion: With applications including probability, differentiability, and full abstraction 具体范畴和高阶递归:应用包括概率、可微性和完全抽象

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-05-31 DOI: 10.1145/3531130.3533370

C. Matache, Sean K. Moss, S. Staton

引用次数: 3

Deciding Hyperproperties Combined with Functional Specifications 结合功能规范决定超属性

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-05-30 DOI: 10.1145/3531130.3533369

Raven Beutner, David Carral, B. Finkbeiner, Jana Hofmann, M. Krötzsch

引用次数: 8

Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic 线性逻辑中的指数替代与切消代价

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-05-30 DOI: 10.1145/3531130.3532445

Beniamino Accattoli

引用次数: 3

Choiceless Polynomial Time with Witnessed Symmetric Choice 具有见证对称选择的无选择多项式时间

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-05-27 DOI: 10.1145/3531130.3533348

Moritz Lichter, Pascal Schweitzer

引用次数: 2

The boundedness and zero isolation problems for weighted automata over nonnegative rationals 非负有理数上加权自动机的有界性和零隔离问题

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-05-26 DOI: 10.1145/3531130.3533336

Wojciech Czerwi'nski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland

{"title":"The boundedness and zero isolation problems for weighted automata over nonnegative rationals","authors":"Wojciech Czerwi'nski, Engel Lefaucheux, Filip Mazowiecki, David Purser, Markus A. Whiteland","doi":"10.1145/3531130.3533336","DOIUrl":"https://doi.org/10.1145/3531130.3533336","url":null,"abstract":"We consider linear cost-register automata (equivalent to weighted automata) over the semiring of nonnegative rationals, which generalise probabilistic automata. The two problems of boundedness and zero isolation ask whether there is a sequence of words that converge to infinity and to zero, respectively. In the general model both problems are undecidable so we focus on the copyless linear restriction. There, we show that the boundedness problem is decidable. As for the zero isolation problem we need to further restrict the class. We obtain a model, where zero isolation becomes equivalent to universal coverability of orthant vector addition systems (OVAS), a new model in the VAS family interesting on its own. In standard VAS runs are considered only in the positive orthant, while in OVAS every orthant has its own set of vectors that can be applied in that orthant. Assuming Schanuel’s conjecture is true, we prove decidability of universal coverability for three-dimensional OVAS, which implies decidability of zero isolation in a model with at most three independent registers.","PeriodicalId":373589,"journal":{"name":"Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"1064 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133842936","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}

引用次数: 2

Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification 拉姆齐量词对自动结构的影响:复杂性及其在验证中的应用

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-05-18 DOI: 10.1145/3531130.3533346

Pascal Bergsträßer, Moses Ganardi, A. Lin, Georg Zetzsche

{"title":"Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification","authors":"Pascal Bergsträßer, Moses Ganardi, A. Lin, Georg Zetzsche","doi":"10.1145/3531130.3533346","DOIUrl":"https://doi.org/10.1145/3531130.3533346","url":null,"abstract":"Automatic structures are infinite structures that are finitely represented by synchronized finite-state automata. This paper concerns specifically automatic structures over finite words and trees (ranked/unranked). We investigate the “directed version” of Ramsey quantifiers, which express the existence of an infinite directed clique. This subsumes the standard “undirected version” of Ramsey quantifiers. Interesting connections between Ramsey quantifiers and two problems in verification are firstly observed: (1) reachability with Büchi and generalized Büchi conditions in regular model checking can be seen as Ramsey quantification over transitive automatic graphs (i.e., whose edge relations are transitive), (2) checking monadic decomposability (a.k.a. recognizability) of automatic relations can be viewed as Ramsey quantification over co-transitive automatic graphs (i.e., the complements of whose edge relations are transitive). We provide a comprehensive complexity landscape of Ramsey quantifiers in these three cases (general, transitive, co-transitive), all between NL and EXP. In turn, this yields a wealth of new results with precise complexity, e.g., verification of subtree/flat prefix rewriting, as well as monadic decomposability over tree-automatic relations. We also obtain substantially simpler proofs, e.g., for NL complexity for monadic decomposability over word-automatic relations (given by DFAs).","PeriodicalId":373589,"journal":{"name":"Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125473985","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}

引用次数: 2

Zigzag normalisation for associative n-categories 关联n类的之字形规格化

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-05-18 DOI: 10.1145/3531130.3533352

Lukas Heidemann, David J. Reutter, J. Vicary

引用次数: 4

Characterizing Positionality in Games of Infinite Duration over Infinite Graphs 无限图上无限持续博弈的位置性特征

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-05-09 DOI: 10.1145/3531130.3532418

Pierre Ohlmann

{"title":"Characterizing Positionality in Games of Infinite Duration over Infinite Graphs","authors":"Pierre Ohlmann","doi":"10.1145/3531130.3532418","DOIUrl":"https://doi.org/10.1145/3531130.3532418","url":null,"abstract":"We study turn-based quantitative games of infinite duration opposing two antagonistic players and played over graphs. This model is widely accepted as providing the adequate framework for formalizing the synthesis question for reactive systems. This important application motivates the question of strategy complexity: which valuations (or payoff functions) admit optimal positional strategies (without memory)? Valuations for which both players have optimal positional strategies have been characterized by Gimbert and Zielonka [16] for finite graphs and by Colcombet and Niwiński [12] for infinite graphs. However, for reactive synthesis, existence of optimal positional strategies for the opponent (which models an antagonistic environment) is irrelevant. Despite this fact, not much is known about valuations for which the protagonist admits optimal positional strategies, regardless of the opponent. In this work, we characterize valuations which admit such strategies over infinite graphs. Our characterization uses the vocabulary of universal graphs, which has also proved useful in understanding recent breakthrough results regarding the complexity of parity games. More precisely, we show that a valuation admitting universal graphs which are monotonic and well-ordered is positional over all game graphs, and – more surprisingly – that the converse is also true for valuations admitting neutral colors. We prove the applicability and elegance of the framework by unifying a number of known positionality results, proving a few stronger ones, and establishing closure under lexicographical products.","PeriodicalId":373589,"journal":{"name":"Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121122142","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}

引用次数: 9

Linear-Algebraic Models of Linear Logic as Categories of Modules over Σ-Semirings✱ 线性逻辑作为模的范畴的线性代数模型Σ-Semirings:译者

Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2022-04-22 DOI: 10.1145/3531130.3533373

Takeshi Tsukada, Kazuyuki Asada

引用次数: 2