2009 24th Annual IEEE Symposium on Logic In Computer Science最新文献_第4页

A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes 高阶递推格式的模态mu -微积分模型检验的等效类型系统

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI: 10.1109/LICS.2009.29

N. Kobayashi, C. Ong

引用次数: 155

Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks 锁链的有界性与无界性:表征通过锁通信的线程的双cfl可达性的可判定性

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI: 10.1109/LICS.2009.45

Vineet Kahlon

{"title":"Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks","authors":"Vineet Kahlon","doi":"10.1109/LICS.2009.45","DOIUrl":"https://doi.org/10.1109/LICS.2009.45","url":null,"abstract":"The problem of Pairwise CFL-reachability is to decide whether two given program locations in different threads are simultaneously reachable in the presence of recursion in threads and scheduling constraints imposed by synchronization primitives. Pairwise CFL-reachability is the core problem underlying concurrent program analysis especially dataflow analysis. Unfortunately, it is undecidable even for the most commonly used synchronization primitive, i.e., mutex locks. Lock usage in concurrent programs can be characterized in terms of lock chains, where a sequence of mutex locks is said to be chained if the scopes of adjacent (nonnested) mutexes overlap. Although pairwise reachability is known to decidable for threads interacting via nested locks, i.e., chains of length one, these techniques don’t extend to programs with non-nested locks used in crucial applications like databases and device drivers. In this paper, we exploit the fact that lock usage patterns in real life programs do not produce unbounded lock chains. For such programs, we show that pairwise CFL-reachability becomes decidable. Our new results narrow the decidability gap for pairwise CFL-reachability by providing a more refined characterization for it in terms of boundedness of lock chains rather than the current state-of-the-art, i.e., nestedness of locks (chains of length one).","PeriodicalId":415902,"journal":{"name":"2009 24th Annual IEEE Symposium on Logic In Computer Science","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122972644","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

Indexed Containers 索引容器

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI: 10.1017/S095679681500009X

Thorsten Altenkirch, Neil Ghani, P. Hancock, Conor McBride, Peter Morris

引用次数: 135

The General Vector Addition System Reachability Problem by Presburger Inductive Invariants Presburger归纳不变量的一般向量相加系统可达性问题

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI: 10.2168/LMCS-6(3:22)2010

Jérôme Leroux

{"title":"The General Vector Addition System Reachability Problem by Presburger Inductive Invariants","authors":"Jérôme Leroux","doi":"10.2168/LMCS-6(3:22)2010","DOIUrl":"https://doi.org/10.2168/LMCS-6(3:22)2010","url":null,"abstract":"The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the classical Kosaraju-Lambert-Mayr-Sacerdote-Tenney decomposition. This decomposition is used in this paper to prove that the Parikh images of languages accepted by VASs are semi-pseudo-linear; a class that extends the semi-linear sets, a.k.a. the sets definable in the Presburger arithmetic. We provide an application of this result; we prove that a final configuration is not reachable from an initial one if and only if there exists a Presburger formula denoting a forward inductive invariant that contains the initial configuration but not the final one. Since we can decide if a Preburger formula denotes an inductive invariant, we deduce that there exist checkable certificates of non-reachability. In particular, there exists a simple algorithm for deciding the general VAS reachability problem based on two semi-algorithms. A first one that tries to prove the reachability by enumerating finite sequences of actions and a second one that tries to prove the non-reachability by enumerating Presburger formulas.","PeriodicalId":415902,"journal":{"name":"2009 24th Annual IEEE Symposium on Logic In Computer Science","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130064022","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}

引用次数: 78

An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it 奇偶博弈策略改进算法的指数下界

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI: 10.1109/LICS.2009.27

Oliver Friedmann

引用次数: 93

On the Computational Complexity of Verifying One-Counter Processes 关于验证单计数器过程的计算复杂度

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-11 DOI: 10.1109/LICS.2009.37

Stefan Göller, Richard Mayr, A. Lin

引用次数: 40

Trace Semantics is Fully Abstract 跟踪语义是完全抽象的

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-08-01 DOI: 10.1109/LICS.2009.12

Sumit Nain, Moshe Y. Vardi

{"title":"Trace Semantics is Fully Abstract","authors":"Sumit Nain, Moshe Y. Vardi","doi":"10.1109/LICS.2009.12","DOIUrl":"https://doi.org/10.1109/LICS.2009.12","url":null,"abstract":"The discussion in the computer-science literature of the relative merits of linear- versus branching-time frameworks goes back to the early 1980s. One of the beliefs dominating this discussion has been that the linear-time framework is not expressive enough semantically, making linear-time logics lacking in expressiveness. In this work we examine the branching-linear issue from the perspective of process equivalence, which is one of the most fundamental concepts in concurrency theory, as defining a notion of equivalence essentially amounts to defining semantics for processes. We accept three principles that have been recently proposed for concurrent-process equivalence. The first principle takes contextual equivalence as the primary notion of equivalence. The second principle requires the description of a process to specify all relevant behavioral aspects of the process. The third principle requires observable process behavior to be reflected in its input/output behavior. It has been recently shown that under these principles trace semantics for nondeterministic transducers is fully abstract. Here we consider two extensions of the earlier model: probabilistic transducers and asynchronous transducers. We show that in both cases trace semantics is fully abstract.","PeriodicalId":415902,"journal":{"name":"2009 24th Annual IEEE Symposium on Logic In Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122278630","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

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics 关于梯度模态逻辑可满足性问题复杂性的一个注记

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-05-19 DOI: 10.1109/LICS.2009.17

Yevgeny Kazakov, Ian Pratt-Hartmann

引用次数: 27

Expressiveness and Closure Properties for Quantitative Languages 定量语言的表达性和闭包属性

2009 24th Annual IEEE Symposium on Logic In Computer Science Pub Date : 2009-05-13 DOI: 10.2168/LMCS-6(3:10)2010

K. Chatterjee, L. Doyen, T. Henzinger

{"title":"Expressiveness and Closure Properties for Quantitative Languages","authors":"K. Chatterjee, L. Doyen, T. Henzinger","doi":"10.2168/LMCS-6(3:10)2010","DOIUrl":"https://doi.org/10.2168/LMCS-6(3:10)2010","url":null,"abstract":"Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit average, or discounted sum of the transition weights. We study expressiveness and closure questions about these quantitative languages. We first show that the set of words with value greater than a threshold can be non-omega-regular for deterministic limit-average and discounted-sum automata, while this set is always omega-regular when the threshold is isolated (i.e., some neighborhood around the threshold contains no word). In the latter case, we prove that the omega-regular language is robust against small perturbations of the transition weights. We next consider automata with transition weights 0 or 1 and show that they are as expressive as general weighted automata in the limit-average case, but not in the discounted-sum case. Third, for quantitative languages L1 and L2, we consider the operations max(L1, L2), min(L1, L2), and 1-L1, which generalize the boolean operations on languages, as well as the sum L1 + L2. We establish the closure properties of all classes of quantitative languages with respect to these four operations.","PeriodicalId":415902,"journal":{"name":"2009 24th Annual IEEE Symposium on Logic In Computer Science","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134603323","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}

引用次数: 87