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

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

筛选
英文 中文
Regular Functions and Cost Register Automata 常规函数和成本寄存器自动机
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.65
R. Alur, Loris D'antoni, Jyotirmoy V. Deshmukh, Mukund Raghothaman, Yifei Yuan
{"title":"Regular Functions and Cost Register Automata","authors":"R. Alur, Loris D'antoni, Jyotirmoy V. Deshmukh, Mukund Raghothaman, Yifei Yuan","doi":"10.1109/LICS.2013.65","DOIUrl":"https://doi.org/10.1109/LICS.2013.65","url":null,"abstract":"We propose a deterministic model for associating costs with strings that is parameterized by operations of interest (such as addition, scaling, and minimum), a notion of regularity that provides a yardstick to measure expressiveness, and study decision problems and theoretical properties of resulting classes of cost functions. Our definition of regularity relies on the theory of string-to-tree transducers, and allows associating costs with events that are conditioned on regular properties of future events. Our model of cost register automata allows computation of regular functions using multiple “write-only” registers whose values can be combined using the allowed set of operations. We show that the classical shortest-path algorithms as well as the algorithms designed for computing discounted costs can be adapted for solving the min-cost problems for the more general classes of functions specified in our model. Cost register automata with the operations of minimum and increment give a deterministic model that is equivalent to weighted automata, an extensively studied nondeterministic model, and this connection results in new insights and new open problems.","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":"130491613","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
A Compositional Semantics for the Reversible p-Calculus 可逆p-微积分的组合语义
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.45
Ioana Cristescu, J. Krivine, Daniele Varacca
{"title":"A Compositional Semantics for the Reversible p-Calculus","authors":"Ioana Cristescu, J. Krivine, Daniele Varacca","doi":"10.1109/LICS.2013.45","DOIUrl":"https://doi.org/10.1109/LICS.2013.45","url":null,"abstract":"We introduce a labelled transition semantics for the reversible π-calculus. It is the first account of a compositional definition of a reversible calculus, that has both concurrency primitives and name mobility. The notion of reversibility is strictly linked to the notion of causality. We discuss the notion of causality induced by our calculus, and we compare it with the existing notions in the literature, in particular for what concerns the syntactic feature of scope extrusion, typical of the π-calculus.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"55 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":"114044782","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}
引用次数: 97
An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree 有界度结构的最优Gaifman范式构造
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.11
Lucas Heimberg, D. Kuske, Nicole Schweikardt
{"title":"An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree","authors":"Lucas Heimberg, D. Kuske, Nicole Schweikardt","doi":"10.1109/LICS.2013.11","DOIUrl":"https://doi.org/10.1109/LICS.2013.11","url":null,"abstract":"This paper's main result presents a 3-fold exponential algorithm that transforms a first-order formula φ together with a number d into a formula in Gaifman normal form that is equivalent to φ on the class of structures of degree at most d. For structures of polynomial growth, we even get a 2-fold exponential algorithm. These results are complemented by matching lower bounds: We show that for structures of degree 2, a 2-fold exponential blow-up in the size of formulas cannot be avoided. And for structures of degree 3, a 3-fold exponential blow-up is unavoidable. As a result of independent interest we obtain a 1-fold exponential algorithm which transforms a given first-order sentence φ of a very restricted shape into a sentence in Gaifman normal form that is equivalent to φ on all structures.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"2 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":"126182639","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}
引用次数: 7
Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes 宇宙上具有保护递归类型不动点的内涵类型论
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.27
L. Birkedal, Rasmus Ejlers Møgelberg
{"title":"Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes","authors":"L. Birkedal, Rasmus Ejlers Møgelberg","doi":"10.1109/LICS.2013.27","DOIUrl":"https://doi.org/10.1109/LICS.2013.27","url":null,"abstract":"Guarded recursive functions and types are useful for giving semantics to advanced programming languages and for higher-order programming with infinite data types, such as streams, e.g., for modeling reactive systems. We propose an extension of intensional type theory with rules for forming fixed points of guarded recursive functions. Guarded recursive types can be formed simply by taking fixed points of guarded recursive functions on the universe of types. Moreover, we present a general model construction for constructing models of the intensional type theory with guarded recursive functions and types. When applied to the groupoid model of intensional type theory with the universe of small discrete groupoids, the construction gives a model of guarded recursion for which there is a one-to-one correspondence between fixed points of functions on the universe of types and fixed points of (suitable) operators on types. In particular, we find that the functor category Grpdωop from the preordered set of natural numbers to the category of groupoids is a model of intensional type theory with guarded recursive types.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"59 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":"124184382","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}
引用次数: 38
One-Path Reachability Logic 单路径可达逻辑
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.42
Grigore Roşu, Andrei Stefanescu, Stefan Ciobaca, Brandon M. Moore
{"title":"One-Path Reachability Logic","authors":"Grigore Roşu, Andrei Stefanescu, Stefan Ciobaca, Brandon M. Moore","doi":"10.1109/LICS.2013.42","DOIUrl":"https://doi.org/10.1109/LICS.2013.42","url":null,"abstract":"This paper introduces (one-path) reachability logic, a language-independent proof system for program verification, which takes an operational semantics as axioms and derives reachability rules, which generalize Hoare triples. This system improves on previous work by allowing operational semantics given with conditional rewrite rules, which are known to support all major styles of operational semantics. In particular, Kahn's big-step and Plotkin's small-step semantic styles are now supported. The reachability logic proof system is shown sound (i.e., partially correct) and (relatively) complete. Reachability logic thus eliminates the need to independently define an axiomatic and an operational semantics for each language, and the nonnegligible effort to prove the former sound and complete w.r.t. the latter. The soundness result has also been formalized in Coq, allowing reachability logic derivations to serve as formal proof certificates that rely only on the operational semantics.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"39 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":"116496027","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}
引用次数: 71
Substructure Temporal Logic 子结构时间逻辑
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.43
M. Benerecetti, F. Mogavero, A. Murano
{"title":"Substructure Temporal Logic","authors":"M. Benerecetti, F. Mogavero, A. Murano","doi":"10.1109/LICS.2013.43","DOIUrl":"https://doi.org/10.1109/LICS.2013.43","url":null,"abstract":"In formal verification and design, reasoning about substructures is a crucial aspect for several fundamental problems, whose solution often requires to select a portion of the model of interest on which to verify a specific property. In this paper, we present a new branching-time temporal logic, called Substructure Temporal Logic (STL*, for short), whose distinctive feature is to allow for quantifying over the possible substructure of a given structure. This logic is obtained by adding two new operators to CTL*, whose interpretation is given relative to the partial order induced by a suitable substructure relation. STL* turns out to be very expressive and allows to capture in a very natural way many well known problems, such as module checking, reactive synthesis and reasoning about games. A formal account of the model theoretic properties of the new logic and results about (un)decidability and complexity of related decision problems are also provided.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"8 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":"128873624","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}
引用次数: 13
Groupoids, Hypergraphs, and Symmetries in Finite Models 有限模型中的群拟、超图和对称性
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.10
M. Otto
{"title":"Groupoids, Hypergraphs, and Symmetries in Finite Models","authors":"M. Otto","doi":"10.1109/LICS.2013.10","DOIUrl":"https://doi.org/10.1109/LICS.2013.10","url":null,"abstract":"We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. The universal algebraic and combinatorial properties of groupoids are abstracted form the composition behaviour of partial injections and support a very natural approach to the construction of certain highly symmetric finite instances of hypergraphs and relational structures. The typical task of this kind asks for regular realisations of a locally specified overlap pattern between pieces (hyperedges, guarded substructures). We show that reduced products with groupoids provide a generic and versatile tool towards such constructions; they are explored in applications to the construction of finite hypergraph coverings, to finite model constructions for the guarded fragment, and to extension properties for partial isomorphisms of relational structures (in the sense of Hrushovski, Herwig, Lascar). To this end we construct groupoids whose Cayley graphs have large girth not just in the usual sense, but with respect to a discounted distance measure that contracts edges from the same sub-groupoid (colour) and only counts transitions between cosets (different colours), and show that their acyclicity properties guarantee corresponding degrees of acyclicity in reduced products.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"44 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":"116873172","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}
引用次数: 9
Forcing MSO on Infinite Words in Weak MSO 弱MSO中无限词的强制MSO
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-25 DOI: 10.1109/LICS.2013.51
Colin Riba
{"title":"Forcing MSO on Infinite Words in Weak MSO","authors":"Colin Riba","doi":"10.1109/LICS.2013.51","DOIUrl":"https://doi.org/10.1109/LICS.2013.51","url":null,"abstract":"We propose a forcing-based interpretation of monadic second-order logic (MSO) on infinite (omega) words in Weak MSO (WMSO). The interpretation is purely syntactic. We show that a formula with parameters is true in MSO if and only if its interpretation is true in WMSO. We also show that a closed formula is true in MSO if and only if its interpretation is provable under some axioms which hold for WMSO, but without axiomatizing it. We use model-theoretic arguments. Our approach is inspired from point-free topology: infinite words, seen as topological points, are approximated by filters of bounded segments. We devise forcing conditions such that the corresponding generic filters approximate Ramseyan factorizations of infinite words modulo satisfaction of formulas of a given quantifier depth. Our interpretation parallels some approaches to McNaughton's Theorem (equivalence between non-deterministic Bϋchi automata and deterministic Rabin automata) but the obtained formulas do not describe deterministic automata.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"3 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":"127729606","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}
引用次数: 1
Solving Partial-Information Stochastic Parity Games 求解部分信息随机奇偶对策
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-06-01 DOI: 10.1109/LICS.2013.40
Sumit Nain, Moshe Y. Vardi
{"title":"Solving Partial-Information Stochastic Parity Games","authors":"Sumit Nain, Moshe Y. Vardi","doi":"10.1109/LICS.2013.40","DOIUrl":"https://doi.org/10.1109/LICS.2013.40","url":null,"abstract":"We study one-sided partial-information 2-player concurrent stochastic games with parity objectives. In such a game, one of the players has only partial visibility of the state of the game, while the other player has complete knowledge. In general, such games are known to be undecidable, even for the case of a single player (POMDP). These undecidability results depend crucially on player strategies that exploit an infinite amount of memory. However, in many applications of games, one is usually more interested in finding a finite-memory strategy. We consider the problem of whether the player with partial information has a finite-memory winning strategy when the player with complete information is allowed to use an arbitrary amount of memory. We show that this problem is decidable.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"05 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129931082","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}
引用次数: 11
Maximum Matching and Linear Programming in Fixed-Point Logic with Counting 带计数的不动点逻辑中的最大匹配与线性规划
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-04-25 DOI: 10.1109/LICS.2013.23
Matthew W. Anderson, A. Dawar, Bjarki Holm
{"title":"Maximum Matching and Linear Programming in Fixed-Point Logic with Counting","authors":"Matthew W. Anderson, A. Dawar, Bjarki Holm","doi":"10.1109/LICS.2013.23","DOIUrl":"https://doi.org/10.1109/LICS.2013.23","url":null,"abstract":"We establish the expressibility in fixed-point logic with counting (FPC) of a number of natural polynomial-time problems. In particular, we show that the size of a maximum matching in a graph is definable in FPC. This settles an open problem first posed by Blass, Gurevich and Shelah [1], who asked whether the existence of perfect matchings in general graphs could be determined in the more powerful formalism of choiceless polynomial time with counting. Our result is established by noting that the ellipsoid method for solving linear programs of full dimension can be implemented in FPC. This allows us to prove that linear programs of full dimension can be optimised in FPC if the corresponding separation oracle problem can be defined in FPC. On the way to defining a suitable separation oracle for the maximum matching problem, we provide FPC formulas defining maximum flows and canonical minimum cuts in capacitated graphs.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117087646","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}
引用次数: 17
首页 上一页 下一页 尾页
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学术官方微信
小红书