21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)最新文献

Variables as Resource in Hoare Logics 变量在Hoare逻辑中作为资源

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.52

Matthew J. Parkinson, R. Bornat, Cristiano Calcagno

引用次数: 80

On Tractability and Congruence Distributivity 关于可溯性和同余分配性

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.2168/LMCS-3(2:6)2007

E. Kiss, M. Valeriote

引用次数: 30

Approximation Schemes for First-Order Definable Optimisation Problems 一阶可定义优化问题的近似格式

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.13

A. Dawar, Martin Grohe, S. Kreutzer, Nicole Schweikardt

引用次数: 55

On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus 非同步pi -微积分中线性与持续性的可表达性

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.39

C. Palamidessi, V. Saraswat, F. Valencia, B. Victor

引用次数: 53

Memoryful Branching-Time Logic 记忆分支-时间逻辑

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.34

O. Kupferman, Moshe Y. Vardi

{"title":"Memoryful Branching-Time Logic","authors":"O. Kupferman, Moshe Y. Vardi","doi":"10.1109/LICS.2006.34","DOIUrl":"https://doi.org/10.1109/LICS.2006.34","url":null,"abstract":"Traditional branching-time logics such as CTL* are memoryless: once a path in the computation tree is quantified at a given node, the computation that led to that node is forgotten. Recent work in planning suggests that CTL* cannot easily express temporal goals that refer to whole computations. Such goals require memoryful quantification of paths. With such a memoryful quantification, Epsi holds at a node s of a computation tree if there is a path pi starting at the root of the tree and going through s such that pi satisfies the linear-time formula psi. We define the memoryful branching-time logic mCTL* and study its expressive power and algorithmic properties. We show that mCTL* is as expressive, but exponentially more succinct, than CTL*, and that the ability of mCTL* to refer to the present is essential for this equivalence. From the algorithmic point of view, while the satisfiability problem for mCTL* is 2EXPTIME-complete - not harder than that of CTL*, its model-checking problem is EXPSPACE-complete - exponentially harder than that of CTL*. The upper bounds are obtained by extending the automata-theoretic approach to handle memoryful quantification, and are much more efficient than these obtained by translating mCTL* to branching logics with past. The EXPSPACE lower bound for the model-checking problem applies already to formulas of restricted form (in particular, to AGEpsi, which is useful for specifying possibility properties), and implies that reasoning about a memoryful branching-time logic is harder than reasoning about the linear-time logic of its path formulas","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125198262","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

Normalisation is Insensible to lambda-Term Identity or Difference 归一化对λ - term恒等或差分是不敏感的

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.36

M. Tatsuta, M. Dezani-Ciancaglini

{"title":"Normalisation is Insensible to lambda-Term Identity or Difference","authors":"M. Tatsuta, M. Dezani-Ciancaglini","doi":"10.1109/LICS.2006.36","DOIUrl":"https://doi.org/10.1109/LICS.2006.36","url":null,"abstract":"This paper analyses the computational behaviour of lambda-term applications. The properties we are interested in are weak normalisation (i.e. there is a terminating reduction) and strong normalisation (i.e. all reductions are terminating). One can prove that the application of a lambda-term M to a fixed number n of copies of the same arbitrary strongly normalising lambda-term is strongly normalising if and only if the application of M to n different arbitrary strongly normalising lambda-terms is strongly normalising, i.e. one has that M (X ... X)/n is strongly normalising, for an arbitrary strongly normalising X, if and only if MX1...Xn is strongly normalising for arbitrary strongly normalising X1, ..., Xn. The analogous property holds when replacing strongly normalising by weakly normalising. As an application of the result on strong normalisation the lambda-terms whose interpretation is the top element (in the environment which associates the top element to all variables) of the Honsell-Lenisa model turn out to be exactly the lambda-terms which, applied to an arbitrary number of strongly normalising lambda-terms, always produces strongly normalising lambda-terms. This proof uses a finitary logical description of the model by means of intersection types. This answers an open question stated by Dezani, Honsell and Motohama","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134239722","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

Temporal Logics and Model Checking for Fairly Correct Systems 相当正确系统的时间逻辑和模型检验

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.49

Daniele Varacca, H. Völzer

{"title":"Temporal Logics and Model Checking for Fairly Correct Systems","authors":"Daniele Varacca, H. Völzer","doi":"10.1109/LICS.2006.49","DOIUrl":"https://doi.org/10.1109/LICS.2006.49","url":null,"abstract":"We motivate and study a generic relaxation of correctness of reactive and concurrent systems with respect to a temporal specification. We define a system to be fairly correct if there exists a fairness assumption under which it satisfies its specification. Equivalently, a system is fairly correct if the set of runs satisfying the specification is large from a topological point of view, i.e., it is a co-meager set. We compare topological largeness with its more popular sibling, probabilistic largeness, where a specification is probabilistically large if the set of runs satisfying the specification has probability 1. We show that topological and probabilistic largeness of omega-regular specifications coincide for bounded Borel measures on finite-state systems. As a corollary, we show that, for specifications expressed in LTL or by Buchi automata, checking that a finite-state system is fairly correct has the same complexity as checking that it is correct. Finally we study variants of the logics CTL and CTL*, where the 'for all runs' quantifier is replaced by a 'for a large set of runs' quantifier. We show that the model checking complexity for these variants is the same as for the original logics","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124510198","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

Provable Implementations of Security Protocols 安全协议的可证明的实现

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.43

A. Gordon

引用次数: 11

Head Normal Form Bisimulation for Pairs and the lambdamu-Calculus 头部范式双模拟对和lambdamu -微积分

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.29

Søren B. Lassen

{"title":"Head Normal Form Bisimulation for Pairs and the lambdamu-Calculus","authors":"Søren B. Lassen","doi":"10.1109/LICS.2006.29","DOIUrl":"https://doi.org/10.1109/LICS.2006.29","url":null,"abstract":"Bohm tree equivalence up to possibly infinite eta expansion for the pure lambda-calculus can be characterized as a bisimulation equivalence. We call this co-inductive syntactic theory extensional head normal form bisimilarity and in this paper we extend it to the lambdaFP-calculus (the lambda-calculus with functional and surjective pairing) and to two untyped variants of Parigot's lambdamu-calculus. We relate the extensional head normal form bisimulation theories for the different calculi via Fujita's extensional CPS transform into the lambdaFP-calculus. We prove that extensional hnf bisimilarity is fully abstract for the pure lambda-calculus by a co-inductive reformulation of Barendregt's proof for Bohm tree equivalence up to possibly infinite eta expansion. The proof uses the so-called Bohm-out technique from Bohm's proof of the separation property for the lambda-calculus. Moreover, we extend the full abstraction result to extensional hnf bisimilarity for the lambdaFP-calculus. For the \"standard\" lambdamu-calculus, the separation property fails, as shown by David and Py, and for the same reason extensional hnf bisimilarity is not fully abstract. However, an \"extended\" variant of the lambdamu-calculus satisfies the separation property, as shown by Saurin, and we show that extensional hnf bisimilarity is fully abstract for this extended lambdamu-calculus","PeriodicalId":367210,"journal":{"name":"21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127745102","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}

引用次数: 16

Bounds in w-Regularity w正则性的界

21st Annual IEEE Symposium on Logic in Computer Science (LICS'06) Pub Date : 2006-08-12 DOI: 10.1109/LICS.2006.17

M. Bojanczyk, Thomas Colcombet

引用次数: 65