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

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)最新文献

筛选
英文 中文
Region analysis and the polymorphic lambda calculus 区域分析和多态λ演算
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) Pub Date : 1999-07-02 DOI: 10.1109/LICS.1999.782594
A. Banerjee, N. Heintze, J. Riecke
{"title":"Region analysis and the polymorphic lambda calculus","authors":"A. Banerjee, N. Heintze, J. Riecke","doi":"10.1109/LICS.1999.782594","DOIUrl":"https://doi.org/10.1109/LICS.1999.782594","url":null,"abstract":"We show how to translate the region calculus of M. Tofte and J.P. Talpin (1997), a typed lambda calculus that can statically delimit the lifetimes of objects, into an extension of the polymorphic lambda calculus called F/sub #/. We give a denotational semantics of F/sub #/, and use it to give a simple and abstract proof of the correctness of memory deallocation.","PeriodicalId":352531,"journal":{"name":"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129457050","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}
引用次数: 33
Two-variable descriptions of regularity 正则性的双变量描述
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) Pub Date : 1999-07-02 DOI: 10.1109/LICS.1999.782580
E. Grädel, Eric Rosen
{"title":"Two-variable descriptions of regularity","authors":"E. Grädel, Eric Rosen","doi":"10.1109/LICS.1999.782580","DOIUrl":"https://doi.org/10.1109/LICS.1999.782580","url":null,"abstract":"We prove that the class of all languages that are definable in /spl Sigma//sub 1//sup 1/(FO/sup 2/), that is, in (non-monadic) existential second-order logic with only two first-order variables, coincides with the regular languages. This provides an alternative logical description of regularity to both the traditional one in terms of monadic second-order logic, due to Buchi and Trakhtenbrot, and the more recent ones in terms of prefix fragments of /spl Sigma//sub 1//sup 1/, due to Eiter, Gottlob and Gurevich. Our result extends to more general settings than words. Indeed, definability in /spl Sigma//sub 1//sup 1/(FO/sup 2/) coincides with recognizability by appropriate notions of automata on a large class of objects, including /spl omega/-words, trees, pictures and, more generally, all weakly deterministic, triangle-free transition systems.","PeriodicalId":352531,"journal":{"name":"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)","volume":"317 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116366301","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
Some computational properties of intersection types 交型的一些计算性质
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) Pub Date : 1999-07-02 DOI: 10.1109/LICS.1999.782598
A. Bucciarelli, Silvia De Lorenzis, A. Piperno, Ivano Salvo
{"title":"Some computational properties of intersection types","authors":"A. Bucciarelli, Silvia De Lorenzis, A. Piperno, Ivano Salvo","doi":"10.1109/LICS.1999.782598","DOIUrl":"https://doi.org/10.1109/LICS.1999.782598","url":null,"abstract":"This paper presents a new method for comparing computation-properties of /spl lambda/-terms typeable with intersection types with respect to terms typeable with Curry types. In particular, strong normalization and /spl lambda/-definability are investigated. A translation is introduced from intersection typing derivations to Curry typeable terms; the main feature of the proposed technique is that the translation is preserved by /spl beta/-reduction. This allows to simulate a computation starting from a term typeable in the intersection discipline by means of a computation starting from a simply typeable term. Our approach naturally leads to prove strong normalization in the intersection system by means of purely syntactical techniques. In addition, the presented method enables us to give a proof of a conjecture proposed by Leivant in 1990, namely that all functions uniformly definable using intersection types are already definable using Curry types.","PeriodicalId":352531,"journal":{"name":"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122922052","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}
引用次数: 14
Correctness of multiplicative proof nets is linear 乘法证明网的正确性是线性的
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) Pub Date : 1999-07-02 DOI: 10.1109/LICS.1999.782640
S. Guerrini
{"title":"Correctness of multiplicative proof nets is linear","authors":"S. Guerrini","doi":"10.1109/LICS.1999.782640","DOIUrl":"https://doi.org/10.1109/LICS.1999.782640","url":null,"abstract":"We reformulate Danos contractibility criterion in terms of a sort of unification. As for term unification, a direct implementation of the unification criterion leads to a quasi-linear algorithm. Linearity is obtained after observing that the disjoint-set union-find at the core of the unification criterion is a special case of union-find with a real linear time solution.","PeriodicalId":352531,"journal":{"name":"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131982800","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}
引用次数: 60
Proof techniques for cryptographic processes 密码过程的证明技术
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) Pub Date : 1999-07-02 DOI: 10.1109/LICS.1999.782608
Michele Boreale, R. Nicola, R. Pugliese
{"title":"Proof techniques for cryptographic processes","authors":"Michele Boreale, R. Nicola, R. Pugliese","doi":"10.1109/LICS.1999.782608","DOIUrl":"https://doi.org/10.1109/LICS.1999.782608","url":null,"abstract":"Contextual equivalences for cryptographic process calculi can be used to reason about correctness of protocols, but their definition suffers from quantification over all possible contexts. Here, we focus on two such equivalences, may-testing and barbed equivalence, and investigate tractable proof methods for them. To this aim, we develop an 'environment-sensitive' labelled transition system, where transitions are constrained by the knowledge the environment has of names and keys. On top of the new transition system, a trace equivalence and a co-inductive weak bisimulation equivalence are defined, both of which avoid quantification over contexts. Our main results are soundness of trace semantics and of weak bisimulation with respect to may-testing and barbed equivalence, respectively. This leads to more direct proof methods for equivalence checking. The use of such methods is illustrated via a few examples concerning implementation of secure channels by means of encrypted public channels. We also consider a variant of the labelled transition system that gives completeness, but is less handy to use.","PeriodicalId":352531,"journal":{"name":"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)","volume":"5 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131652459","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}
引用次数: 142
Entailment of atomic set constraints is PSPACE-complete 原子集约束的蕴涵是pspace完备的
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) Pub Date : 1999-07-02 DOI: 10.1109/LICS.1999.782623
Joachim Niehren, Martin Müller, J. Talbot
{"title":"Entailment of atomic set constraints is PSPACE-complete","authors":"Joachim Niehren, Martin Müller, J. Talbot","doi":"10.1109/LICS.1999.782623","DOIUrl":"https://doi.org/10.1109/LICS.1999.782623","url":null,"abstract":"The complexity of set constraints has been extensively studied over the last years and was often found quite high. At the lower end of expressiveness, there are atomic set constraints which are conjunctions of inclusions t/sub 1//spl sube/t/sub 2/ between first-order terms without set operators. It is well-known that satisfiability of atomic set constraints can be tested in cubic time. Also, entailment of atomic set constraints has been claimed decidable in polynomial time. We refute this claim. We show that entailment between atomic set constraints can express validity of quantified boolean formulas and is this PSPACE hard. For infinite signatures, we also present a PSPACE-algorithm for solving atomic set constraints with negation. This proves that entailment of atomic set constraints is PSPACE-complete for infinite signatures. In case of finite signatures, this problem is even DEXPTIME-hard.","PeriodicalId":352531,"journal":{"name":"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126694062","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
The two-variable guarded fragment with transitive relations 具有传递关系的双变量保护片段
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) Pub Date : 1999-07-02 DOI: 10.1109/LICS.1999.782582
H. Ganzinger, C. Meyer, Margus Veanes
{"title":"The two-variable guarded fragment with transitive relations","authors":"H. Ganzinger, C. Meyer, Margus Veanes","doi":"10.1109/LICS.1999.782582","DOIUrl":"https://doi.org/10.1109/LICS.1999.782582","url":null,"abstract":"We consider the restriction of the guarded fragment to the two-variable case where, in addition, binary relations may be specified as transitive. We show that (i) this very restricted form of the guarded fragment without equality is undecidable and that (ii) when allowing non-unary relations to occur only in guards, the logic becomes decidable. The latter subclass of the guarded fragments the one that occurs naturally when translating multi-modal logics of the type Kg/sub 4/ S/sub 4/ or S5 into first-order logic. We also show that the loosely guarded fragment without equality and with a single transitive relation is undecidable.","PeriodicalId":352531,"journal":{"name":"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121446841","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}
引用次数: 99
A fragment calculus-towards a model of separate compilation, linking and binary compatibility 片段演算——走向独立编译、链接和二进制兼容的模型
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) Pub Date : 1999-07-02 DOI: 10.1109/LICS.1999.782606
S. Drossopoulou, S. Eisenbach, D. Wragg
{"title":"A fragment calculus-towards a model of separate compilation, linking and binary compatibility","authors":"S. Drossopoulou, S. Eisenbach, D. Wragg","doi":"10.1109/LICS.1999.782606","DOIUrl":"https://doi.org/10.1109/LICS.1999.782606","url":null,"abstract":"We propose a calculus describing compilation and linking in terms of operations on fragments, i.e. compilation units, without reference to their specific contents. We believe this calculus faithfully reflects the situation within modern programming systems. Binary compatibility in Java prescribes conditions under which modification of fragments does not necessitate recompilation of importing fragments. We apply our calculus to formalize binary compatibility, and demonstrate that several interpretations of the language specification are possible, each with different ramifications. We choose a particular interpretation, justify our choice, formulate and prove properties important for language designers and code library developers.","PeriodicalId":352531,"journal":{"name":"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131934032","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}
引用次数: 52
Towards a theory of bisimulation for local names 对地名的双模拟理论的探讨
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) Pub Date : 1999-07-02 DOI: 10.1109/LICS.1999.782586
A. Jeffrey, J. Rathke
{"title":"Towards a theory of bisimulation for local names","authors":"A. Jeffrey, J. Rathke","doi":"10.1109/LICS.1999.782586","DOIUrl":"https://doi.org/10.1109/LICS.1999.782586","url":null,"abstract":"A.M. Pitts and I.D.B. Stark (1998) have proposed the v-calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model based on logical relations, but left completeness as an open problem. In this paper, we develop a complete model based on bisimulation for a labelled transition system semantics. We show that bisimulation is complete, but not sound, for the v-calculus. We also show that by adding assignment to the v-calculus, bisimulation becomes sound and complete. The analysis used to obtain this result illuminates the difficulties involved in finding fully abstract models for v-calculus proper.","PeriodicalId":352531,"journal":{"name":"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130135007","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}
引用次数: 68
Logics with counting, auxiliary relations, and lower bounds for invariant queries 具有计数、辅助关系和不变查询下界的逻辑
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) Pub Date : 1999-07-02 DOI: 10.1109/LICS.1999.782626
L. Libkin
{"title":"Logics with counting, auxiliary relations, and lower bounds for invariant queries","authors":"L. Libkin","doi":"10.1109/LICS.1999.782626","DOIUrl":"https://doi.org/10.1109/LICS.1999.782626","url":null,"abstract":"We study the expressive power of counting logics in the presence of auxiliary relations such as orders and pre-orders. The simplest such logic, first-order with counting, captures the complexity class TC/sup 0/ over ordered structures. We also consider first-order logic with arbitrary unary quantifiers, and infinitary extensions. The main result of the paper is that all the counting logics above, in the presence of pre-orders that are almost-everywhere linear orders, exhibit a very tame behavior normally associated with first-order properties of unordered structures. This is in sharp contrast with the expressiveness of these logics in the presence of linear orders: such a tame behavior is not the case even for first-order logic with counting, and the most powerful logic we consider can express every property of ordered structures. The results attest to the difficulty of proving separation results for the ordered case, in particular, to proving the separation of TC from NP. To prove the main results, we use locality techniques from finite-model theory, modifying the main notions of locality along the way.","PeriodicalId":352531,"journal":{"name":"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121232476","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}
引用次数: 6
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信