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

Logic of Programs最新文献

筛选
英文 中文
Computer Aider Reasoning 计算机辅助推理
Logic of Programs Pub Date : 1985-06-17 DOI: 10.1007/3-540-15648-8_30
A. Trybulec, H. A. Blair
{"title":"Computer Aider Reasoning","authors":"A. Trybulec, H. A. Blair","doi":"10.1007/3-540-15648-8_30","DOIUrl":"https://doi.org/10.1007/3-540-15648-8_30","url":null,"abstract":"","PeriodicalId":264882,"journal":{"name":"Logic of Programs","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123957803","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}
引用次数: 20
Lambda Calculus with Constrained Types (Extended Abstract) 约束类型λ演算(扩展抽象)
Logic of Programs Pub Date : 1985-06-17 DOI: 10.1007/3-540-15648-8_3
V. Tannen, A. Meyer
{"title":"Lambda Calculus with Constrained Types (Extended Abstract)","authors":"V. Tannen, A. Meyer","doi":"10.1007/3-540-15648-8_3","DOIUrl":"https://doi.org/10.1007/3-540-15648-8_3","url":null,"abstract":"","PeriodicalId":264882,"journal":{"name":"Logic of Programs","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125031216","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}
引用次数: 20
Automata, Tableaux and Temporal Logics (Extended Abstract) 自动机、表与时间逻辑(扩展摘要)
Logic of Programs Pub Date : 1985-06-17 DOI: 10.1007/3-540-15648-8_7
E. Emerson
{"title":"Automata, Tableaux and Temporal Logics (Extended Abstract)","authors":"E. Emerson","doi":"10.1007/3-540-15648-8_7","DOIUrl":"https://doi.org/10.1007/3-540-15648-8_7","url":null,"abstract":"","PeriodicalId":264882,"journal":{"name":"Logic of Programs","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133534076","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}
引用次数: 105
Proving Fairness of Schedulers 证明调度程序的公平性
Logic of Programs Pub Date : 1985-06-17 DOI: 10.1007/3-540-15648-8_23
R. Ramanujam, Kamal Lodaya
{"title":"Proving Fairness of Schedulers","authors":"R. Ramanujam, Kamal Lodaya","doi":"10.1007/3-540-15648-8_23","DOIUrl":"https://doi.org/10.1007/3-540-15648-8_23","url":null,"abstract":"","PeriodicalId":264882,"journal":{"name":"Logic of Programs","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122064099","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}
引用次数: 3
Some Constructions for Order-Theoretic Models of Concurrency 并行序理论模型的若干构造
Logic of Programs Pub Date : 1985-06-17 DOI: 10.1007/3-540-15648-8_22
V. Pratt
{"title":"Some Constructions for Order-Theoretic Models of Concurrency","authors":"V. Pratt","doi":"10.1007/3-540-15648-8_22","DOIUrl":"https://doi.org/10.1007/3-540-15648-8_22","url":null,"abstract":"","PeriodicalId":264882,"journal":{"name":"Logic of Programs","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122164251","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
The Reasoning Powers of Burstall's (Modal Logic) and Pnueli's (Temporal Logic) Program Verification Methods Burstall(模态逻辑)和Pnueli(时间逻辑)程序验证方法的推理能力
Logic of Programs Pub Date : 1985-06-17 DOI: 10.1007/3-540-15648-8_24
I. Sain
{"title":"The Reasoning Powers of Burstall's (Modal Logic) and Pnueli's (Temporal Logic) Program Verification Methods","authors":"I. Sain","doi":"10.1007/3-540-15648-8_24","DOIUrl":"https://doi.org/10.1007/3-540-15648-8_24","url":null,"abstract":"","PeriodicalId":264882,"journal":{"name":"Logic of Programs","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131562228","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}
引用次数: 15
Second-Order Logical Relations (Extended Abstract) 二阶逻辑关系(扩展抽象)
Logic of Programs Pub Date : 1985-06-17 DOI: 10.1007/3-540-15648-8_18
John C. Mitchell, A. Meyer
{"title":"Second-Order Logical Relations (Extended Abstract)","authors":"John C. Mitchell, A. Meyer","doi":"10.1007/3-540-15648-8_18","DOIUrl":"https://doi.org/10.1007/3-540-15648-8_18","url":null,"abstract":"","PeriodicalId":264882,"journal":{"name":"Logic of Programs","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132296643","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
Continuation Semantics in Typed Lambda-Calculi (Summary) 类型化lambda - calculus中的延拓语义(综述)
Logic of Programs Pub Date : 1985-06-17 DOI: 10.1007/3-540-15648-8_17
A. Meyer, M. Wand
{"title":"Continuation Semantics in Typed Lambda-Calculi (Summary)","authors":"A. Meyer, M. Wand","doi":"10.1007/3-540-15648-8_17","DOIUrl":"https://doi.org/10.1007/3-540-15648-8_17","url":null,"abstract":"","PeriodicalId":264882,"journal":{"name":"Logic of Programs","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132699277","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}
引用次数: 116
Proving Termination of Prolog Programs 证明终止Prolog程序
Logic of Programs Pub Date : 1985-06-17 DOI: 10.1007/3-540-15648-8_8
N. Francez, O. Grumberg, Shmuel Katz, A. Pnueli
{"title":"Proving Termination of Prolog Programs","authors":"N. Francez, O. Grumberg, Shmuel Katz, A. Pnueli","doi":"10.1007/3-540-15648-8_8","DOIUrl":"https://doi.org/10.1007/3-540-15648-8_8","url":null,"abstract":"","PeriodicalId":264882,"journal":{"name":"Logic of Programs","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129882370","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}
引用次数: 28
Fixpoints and Program Looping: Reductions form the Propositional MU-Calculus into Propositional Dynamic Logics of Looping 不动点与程序循环:从命题mu -演算到命题动态循环逻辑的约简
Logic of Programs Pub Date : 1985-06-17 DOI: 10.1007/3-540-15648-8_27
Robert S. Streett
{"title":"Fixpoints and Program Looping: Reductions form the Propositional MU-Calculus into Propositional Dynamic Logics of Looping","authors":"Robert S. Streett","doi":"10.1007/3-540-15648-8_27","DOIUrl":"https://doi.org/10.1007/3-540-15648-8_27","url":null,"abstract":"","PeriodicalId":264882,"journal":{"name":"Logic of Programs","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130503134","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}
引用次数: 8
首页 上一页 下一页 尾页
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学术官方微信