2012 27th Annual IEEE Symposium on Logic in Computer Science最新文献

Regular Transformations of Infinite Strings 无限弦的正则变换

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

R. Alur, E. Filiot, Ashutosh Trivedi

{"title":"Regular Transformations of Infinite Strings","authors":"R. Alur, E. Filiot, Ashutosh Trivedi","doi":"10.1109/LICS.2012.18","DOIUrl":"https://doi.org/10.1109/LICS.2012.18","url":null,"abstract":"The theory of regular transformations of finite strings is quite mature with appealing properties. This class can be equivalently defined using both logic (Monadic second-order logic) and finite-state machines (two-way transducers, and more recently, streaming string transducers); is closed under operations such as sequential composition and regular choice; and problems such as functional equivalence and type checking, are decidable for this class. In this paper, we initiate a study of transformations of infinite strings. The MSO-based definition for regular string transformations generalizes naturally to infinite strings. We define an equivalent generalization of the machine model of streaming string transducers to infinite strings. A streaming string transducer is a deterministic machine that makes a single pass over the input string, and computes the output fragments using a finite set of string variables that are updated in a copyless manner at each step. We show how Muller acceptance condition for automata over infinite strings can be generalized to associate an infinite output string with an infinite execution. The proof that our model captures all MSO-definable transformations uses two-way transducers. Unlike the case of finite strings, MSO-equivalent definition of two-way transducers over infinite strings needs to make decisions based on omega-regular look-ahead. Simulating this look-ahead using multiple variables with copyless updates, is the main technical challenge in our constructions. Finally, we show that type checking and functional equivalence are decidable for MSO-definable transformations of infinite strings.","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"109 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":"115527953","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}

引用次数: 41

Learning Probabilistic Systems from Tree Samples 从树样本中学习概率系统

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

Anvesh Komuravelli, C. Pasareanu, E. Clarke

引用次数: 20

Two-Variable First-Order Logic with Equivalence Closure 具有等价闭包的二变量一阶逻辑

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

Emanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera

引用次数: 64

Decidable Elementary Modal Logics 可决初等模态逻辑

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

Jakub Michaliszyn, J. Otop

引用次数: 9

A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism 具有概率和不确定性的信息隐藏的kantorovich -一元幂域

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

Annabelle McIver, L. Meinicke, Carroll Morgan

引用次数: 18

Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving 高阶逻辑的基础组合(Co)数据类型:范畴论在定理证明中的应用

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

Dmitriy Traytel, A. Popescu, J. Blanchette

引用次数: 64

Graph Logics with Rational Relations and the Generalized Intersection Problem 具有有理关系的图逻辑与广义交问题

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

P. Barceló, Diego Figueira, L. Libkin

{"title":"Graph Logics with Rational Relations and the Generalized Intersection Problem","authors":"P. Barceló, Diego Figueira, L. Libkin","doi":"10.1109/LICS.2012.23","DOIUrl":"https://doi.org/10.1109/LICS.2012.23","url":null,"abstract":"We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications. Such logics use conditions on paths expressed by regular languages and relations, but they often need to be extended by rational relations such as subword (factor) or subsequence. Evaluating formulae in such extended graph logics boils down to checking nonemptiness of the intersection of rational relations with regular or recognizable relations (or, more generally, to the generalized intersection problem, asking whether some projections of a regular relation have a nonempty intersection with a given rational relation). We prove that for several basic and commonly used rational relations, the intersection problem with regular relations is either undecidable (e.g., for subword or suffix, and some generalizations), or decidable with non-multiply-recursive complexity (e.g., for subsequence and its generalizations). These results are used to rule out many classes of graph logics that freely combine regular and rational relations, as well as to provide the simplest problem related to verifying lossy channel systems that has non-multiply-recursive complexity. We then prove a dichotomy result for logics combining regular conditions on individual paths and rational relations on paths, by showing that the syntactic form of formulae classifies them into either efficiently checkable or undecidable cases. We also give examples of rational relations for which such logics are decidable even without syntactic restrictions.","PeriodicalId":407972,"journal":{"name":"2012 27th Annual IEEE Symposium on Logic in Computer Science","volume":"73 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":"123288688","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}

引用次数: 35

An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction alph - 0范畴量化约束满足的代数守恒定理

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

Hubie Chen, M. Müller

引用次数: 6

Interpretations in Trees with Countably Many Branches 《数枝树》释义

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

A. Rabinovich, S. Rubin

引用次数: 4

Von Neumann's Biased Coin Revisited 重新审视冯·诺伊曼的偏见硬币

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

L. Bienvenu, B. Monin

引用次数: 11