信息与控制最新文献

筛选
英文 中文
On relative completeness of Hoare logics 论霍尔逻辑的相对完备性
信息与控制 Pub Date : 1985-07-01 DOI: 10.1016/S0019-9958(85)80010-3
Michal Grabowski
{"title":"On relative completeness of Hoare logics","authors":"Michal Grabowski","doi":"10.1016/S0019-9958(85)80010-3","DOIUrl":"10.1016/S0019-9958(85)80010-3","url":null,"abstract":"<div><p>In this paper a generalization of a certain theorem of Lipton (“Proc. 18th IEEE Sympos. Found. of Comput Sci.” (1977), pp. 1–6) is presented. Namely, we show that for a wide class of programming languages the following holds: the set of all partial correctness assertions true in an expressive interpretation <em>I</em> is uniformly dedicable (in <em>I</em>) in the theory of <em>I</em> iff the halting problem is decidable for finite interpretations. In the effect we show that such limitations as effectiveness or Herbrand-definability of interpretation (they are relevant in the previous proofs) can be removed in the case of partial correctness.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"66 1","pages":"Pages 29-44"},"PeriodicalIF":0.0,"publicationDate":"1985-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80010-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77889541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
The complexity of cubical graphs 三次图的复杂性
信息与控制 Pub Date : 1985-07-01 DOI: 10.1016/S0019-9958(85)80012-7
Foto Afrati, Christos H. Papadimitriou , George Papageorgiou
{"title":"The complexity of cubical graphs","authors":"Foto Afrati,&nbsp;Christos H. Papadimitriou ,&nbsp;George Papageorgiou","doi":"10.1016/S0019-9958(85)80012-7","DOIUrl":"10.1016/S0019-9958(85)80012-7","url":null,"abstract":"<div><p>A graph is cubical if it is a subgraph of a hypercube; the dimension of the smallest such hypercube is the dimension of the graph. We show several results concerning this class of graphs. We use a characterization of cubical graphs in terms of edge coloring to show that the dimension of biconnected cubical graphs is at most half the number of nodes. We also show that telling whether a graph is cubical is NP-complete. Finally, we propose a heuristic for minimizing the dimension of trees, which yields an embedding of the tree in a hypercube of dimension at most the square of the true dimension of the tree.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"66 1","pages":"Pages 53-60"},"PeriodicalIF":0.0,"publicationDate":"1985-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80012-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91181693","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 23
Implicit data structures for weighted elements 加权元素的隐式数据结构
信息与控制 Pub Date : 1985-07-01 DOI: 10.1016/S0019-9958(85)80013-9
Greg N. Frederickson
{"title":"Implicit data structures for weighted elements","authors":"Greg N. Frederickson","doi":"10.1016/S0019-9958(85)80013-9","DOIUrl":"10.1016/S0019-9958(85)80013-9","url":null,"abstract":"<div><p>Several new data structures are presented for dictionaries containing elements with different weights (access probabilities). The structures use just one location in addition to those required for the values of the elements. The first structure supports a worst-case search time that is within a constant multiplicative factor of optimal, in terms of the rank of the weight of the desired element with respect to the multiset of weights. If the values of the elements that comprise the dictionary have been drawn from a uniform distribution, then a variation of this structure achieves average search times that are asymptotically very good. Similar results are established for data structures which handle the case in which the intervals between consecutive dictionary values also have access probabilities. Lower bounds are presented for the worst-case search complexity.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"66 1","pages":"Pages 61-82"},"PeriodicalIF":0.0,"publicationDate":"1985-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80013-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74317389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
A proof rule for fair termination of guarded commands 保护命令公平终止的证明规则
信息与控制 Pub Date : 1985-07-01 DOI: 10.1016/S0019-9958(85)80014-0
Orna Grumberg, Nissim Francez, Johann A. Makowsky, Willem P. de Roever
{"title":"A proof rule for fair termination of guarded commands","authors":"Orna Grumberg,&nbsp;Nissim Francez,&nbsp;Johann A. Makowsky,&nbsp;Willem P. de Roever","doi":"10.1016/S0019-9958(85)80014-0","DOIUrl":"10.1016/S0019-9958(85)80014-0","url":null,"abstract":"<div><p>We present a proof rule for fairly terminating guarded commands based on a well-foundedness argument. The rule is applied to several examples, and proved to be sound and (semantically) complete w.r.t. an operational semantics of computation trees. The rule is related to another rule suggested by Lehmann, Pnueli, and Stavi (<em>in</em> “Proc. Internat. Colloq. Automata Lang. and Programming, '81,” Acre, July 1981), by showing that the (semantic) completeness of the LPS-rule follows from the completeness or ours.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"66 1","pages":"Pages 83-102"},"PeriodicalIF":0.0,"publicationDate":"1985-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80014-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72481450","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 75
Unraveling k-page graphs 展开k页图
信息与控制 Pub Date : 1985-07-01 DOI: 10.1016/S0019-9958(85)80008-5
Ravi Kannan
{"title":"Unraveling k-page graphs","authors":"Ravi Kannan","doi":"10.1016/S0019-9958(85)80008-5","DOIUrl":"10.1016/S0019-9958(85)80008-5","url":null,"abstract":"<div><p>I show in this note that for any integer <em>k</em> and any <em>k</em> page graph <em>G</em>, there is an easily constructed 3-page graph <em>G</em>′ (called the unraveling of <em>G</em>) such that the minimum separator sizes of <em>G</em> and <em>G</em>′ are within a factor of <em>k</em> of each other. Further the maximum degree of a vertex of <em>G</em>′ is at most 2 plus the maximum degree of <em>G</em>.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"66 1","pages":"Pages 1-5"},"PeriodicalIF":0.0,"publicationDate":"1985-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80008-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84818244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Author index for volume 65 第65卷作者索引
信息与控制 Pub Date : 1985-05-01 DOI: 10.1016/S0019-9958(85)80006-1
{"title":"Author index for volume 65","authors":"","doi":"10.1016/S0019-9958(85)80006-1","DOIUrl":"https://doi.org/10.1016/S0019-9958(85)80006-1","url":null,"abstract":"","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"65 2","pages":"Page 216"},"PeriodicalIF":0.0,"publicationDate":"1985-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80006-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137307528","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Logical relations and the typed λ-calculus 逻辑关系与类型化λ演算
信息与控制 Pub Date : 1985-05-01 DOI: 10.1016/S0019-9958(85)80001-2
R. Statman
{"title":"Logical relations and the typed λ-calculus","authors":"R. Statman","doi":"10.1016/S0019-9958(85)80001-2","DOIUrl":"10.1016/S0019-9958(85)80001-2","url":null,"abstract":"","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"65 2","pages":"Pages 85-97"},"PeriodicalIF":0.0,"publicationDate":"1985-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80001-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83389550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 157
Sparse sets in NP-P: EXPTIME versus NEXPTIME NP-P中的稀疏集:EXPTIME与NEXPTIME
信息与控制 Pub Date : 1985-05-01 DOI: 10.1016/S0019-9958(85)80004-8
J. Hartmanis, N. Immerman, V. Sewelson
{"title":"Sparse sets in NP-P: EXPTIME versus NEXPTIME","authors":"J. Hartmanis,&nbsp;N. Immerman,&nbsp;V. Sewelson","doi":"10.1016/S0019-9958(85)80004-8","DOIUrl":"https://doi.org/10.1016/S0019-9958(85)80004-8","url":null,"abstract":"<div><p>This paper investigates the structural properties of sets in <em>NP-P</em> and shows that the computational difficulty of lower density sets in <em>NP</em> depends explicitly on the relations between higher deterministic and nondeterministic time-bounded complexity classes. The paper exploits the recently discovered <em>upward separation</em> method, which shows for example that there exist sparse sets in <em>NP-P</em> if and only if <em>EXPTIME ≠ NEXPTIME</em>. In addition, the paper uses relativization techniques to determine logical possibilities, limitations of these proof techniques, and exhibits one of the first natural structural differences between relativized <em>NP</em> and <em>CoNP</em>.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"65 2","pages":"Pages 158-181"},"PeriodicalIF":0.0,"publicationDate":"1985-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80004-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137307527","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic) 确定性和非确定性程序的可定义性(应用于一阶动态逻辑)
信息与控制 Pub Date : 1985-05-01 DOI: 10.1016/S0019-9958(85)80002-4
A.J. Kfoury
{"title":"Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)","authors":"A.J. Kfoury","doi":"10.1016/S0019-9958(85)80002-4","DOIUrl":"10.1016/S0019-9958(85)80002-4","url":null,"abstract":"<div><p>We make explicit a connection between the “unwind property” and first-order logics of programs. Using known results on the unwind property, we can then quickly compare various logics of programs. In Section 1, we give a sample of these comparative results, which are already known but established differently in this paper. In Sections 2 and 3, given an arbitrary deterministic regular program <em>S</em> (with or without parameterless recursive calls), we show how to construct a first-order structure where <em>S</em> will unwind. Based on this construction, we then prove that the logic of regular programs (with or without parameterless recursive calls) is more expressive than the logic of deterministic regular programs (with or without parameterless recursive calls, respectively).</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"65 2","pages":"Pages 98-121"},"PeriodicalIF":0.0,"publicationDate":"1985-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80002-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76515111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Semantic confluence tests and completion methods 语义融合测试和补全方法
信息与控制 Pub Date : 1985-05-01 DOI: 10.1016/S0019-9958(85)80005-X
David A. Plaisted
{"title":"Semantic confluence tests and completion methods","authors":"David A. Plaisted","doi":"10.1016/S0019-9958(85)80005-X","DOIUrl":"10.1016/S0019-9958(85)80005-X","url":null,"abstract":"<div><p>We present semantic methods for showing that a term-rewriting system is confluent. We also present methods for completing a given term-rewriting system to obtain an equivalent confluent system. These methods differ from the well-known and widely studied Knuth-Bendix method in that they emphasize semantics rather than syntax. Also, they often require more user interaction than the purely syntactic Knuth-Bendix method. The concept of “ground confluence” is discussed; methods for demonstrating ground confluence are also given. We give decision procedures for some sub-problems that arise in this method.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"65 2","pages":"Pages 182-215"},"PeriodicalIF":0.0,"publicationDate":"1985-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80005-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76151485","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 144
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学术官方微信