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

[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science最新文献

筛选
英文 中文
Specifications in software development 软件开发中的规范
[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science Pub Date : 1992-06-22 DOI: 10.1109/LICS.1992.185525
Jeannette M. Wing
{"title":"Specifications in software development","authors":"Jeannette M. Wing","doi":"10.1109/LICS.1992.185525","DOIUrl":"https://doi.org/10.1109/LICS.1992.185525","url":null,"abstract":"Summary form only given. Various kinds of specifications used during software development are presented through examples. The focus is on the practical aspects of the nature and use of formal specifications. Some open research problems that should be of particular interest are mentioned.<<ETX>>","PeriodicalId":6412,"journal":{"name":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","volume":"64 1","pages":"112-"},"PeriodicalIF":0.0,"publicationDate":"1992-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90356135","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}
引用次数: 4
Zero-one laws for modal logic 模态逻辑的0 - 1定律
[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science Pub Date : 1992-06-22 DOI: 10.1109/LICS.1992.185549
Joseph Y. Halpern, B. Kapron
{"title":"Zero-one laws for modal logic","authors":"Joseph Y. Halpern, B. Kapron","doi":"10.1109/LICS.1992.185549","DOIUrl":"https://doi.org/10.1109/LICS.1992.185549","url":null,"abstract":"It is shown that a 0-1 law holds for propositional modal logic, both for structure validity and for frame validity. In the case of structure validity, the result follows easily from the well-known 0-1 law for first-order logic. However, the proof gives considerably more information. It leads to an elegant axiomatization for almost-sure structure validity, and sharper complexity bounds. Since frame validity can be reduced to a II/sub 1//sup 1/ formula, the 0-1 law for frame validity helps delineate when 0-1 laws exist for second-order logics.<<ETX>>","PeriodicalId":6412,"journal":{"name":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","volume":"26 1","pages":"369-380"},"PeriodicalIF":0.0,"publicationDate":"1992-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81018017","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
Random worlds and maximum entropy 随机世界和最大熵
[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science Pub Date : 1992-06-22 DOI: 10.1109/LICS.1992.185516
Adam J. Grove, Joseph Y. Halpern, D. Koller
{"title":"Random worlds and maximum entropy","authors":"Adam J. Grove, Joseph Y. Halpern, D. Koller","doi":"10.1109/LICS.1992.185516","DOIUrl":"https://doi.org/10.1109/LICS.1992.185516","url":null,"abstract":"Given a knowledge base theta containing first-order and statistical facts, a principled method, called the random-worlds method, for computing a degree of belief that some phi holds given theta is considered. If the domain has size N, then one can consider all possible worlds with domain (1, . . ., N) that satisfy theta and compute the fraction of them in which phi is true. The degree of belief is defined as the asymptotic value of this fraction as N grows large. It is shown that when the vocabulary underlying phi and theta uses constants and unary predicates only, one can in many cases use a maximum entropy computation to compute the degree of belief. Making precise exactly when a maximum entropy calculation can be used turns out to be subtle. The subtleties are explored, and sufficient conditions that cover many of the cases that occur in practice are provided.<<ETX>>","PeriodicalId":6412,"journal":{"name":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","volume":"48 1","pages":"22-33"},"PeriodicalIF":0.0,"publicationDate":"1992-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89567527","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}
引用次数: 109
Third order matching is decidable 三阶匹配是可确定的
[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science Pub Date : 1992-06-22 DOI: 10.1109/LICS.1992.185514
Gilles Dowek
{"title":"Third order matching is decidable","authors":"Gilles Dowek","doi":"10.1109/LICS.1992.185514","DOIUrl":"https://doi.org/10.1109/LICS.1992.185514","url":null,"abstract":"The problem of determining whether a term is an instance of another in the simply typed lambda -calculus, i.e. of solving the equation a=b where a and b are simply typed lambda -terms and b is ground, is addressed. An algorithm that decides whether a matching problem in which all the variables are at most third order has a solution is given. The main idea is that if the problem a=b has a solution, then it also has a solution whose depth is bounded by some integer s depending only on the problem a=b, so a simple enumeration of the substitutions whose depth is bounded by s gives a decision algorithm. This result can also be used to bound the depth of the search tree in Huet's semi-decision algorithm and thus to turn it into an always-terminating algorithm. The problems that occur in trying to generalize the proof given to higher-order matching are discussed.<<ETX>>","PeriodicalId":6412,"journal":{"name":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","volume":"11 1","pages":"2-10"},"PeriodicalIF":0.0,"publicationDate":"1992-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80243687","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
Cutting planes and constant depth Frege proofs 裁切平面和恒深样板
[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science Pub Date : 1992-06-22 DOI: 10.1109/LICS.1992.185542
P. Clote
{"title":"Cutting planes and constant depth Frege proofs","authors":"P. Clote","doi":"10.1109/LICS.1992.185542","DOIUrl":"https://doi.org/10.1109/LICS.1992.185542","url":null,"abstract":"The cutting planes refutation system for propositional logic is an extension of resolution and is based on showing the nonexistence of solutions for families of integer linear inequalities. The author defines a modified system of cutting planes with limited extension and shows that this system can polynomially simulate constant-depth Frege proof systems. The principal tool to establish this result is an effective version of cut elimination for modified cutting planes with limited extension. Thus, within a polynomial factor, one can simulate classical propositional logic proofs using modus ponens by refutation-style proofs, provided the formula depth is bounded by a constant. Propositional versions of the Paris-Harrington theorem, Kanamori-McAloon theorem, and variants are proposed as possible candidates for combinatorial tautologies that may require exponential-size cutting planes and Frege proofs.<<ETX>>","PeriodicalId":6412,"journal":{"name":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","volume":"22 1","pages":"296-307"},"PeriodicalIF":0.0,"publicationDate":"1992-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84947936","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
Observable algorithms on concrete data structures 具体数据结构上的可观察算法
[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science Pub Date : 1992-06-22 DOI: 10.1109/LICS.1992.185554
P. Curien
{"title":"Observable algorithms on concrete data structures","authors":"P. Curien","doi":"10.1109/LICS.1992.185554","DOIUrl":"https://doi.org/10.1109/LICS.1992.185554","url":null,"abstract":"A contribution to the investigation of sequentiality and full abstraction for sequential programming languages, focusing on the language PCF, is presented. Ideas of R. Cartwright and M. Felleisen (1992) on observable sequentiality are fit into the framework of concrete data structures and sequential algorithms. An extension of the category of sequential algorithms is shown to provide an order-extensional model of PCF. The key to this is the presence of errors in the semantic domains. The model of observable algorithms is fully abstract for an extension of PCF. This extension has errors too, as well as a control operation catch as found in languages such as Scheme or CommonLisp.<<ETX>>","PeriodicalId":6412,"journal":{"name":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","volume":"55 1","pages":"432-443"},"PeriodicalIF":0.0,"publicationDate":"1992-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83744550","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}
引用次数: 21
The Church-Rosser property for beta eta -reduction in typed lambda -calculi 类型化λ -演算中β -约简的Church-Rosser性质
[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science Pub Date : 1992-06-22 DOI: 10.1109/LICS.1992.185556
H. Geuvers
{"title":"The Church-Rosser property for beta eta -reduction in typed lambda -calculi","authors":"H. Geuvers","doi":"10.1109/LICS.1992.185556","DOIUrl":"https://doi.org/10.1109/LICS.1992.185556","url":null,"abstract":"The Church-Rosser property (CR) for pure type systems with beta eta -reduction is investigated. It is proved that CR (for beta eta ) on the well-typed terms of a fixed type holds, which is the maximum one can expect in view of Nederpelt's (1973) counterexample. The proof is given for a large class of pure type systems that contains, e.g., LF F, F omega , and the calculus of constructions.<<ETX>>","PeriodicalId":6412,"journal":{"name":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","volume":"49 1","pages":"453-460"},"PeriodicalIF":0.0,"publicationDate":"1992-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86454188","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}
引用次数: 22
Linear logic without boxes 无框线性逻辑
[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science Pub Date : 1992-06-22 DOI: 10.1109/LICS.1992.185535
Georges Gonthier, M. Abadi, J. Lévy
{"title":"Linear logic without boxes","authors":"Georges Gonthier, M. Abadi, J. Lévy","doi":"10.1109/LICS.1992.185535","DOIUrl":"https://doi.org/10.1109/LICS.1992.185535","url":null,"abstract":"J.-Y. Girard's original definition of proof nets for linear logic involves boxes. The box is the unit for erasing and duplicating fragments of proof nets. It imposes synchronization, limits sharing, and impedes a completely local view of computation. The authors describe an implementation of proof nets without boxes. Proof nets are translated into graphs of the sort used in optimal lambda -calculus implementations; computation is performed by simple graph rewriting. This graph implementation helps in understanding optimal reductions in the lambda -calculus and in the various programming languages inspired by linear logic.<<ETX>>","PeriodicalId":6412,"journal":{"name":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","volume":"21 1","pages":"223-234"},"PeriodicalIF":0.0,"publicationDate":"1992-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82733756","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}
引用次数: 95
Compiler verification in LF LF中的编译器验证
[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science Pub Date : 1992-06-22 DOI: 10.1109/LICS.1992.185552
J. Hannan, F. Pfenning
{"title":"Compiler verification in LF","authors":"J. Hannan, F. Pfenning","doi":"10.1109/LICS.1992.185552","DOIUrl":"https://doi.org/10.1109/LICS.1992.185552","url":null,"abstract":"A methodology for the verification of compiler correctness based on the LF logical framework as realized within the Elf programming language is presented. This technique is used to specify, implement, and verify a compiler from a simple functional programming language to a variant of the Categorical Abstract Machine (CAM).<<ETX>>","PeriodicalId":6412,"journal":{"name":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","volume":"34 1","pages":"407-418"},"PeriodicalIF":0.0,"publicationDate":"1992-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73383439","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}
引用次数: 85
References, local variables and operational reasoning 引用，局部变量和操作推理
[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science Pub Date : 1992-06-22 DOI: 10.1109/LICS.1992.185532
Ian A. Mason, C. Talcott
{"title":"References, local variables and operational reasoning","authors":"Ian A. Mason, C. Talcott","doi":"10.1109/LICS.1992.185532","DOIUrl":"https://doi.org/10.1109/LICS.1992.185532","url":null,"abstract":"A.R. Meyer and K. Sieber (Proc. 15th ACM. Symp. on Principles of Programming Languages, 1988, p.191-208) gave a series of examples of programs that are operationally equivalent (according to the intended semantics of block-structured Algol-like programs) but are not given equivalent denotations in traditional denotational semantics. They propose various modifications to the denotational semantics that solve some of these discrepancies, but not all. The present authors approach the same problem, but from an operational rather than a denotational perspective. They present the first-order part of a new logic for reasoning about programs, and they use this logic to prove the equivalence of the Meyer-Sieber examples.<<ETX>>","PeriodicalId":6412,"journal":{"name":"[1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science","volume":"23 1","pages":"186-197"},"PeriodicalIF":0.0,"publicationDate":"1992-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78545614","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}
引用次数: 51
首页 上一页 下一页 尾页
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学术官方微信