International Symposium on Games, Automata, Logics and Formal Verification最新文献_第2页

CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms CryptoSolve:迈向加密算法符号分析的工具

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2022-09-20 DOI: 10.4204/EPTCS.370.10

Dalton Chichester, W. Du, Raymond Kauffman, Hai Lin, Christopher Lynch, Andrew M. Marshall, C. Meadows, P. Narendran, V. Ravishankar, Luis Rovira, Brandon Rozek

{"title":"CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms","authors":"Dalton Chichester, W. Du, Raymond Kauffman, Hai Lin, Christopher Lynch, Andrew M. Marshall, C. Meadows, P. Narendran, V. Ravishankar, Luis Rovira, Brandon Rozek","doi":"10.4204/EPTCS.370.10","DOIUrl":"https://doi.org/10.4204/EPTCS.370.10","url":null,"abstract":"Recently, interest has been emerging in the application of symbolic techniques to the specification and analysis of cryptosystems. These techniques, when accompanied by suitable proofs of soundness/completeness, can be used both to identify insecure cryptosystems and prove sound ones secure. But although a number of such symbolic algorithms have been developed and implemented, they remain scattered throughout the literature. In this paper, we present a tool, CryptoSolve, which provides a common basis for specification and implementation of these algorithms, CryptoSolve includes libraries that provide the term algebras used to express symbolic cryptographic systems, as well as implementations of useful algorithms, such as unification and variant generation. In its current initial iteration, it features several algorithms for the generation and analysis of cryptographic modes of operation, which allow one to use block ciphers to encrypt messages more than one block long. The goal of our work is to continue expanding the tool in order to consider additional cryptosystems and security questions, as well as extend the symbolic libraries to increase their applicability.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127051750","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

Adapting to the Behavior of Environments with Bounded Memory 适应有限记忆环境的行为

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.346.4

Dhananjay Raju, Rüdiger Ehlers, U. Topcu

{"title":"Adapting to the Behavior of Environments with Bounded Memory","authors":"Dhananjay Raju, Rüdiger Ehlers, U. Topcu","doi":"10.4204/EPTCS.346.4","DOIUrl":"https://doi.org/10.4204/EPTCS.346.4","url":null,"abstract":"We study the problem of synthesizing implementations from temporal logic specifications that need to work correctly in all environments that can be represented as transducers with a limited number of states. This problem was originally defined and studied by Kupferman, Lustig, Vardi, and Yannakakis. They provide NP and 2-EXPTIME lower and upper bounds (respectively) for the complexity of this problem, in the size of the transducer. We tighten the gap by providing a PSPACE lower bound, thereby showing that algorithms for solving this problem are unlikely to scale to large environment sizes. This result is somewhat unfortunate as solving this problem enables tackling some high-level control problems in which an agent has to infer the environment behavior from observations. To address this observation, we study a modified synthesis problem in which the synthesized controller must gather information about the environment's behavior safely. We show that the problem of determining whether the behavior of such an environment can be safely learned is only co-NP-complete. Furthermore, in such scenarios, the behavior of the environment can be learned using a Turing machine that requires at most polynomial space in the size of the environment's transducer.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125973622","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

New Algorithms for Combinations of Objectives using Separating Automata 基于分离自动机的目标组合新算法

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.346.15

Ashwani Anand, Nathanaël Fijalkow, Ali'enor Goubault-Larrecq, Jérôme Leroux, Pierre Ohlmann

引用次数: 0

Expressiveness of Extended Bounded Response LTL 扩展有界响应LTL的表达性

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.346.10

A. Cimatti, Luca Geatti, N. Gigante, A. Montanari, Stefano Tonetta

{"title":"Expressiveness of Extended Bounded Response LTL","authors":"A. Cimatti, Luca Geatti, N. Gigante, A. Montanari, Stefano Tonetta","doi":"10.4204/EPTCS.346.10","DOIUrl":"https://doi.org/10.4204/EPTCS.346.10","url":null,"abstract":"Extended Bounded Response LTL with Past (LTLEBR+P) is a safety fragment of Linear Temporal Logic with Past (LTL+P) that has been recently introduced in the context of reactive synthesis. The strength of LTLEBR+P is a fully symbolic compilation of formulas into symbolic deterministic automata. Its syntax is organized in four levels. The first three levels feature (a particular combination of) future temporal modalities, the last one admits only past temporal operators. At the base of such a structuring there are algorithmic motivations: each level corresponds to a step of the algorithm for the automaton construction. The complex syntax of LTLEBR+P made it difficult to precisely characterize its expressive power, and to compare it with other LTL+P safety fragments. In this paper, we first prove that LTLEBR+P is expressively complete with respect to the safety fragment of LTL+P, that is, any safety language definable in LTL+P can be formalized in LTLEBR+P, and vice versa. From this, it follows that LTLEBR+P and Safety-LTL are expressively equivalent. Then, we show that past modalities play an essential role in LTLEBR+P: we prove that the future fragment of LTLEBR+P is strictly less expressive than full LTLEBR+P.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116971968","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

Decision Tree Learning with Spatial Modal Logics 空间模态逻辑的决策树学习

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.346.18

G. Pagliarini, G. Sciavicco

{"title":"Decision Tree Learning with Spatial Modal Logics","authors":"G. Pagliarini, G. Sciavicco","doi":"10.4204/EPTCS.346.18","DOIUrl":"https://doi.org/10.4204/EPTCS.346.18","url":null,"abstract":"Symbolic learning represents the most straightforward approach to interpretable modeling, but its applications have been hampered by a single structural design choice: the adoption of propositional logic as the underlying language. Recently, more-than-propositional symbolic learning methods have started to appear, in particular for time-dependent data. These methods exploit the expressive power of modal temporal logics in powerful learning algorithms, such as temporal decision trees, whose classification capabilities are comparable with the best non-symbolic ones, while producing models with explicit knowledge representation. With the intent of following the same approach in the case of spatial data, in this paper we: i) present a theory of spatial decision tree learning; ii) describe a prototypical implementation of a spatial decision tree learning algorithm based, and strictly extending, the classical C4.5 algorithm; and iii) perform a series of experiments in which we compare the predicting power of spatial decision trees with that of classical propositional decision trees in several versions, for a multi-class image classification problem, on publicly available datasets. Our results are encouraging, showing clear improvements in the performances from the propositional to the spatial models, which in turn show higher levels of interpretability.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133227145","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

Filtration and canonical completeness for continuous modal mu-calculi 连续模态模微积分的滤波与正则完备性

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2021-09-17 DOI: 10.4204/EPTCS.346.14

J.M.W. Rooduijn, Y. Venema

引用次数: 0

Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent (Long Version) 可重构广播网络和异步共享内存系统是等价的(长版本)

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2021-08-17 DOI: 10.4204/EPTCS.346.2

A. Balasubramanian, C. Weil-Kennedy

{"title":"Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent (Long Version)","authors":"A. Balasubramanian, C. Weil-Kennedy","doi":"10.4204/EPTCS.346.2","DOIUrl":"https://doi.org/10.4204/EPTCS.346.2","url":null,"abstract":"We show the equivalence of two distributed computing models, namely reconfigurable broadcast networks (RBN) and asynchronous shared-memory systems (ASMS), that were introduced independently. Both RBN and ASMS are systems in which a collection of anonymous, finite-state processes run the same protocol. In RBN, the processes communicate by selective broadcast: a process can broadcast a message which is received by all of its neighbors, and the set of neighbors of a process can change arbitrarily over time. In ASMS, the processes communicate by shared memory: a process can either write to or read from a shared register. Our main result is that RBN and ASMS can simulate each other, i.e. they are equivalent with respect to parameterized reachability, where we are given two (possibly infinite) sets of configurations C and C' defined by upper and lower bounds on the number of processes in each state and we would like to decide if some configuration in C can reach some configuration in C'. Using this simulation equivalence, we transfer results of RBN to ASMS and vice versa. Finally, we show that RBN and ASMS can simulate a third distributed model called immediate observation (IO) nets. Moreover, for a slightly stronger notion of simulation (which is satisfied by all the simulations given in this paper), we show that IO nets cannot simulate RBN.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124131156","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

Finite Model Property and Bisimulation for LFD LFD的有限模型性质及双仿真

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2021-07-13 DOI: 10.4204/EPTCS.346.11

R. Koudijs

引用次数: 1

Decentralized LTL Enforcement 分散的LTL执行

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2021-07-07 DOI: 10.4204/EPTCS.346.9

F. Gallay, Yliès Falcone

引用次数: 4

Symbolic Parity Game Solvers that Yield Winning Strategies 产生制胜策略的符号奇偶博弈解算器

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2020-09-20 DOI: 10.4204/EPTCS.326.2

Oebele Lijzenga, T. V. Dijk

引用次数: 3