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

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science最新文献

筛选
英文 中文
LICS: Logic in Computer Security -- Some Attacker's Models and Related Decision Problems 计算机安全中的逻辑——一些攻击者的模型和相关的决策问题
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.68
Hubert Comon-Lundh
{"title":"LICS: Logic in Computer Security -- Some Attacker's Models and Related Decision Problems","authors":"Hubert Comon-Lundh","doi":"10.1109/LICS.2013.68","DOIUrl":"https://doi.org/10.1109/LICS.2013.68","url":null,"abstract":"Logic plays an important role in formal aspects of computer security, for instance in access control, security of communications or even intrusion detection. The peculiarity of security problems is the presence of an attacker, whose goal is to break the intended properties of a system/database/protocol... In this tutorial, we will consider several attacker's models and study how to find attacks (or to get security guarantees) on communication protocols in these different models.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133278541","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
Kripke Semantics for Modal Bilattice Logic 模态双格逻辑的Kripke语义
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.50
A. Jung, U. Rivieccio
{"title":"Kripke Semantics for Modal Bilattice Logic","authors":"A. Jung, U. Rivieccio","doi":"10.1109/LICS.2013.50","DOIUrl":"https://doi.org/10.1109/LICS.2013.50","url":null,"abstract":"We employ the well-developed and powerful techniques of algebraic semantics and Priestley duality to set up a Kripke semantics for a modal expansion of Arieli and Avron's bilattice logic, itself based on Belnap's four-valued logic. We obtain soundness and completeness of a Hilbert-style derivation system for this logic with respect to four-valued Kripke frames, the standard notion of model in this setting. The proof is via intermediary relational structures which are analysed through a topological reading of one of the axioms of the logic. Both local and global consequence on the models are covered.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121941020","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}
引用次数: 33
Measurable Spaces and Their Effect Logic 可测量空间及其效应逻辑
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.13
B. Jacobs
{"title":"Measurable Spaces and Their Effect Logic","authors":"B. Jacobs","doi":"10.1109/LICS.2013.13","DOIUrl":"https://doi.org/10.1109/LICS.2013.13","url":null,"abstract":"So-called effect algebras and modules are basic mathematical structures that were first identified in mathematical physics, for the study of quantum logic and quantum probability. They incorporate a double negation law p⊥⊥ = p. Since then it has been realised that these effect structures form a useful abstraction that covers not only quantum logic, but also Boolean logic and probabilistic logic. Moreover, the duality between effect and convex structures lies at the heart of the duality between predicates and states. These insights are leading to a uniform framework for the semantics of computation and logic. This framework has been elaborated elsewhere for settheoretic, discrete probabilistic, and quantum computation. Here the missing case of continuous probability is shown to fit in the same uniform framework. On a technical level, this involves an investigation of the logical aspects of the Giry monad on measurable spaces and of Lebesgue integration.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125212101","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}
引用次数: 40
The Cost of Usage in the ?-Calculus 使用的代价?-微积分
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.35
A. Asperti, J. Lévy
{"title":"The Cost of Usage in the ?-Calculus","authors":"A. Asperti, J. Lévy","doi":"10.1109/LICS.2013.35","DOIUrl":"https://doi.org/10.1109/LICS.2013.35","url":null,"abstract":"A new “inductive” approach to standardization for the λ-calculus has been recently introduced by Xi, allowing him to establish a double-exponential upper bound |M|2|σ| for the length of the standard reduction relative to an arbitrary reduction σ originated in M. In this paper we refine Xi's analysis, obtaining much better bounds, especially for computations producing small normal forms. For instance, for terms reducing to a boolean, we are able to prove that the length of the standard reduction is at most a mere factorial of the length of the shortest reduction sequence. The methodological innovation of our approach is that instead of counting the cost for producing something, as is customary, we count the cost of consuming things. The key observation is that the part of a λ-term that is needed to produce the normal form (or an arbitrary rigid prefix) may rapidly augment along a computation, but can only decrease very slowly (actually, linearly).","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125914476","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
On the Context-Freeness Problem for Vector Addition Systems 向量加法系统的上下文无关性问题
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.9
Jérôme Leroux, Vincent Penelle, G. Sutre
{"title":"On the Context-Freeness Problem for Vector Addition Systems","authors":"Jérôme Leroux, Vincent Penelle, G. Sutre","doi":"10.1109/LICS.2013.9","DOIUrl":"https://doi.org/10.1109/LICS.2013.9","url":null,"abstract":"Petri nets, or equivalently vector addition systems (VAS), are widely recognized as a central model for concurrent systems. Many interesting properties are decidable for this class, such as boundedness, reachability, regularity, as well as context-freeness, which is the focus of this paper. The context-freeness problem asks whether the trace language of a given VAS is context-free. This problem was shown to be decidable by Schwer in 1992, but the proof is very complex and intricate. The resulting decision procedure relies on five technical conditions over a customized coverability graph. These five conditions are shown to be necessary, but the proof that they are sufficient is only sketched. In this paper, we revisit the context-freeness problem for VAS, and give a simpler proof of decidability. Our approach is based on witnesses of non-context-freeness, that are bounded regular languages satisfying a nesting condition. As a corollary, we obtain that the trace language of a VAS is context-free if, and only if, it has a context-free intersection with every bounded regular language.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129791366","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}
引用次数: 10
Stone Duality for Markov Processes 马尔可夫过程的石对偶性
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.38
D. Kozen, K. Larsen, R. Mardare, P. Panangaden
{"title":"Stone Duality for Markov Processes","authors":"D. Kozen, K. Larsen, R. Mardare, P. Panangaden","doi":"10.1109/LICS.2013.38","DOIUrl":"https://doi.org/10.1109/LICS.2013.38","url":null,"abstract":"We define Aumann algebras, an algebraic analog of probabilistic modal logic. An Aumann algebra consists of a Boolean algebra with operators modeling probabilistic transitions. We prove a Stone-type duality theorem between countable Aumann algebras and countably-generated continuous-space Markov processes. Our results subsume existing results on completeness of probabilistic modal logics for Markov processes.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130665353","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}
引用次数: 28
Bisimilarity of Pushdown Automata is Nonelementary 下推自动机的双相似性是非初等的
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.55
Michael Benedikt, Stefan Göller, S. Kiefer, A. Murawski
{"title":"Bisimilarity of Pushdown Automata is Nonelementary","authors":"Michael Benedikt, Stefan Göller, S. Kiefer, A. Murawski","doi":"10.1109/LICS.2013.55","DOIUrl":"https://doi.org/10.1109/LICS.2013.55","url":null,"abstract":"Given two pushdown automata, the bisimilarity problem asks whether the infinite transition systems they induce are bisimilar. While this problem is known to be decidable our main result states that it is nonelementary, improving EXPTIME-hardness, which was the best previously known lower bound for this problem. Our lower bound result holds for normed pushdown automata as well.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116844017","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}
引用次数: 24
Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata Rabin-Mostowski指数问题:超越确定性自动机的一步
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.56
Alessandro Facchini, Filip Murlak, Michal Skrzypczak
{"title":"Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata","authors":"Alessandro Facchini, Filip Murlak, Michal Skrzypczak","doi":"10.1109/LICS.2013.56","DOIUrl":"https://doi.org/10.1109/LICS.2013.56","url":null,"abstract":"For a given regular language of infinite trees, one can ask about the minimal number of priorities needed to recognise this language with a non-deterministic or alternating parity automaton. These questions are known as, respectively, the non-deterministic and the alternating Rabin-Mostowski index problems. Whether they can be answered effectively is a long-standing open problem, solved so far only for languages recognisable by deterministic automata (the alternating variant trivialises). We investigate a wider class of regular languages, recognisable by so-called game automata, which can be seen as the closure of deterministic ones under complementation and composition. Game automata are known to recognise languages arbitrarily high in the alternating Rabin-Mostowski index hierarchy, i.e., the alternating index problem does not trivialise any more. Our main contribution is that both index problems are decidable for languages recognisable by game automata. Additionally, we show that it is decidable whether a given regular language can be recognised by a game automaton.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122308333","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}
引用次数: 19
Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit Sharing 原子λ演算:具有显式共享的类型化λ演算
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.37
T. Gundersen, W. Heijltjes, M. Parigot
{"title":"Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit Sharing","authors":"T. Gundersen, W. Heijltjes, M. Parigot","doi":"10.1109/LICS.2013.37","DOIUrl":"https://doi.org/10.1109/LICS.2013.37","url":null,"abstract":"An explicit-sharing lambda-calculus is presented, based on a Curry-Howard-style interpretation of the deep inference proof formalism. Duplication of subterms during reduction proceeds `atomically', i.e. on individual constructors, similar to optimal graph reduction in the style of Lamping. The calculus preserves strong normalisation with respect to the lambda-calculus, and achieves fully lazy sharing.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123388350","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}
引用次数: 26
Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL 命题赋值的动态逻辑:PDL的一个良好变体
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.20
P. Balbiani, A. Herzig, N. Troquard
{"title":"Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL","authors":"P. Balbiani, A. Herzig, N. Troquard","doi":"10.1109/LICS.2013.20","DOIUrl":"https://doi.org/10.1109/LICS.2013.20","url":null,"abstract":"We study a version of Propositional Dynamic Logic (PDL) that we call Dynamic Logic of Propositional Assignments (DL-PA). The atomic programs of DL-PA are assignments of propositional variables to true or to false. We show that DL-PA behaves better than PDL, having e.g. compactness and eliminability of the Kleene star. We establish tight complexity results: both satisfiability and model checking are EXPTIME-complete.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114637137","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}
引用次数: 68
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信
小红书