2012 27th Annual IEEE Symposium on Logic in Computer Science最新文献_第2页

On the Significance of the Collapse Operation 论塌陷手术的意义

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.62

P. Parys

引用次数: 31

The Complexity of Verbal Languages over Groups 群体语言的复杂性

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.50

Sanjay Jain, A. Myasnikov, F. Stephan

引用次数: 8

Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics 副协调逻辑的无切序演算的模块化构造

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.20

A. Avron, B. Konikowska, A. Zamansky

引用次数: 28

On the Ordered Conjecture 关于有序猜想

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.33

Yijia Chen, J. Flum

{"title":"On the Ordered Conjecture","authors":"Yijia Chen, J. Flum","doi":"10.1109/LICS.2012.33","DOIUrl":"https://doi.org/10.1109/LICS.2012.33","url":null,"abstract":"It is well-known that least fixed-point logic LFP captures the complexity class PTIME on ordered structures. The ordered conjecture claims that LFP is more expressive than first-order logic FO on every infinite class O of finite ordered structures. We present two methods which yield that LFP is more expressive than FO on various types of classes of ordered structures. The first method, the model-checking method, among others, can be applied for all such classes O of bounded cliquewidth. By the second method, the padding method, we show that for classes O of ``bounded treewidth,'' more precisely, for classes O such that there is a bound for the treewidth of the successor structures associated with the members of O, even DTC is more expressive than FO on O, where DTC denotes the deterministic transitive closure logic, a logic that captures the complexity class L on ordered structures. Furthermore, with the padding method we get that for every infinite class of ordered structures O we have that DTC is more expressive than FO on the class of all ordered sums of pairs of structures in O. Under some complexity theoretic assumption, we prove the existence of a class O of ordered structures such that on O not only LFP is more expressive than FO, but also LFP has the expressive power of existential second-order logic. Furthermore, we characterize those classes of structures whose corresponding class of all ordered versions has bounded treewidth.","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123678101","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}

引用次数: 8

Dense-Timed Pushdown Automata 密集时间下推自动机

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.15

P. Abdulla, M. Atig, Jari Stenman

引用次数: 71

Decidability of DPDA Language Equivalence via First-Order Grammars 一阶语法下DPDA语言等价的可判定性

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.51

P. Jančar

引用次数: 31

The Semantics of Parsing with Semantic Actions 使用语义动作进行解析的语义

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.19

R. Atkey

{"title":"The Semantics of Parsing with Semantic Actions","authors":"R. Atkey","doi":"10.1109/LICS.2012.19","DOIUrl":"https://doi.org/10.1109/LICS.2012.19","url":null,"abstract":"The recovery of structure from flat sequences of input data is a problem that almost all programs need to solve. Computer Science has developed a wide array of declarative languages for describing the structure of languages, usually based on the context-free grammar formalism, and there exist parser generators that produce efficient parsers for these descriptions. However, when faced with a problem involving parsing, most programmers opt for ad-hoc hand-coded solutions, or use parser combinator libraries to construct parsing functions. This paper develops a hybrid approach, treating grammars as collections of active right-hand sides, indexed by a set of non-terminals. Active right-hand sides are built using the standard monadic parser combinators and allow the consumed input to affect the language being parsed, thus allowing for the precise description of the realistic languages that arise in programming. We carefully investigate the semantics of grammars with active right-hand sides, not just from the point of view of language acceptance but also in terms of the generation of parse results. Ambiguous grammars may generate exponentially, or even infinitely, many parse results and these must be efficiently represented using Shared Packed Parse Forests (SPPFs). A particular feature of our approach is the use of Reynolds-style parametricity to ensure that the language that grammars describe cannot be affected by the representation of parse results.","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131087506","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 Magnitude of Completeness Thresholds in Bounded Model Checking 有界模型检验中完备性阈值的大小问题

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.27

Daniel Bundala, J. Ouaknine, J. Worrell

{"title":"On the Magnitude of Completeness Thresholds in Bounded Model Checking","authors":"Daniel Bundala, J. Ouaknine, J. Worrell","doi":"10.1109/LICS.2012.27","DOIUrl":"https://doi.org/10.1109/LICS.2012.27","url":null,"abstract":"Bounded model checking (BMC) is a highly successful bug-finding method that examines paths of bounded length for violations of a given regular or w-regular specification. A completeness threshold for a given model M and specification φ is a bound k such that, if no counterexample to φ of length k or less can be found in M, then M in fact satisfies φ. The quest for `small' completeness thresholds in BMC goes back to the very inception of the technique, over a decade ago, and remains a topic of active research. For a fixed specification, completeness thresholds are typically expressed in terms of key attributes of the models under consideration, such as their diameter (length of the longest shortest path) and especially their recurrence diameter (length of the longest loop-free path). A recent research paper identified a large class of LTL specifications having completeness thresholds linear in the models' recurrence diameter [7]. However, the authors left open the question of whether linearity is in general even decidable. In the present paper, we settle the problem in the affirmative, by showing that the linearity problem for both regular and ω-regular specifications (provided as automata and Buchi automata respectively) is PSPACE-complete. Moreover, we establish the following dichotomies: for regular specifications, completeness thresholds are either linear or exponential, whereas for ω-regular specifications, completeness thresholds are either linear or at least quadratic.","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133624090","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

An Automata Model for Trees with Ordered Data Values 具有有序数据值树的自动机模型

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.69

Tony Tan

{"title":"An Automata Model for Trees with Ordered Data Values","authors":"Tony Tan","doi":"10.1109/LICS.2012.69","DOIUrl":"https://doi.org/10.1109/LICS.2012.69","url":null,"abstract":"Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value from an infinite domain. They have been used as an abstraction model for reasoning tasks on XML and verification. However, most existing approaches consider the case where only equality test can be performed on the data values. In this paper we study data trees in which the data values come from a linearly ordered domain, and in addition to equality test, we can test whether the data value in a node is greater than the one in another node. We introduce an automata model for them which we call ordered-data tree automata (ODTA), provide its logical characterisation, and prove that its emptiness problem is decidable in 3-NEXPTIME. We also show that the two-variable logic on unranked trees, studied by Bojanczyk, Muscholl, Schwentick and Segoufin in 2009, corresponds precisely to a special subclass of this automata model. Then we define a slightly weaker version of ODTA, which we call weak ODTA, and provide its logical characterisation. The complexity of the emptiness problem drops to NP. However, a number of existing formalisms and models studied in the literature can be captured already by weak ODTA. We also show that the definition of ODTA can be easily modified, to the case where the data values come from a tree-like partially ordered domain, such as strings.","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124956450","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}

引用次数: 8

Step Indexed Realizability Semantics for a Call-by-Value Language Based on Basic Combinatorial Objects 基于基本组合对象的按值调用语言的步骤索引可实现语义

2012 27th Annual IEEE Symposium on Logic in Computer Science Pub Date : 2012-06-25 DOI: 10.1109/LICS.2012.74

Naohiko Hoshino

引用次数: 3