J. Log. Algebraic Methods Program.最新文献

筛选
英文 中文
Communicating by compatibility 通过兼容性进行通信
J. Log. Algebraic Methods Program. Pub Date : 2008-04-01 DOI: 10.1016/j.jlap.2007.09.001
D. Prandi, C. Priami, P. Quaglia
{"title":"Communicating by compatibility","authors":"D. Prandi, C. Priami, P. Quaglia","doi":"10.1016/j.jlap.2007.09.001","DOIUrl":"https://doi.org/10.1016/j.jlap.2007.09.001","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"118077869","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}
引用次数: 12
Proof optimization for partial redundancy elimination 部分冗余消除的证明优化
J. Log. Algebraic Methods Program. Pub Date : 2008-01-07 DOI: 10.1145/1328408.1328422
Ando Saabas, Tarmo Uustalu
{"title":"Proof optimization for partial redundancy elimination","authors":"Ando Saabas, Tarmo Uustalu","doi":"10.1145/1328408.1328422","DOIUrl":"https://doi.org/10.1145/1328408.1328422","url":null,"abstract":"Partial redundancy elimination is a subtle optimization which performs common subexpression elimination and expression motion at the same time. In this paper, we use it as an example to promote and demonstrate the scalability of the technology of proof optimization. By this we mean automatic transformation of a given program's Hoare logic proof of functional correctness or resource usage into one of the optimized program, guided by a type-derivation representation of the result of the underlying dataflow analyses. A proof optimizer is a useful tool for the producer's side in a natural proof-carrying code scenario where programs are proved correct prior to optimizing compilation before transmission to the consumer.\u0000 We present a type-systematic description of the underlying analyses and of the optimization for the W<scp>hile</scp> language, demonstrate that the optimization is semantically sound and improving in a formulation using type-indexed relations, and then show that these arguments can be transferred to mechanical transformations of functional correctness/resource usage proofs in Hoare logics. For the improvement part, we instrument the standard semantics and Hoare logic so that evaluations of expressions become a resource.","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130438870","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}
引用次数: 12
Algebraic models of behaviour and correctness of SMT and CMT processors SMT和CMT处理器行为的代数模型及其正确性
J. Log. Algebraic Methods Program. Pub Date : 2007-11-01 DOI: 10.1016/j.jlap.2007.07.001
N. Harman
{"title":"Algebraic models of behaviour and correctness of SMT and CMT processors","authors":"N. Harman","doi":"10.1016/j.jlap.2007.07.001","DOIUrl":"https://doi.org/10.1016/j.jlap.2007.07.001","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120408122","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
An efficient abstract machine for Safe Ambients 一种高效的安全环境抽象机
J. Log. Algebraic Methods Program. Pub Date : 2007-04-01 DOI: 10.1016/j.jlap.2007.02.003
D. Hirschkoff, D. Pous, D. Sangiorgi
{"title":"An efficient abstract machine for Safe Ambients","authors":"D. Hirschkoff, D. Pous, D. Sangiorgi","doi":"10.1016/j.jlap.2007.02.003","DOIUrl":"https://doi.org/10.1016/j.jlap.2007.02.003","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"119905037","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
Universality and semicomputability for nondeterministic programming languages over abstract algebras 抽象代数上非确定性编程语言的通用性和半可计算性
J. Log. Algebraic Methods Program. Pub Date : 2007-03-01 DOI: 10.1016/j.jlap.2006.09.001
Wei Jiang, Y. Wang, J. Zucker
{"title":"Universality and semicomputability for nondeterministic programming languages over abstract algebras","authors":"Wei Jiang, Y. Wang, J. Zucker","doi":"10.1016/j.jlap.2006.09.001","DOIUrl":"https://doi.org/10.1016/j.jlap.2006.09.001","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"118461070","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
Kleene under a modal demonic star Kleene在一个模态恶魔星下
J. Log. Algebraic Methods Program. Pub Date : 2006-03-31 DOI: 10.1016/j.jlap.2005.04.006
J. Desharnais, B. Möller, F. Tchier
{"title":"Kleene under a modal demonic star","authors":"J. Desharnais, B. Möller, F. Tchier","doi":"10.1016/j.jlap.2005.04.006","DOIUrl":"https://doi.org/10.1016/j.jlap.2005.04.006","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117641317","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}
引用次数: 19
A logic of reachable patterns in linked data-structures 链接数据结构中可达模式的逻辑
J. Log. Algebraic Methods Program. Pub Date : 2006-03-25 DOI: 10.1007/11690634_7
G. Yorsh, A. Rabinovich, Shmuel Sagiv, A. Meyer, A. Bouajjani
{"title":"A logic of reachable patterns in linked data-structures","authors":"G. Yorsh, A. Rabinovich, Shmuel Sagiv, A. Meyer, A. Bouajjani","doi":"10.1007/11690634_7","DOIUrl":"https://doi.org/10.1007/11690634_7","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121501062","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}
引用次数: 80
De Bruijn's syntax and reductional behaviour of lambda-terms: the typed case De Bruijn的语法和lambda项的约化行为:类型化的情况
J. Log. Algebraic Methods Program. Pub Date : 2005-02-01 DOI: 10.1016/j.jlap.2004.01.008
Fairouz Kamareddine, Roel Bloo
{"title":"De Bruijn's syntax and reductional behaviour of lambda-terms: the typed case","authors":"Fairouz Kamareddine, Roel Bloo","doi":"10.1016/j.jlap.2004.01.008","DOIUrl":"https://doi.org/10.1016/j.jlap.2004.01.008","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"119986375","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}
引用次数: 5
Guest editors' introduction: Special issue on Probabilistic Techniques for the Design and Analysis of Systems 客座编辑介绍:关于系统设计和分析的概率技术的特刊
J. Log. Algebraic Methods Program. Pub Date : 2003-05-01 DOI: 10.1016/S1567-8326(02)00064-4
P. D’Argenio, J. Baeten
{"title":"Guest editors' introduction: Special issue on Probabilistic Techniques for the Design and Analysis of Systems","authors":"P. D’Argenio, J. Baeten","doi":"10.1016/S1567-8326(02)00064-4","DOIUrl":"https://doi.org/10.1016/S1567-8326(02)00064-4","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117878160","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}
引用次数: 0
Syntax-directed model checking of sequential programs 顺序程序的语法导向模型检查
J. Log. Algebraic Methods Program. Pub Date : 2002-07-01 DOI: 10.1016/S1567-8326(02)00035-8
K. Yorav, O. Grumberg
{"title":"Syntax-directed model checking of sequential programs","authors":"K. Yorav, O. Grumberg","doi":"10.1016/S1567-8326(02)00035-8","DOIUrl":"https://doi.org/10.1016/S1567-8326(02)00035-8","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"118337912","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
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书