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

International Workshop/Symposium on Logic-based Program Synthesis and Transformation最新文献

筛选
英文 中文
Combining Static and Dynamic Contract Checking for Curry 结合Curry的静态和动态契约检查
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2017-09-14 DOI: 10.1007/978-3-319-94460-9_19
M. Hanus
{"title":"Combining Static and Dynamic Contract Checking for Curry","authors":"M. Hanus","doi":"10.1007/978-3-319-94460-9_19","DOIUrl":"https://doi.org/10.1007/978-3-319-94460-9_19","url":null,"abstract":"","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115516905","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
Deadlock detection of Java Bytecode Java字节码的死锁检测
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2017-09-13 DOI: 10.1007/978-3-319-94460-9_3
A. Garcia, C. Laneve
{"title":"Deadlock detection of Java Bytecode","authors":"A. Garcia, C. Laneve","doi":"10.1007/978-3-319-94460-9_3","DOIUrl":"https://doi.org/10.1007/978-3-319-94460-9_3","url":null,"abstract":"","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"287 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122932713","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
On the Generation of Initial Contexts for Effective Deadlock Detection 用于有效死锁检测的初始上下文的生成
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2017-09-13 DOI: 10.1007/978-3-319-94460-9_1
E. Albert, M. Gómez-Zamalloa, Miguel Isabel
{"title":"On the Generation of Initial Contexts for Effective Deadlock Detection","authors":"E. Albert, M. Gómez-Zamalloa, Miguel Isabel","doi":"10.1007/978-3-319-94460-9_1","DOIUrl":"https://doi.org/10.1007/978-3-319-94460-9_1","url":null,"abstract":"","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133839422","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
Symbolic Execution and Thresholding for Efficiently Tuning Fuzzy Logic Programs 有效调优模糊逻辑程序的符号执行和阈值
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2016-09-06 DOI: 10.1007/978-3-319-63139-4_8
G. Moreno, J. Penabad, J. A. Riaza, G. Vidal
{"title":"Symbolic Execution and Thresholding for Efficiently Tuning Fuzzy Logic Programs","authors":"G. Moreno, J. Penabad, J. A. Riaza, G. Vidal","doi":"10.1007/978-3-319-63139-4_8","DOIUrl":"https://doi.org/10.1007/978-3-319-63139-4_8","url":null,"abstract":"","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124645034","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}
引用次数: 10
CurryCheck: Checking Properties of Curry Programs CurryCheck:检查Curry程序的属性
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2016-08-19 DOI: 10.1007/978-3-319-63139-4_13
M. Hanus
{"title":"CurryCheck: Checking Properties of Curry Programs","authors":"M. Hanus","doi":"10.1007/978-3-319-63139-4_13","DOIUrl":"https://doi.org/10.1007/978-3-319-63139-4_13","url":null,"abstract":"","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115198011","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
Hierarchical Shape Abstraction for Analysis of Free List Memory Allocators 空闲表内存分配器分析的层次形状抽象
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2016-08-19 DOI: 10.1007/978-3-319-63139-4_9
Bin Fang, M. Sighireanu
{"title":"Hierarchical Shape Abstraction for Analysis of Free List Memory Allocators","authors":"Bin Fang, M. Sighireanu","doi":"10.1007/978-3-319-63139-4_9","DOIUrl":"https://doi.org/10.1007/978-3-319-63139-4_9","url":null,"abstract":"","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122417032","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}
引用次数: 10
Coinductive Soundness of Corecursive Type Class Resolution 共递归类型类解析的共归纳可靠性
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2016-08-18 DOI: 10.1007/978-3-319-63139-4_18
František Farka, Ekaterina Komendantskaya, K. Hammond
{"title":"Coinductive Soundness of Corecursive Type Class Resolution","authors":"František Farka, Ekaterina Komendantskaya, K. Hammond","doi":"10.1007/978-3-319-63139-4_18","DOIUrl":"https://doi.org/10.1007/978-3-319-63139-4_18","url":null,"abstract":"","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"294 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133724910","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
A Productivity Checker for Logic Programming 逻辑编程的生产率检查器
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2016-08-15 DOI: 10.1007/978-3-319-63139-4_10
Ekaterina Komendantskaya, Patricia Johann, Martin Schmidt
{"title":"A Productivity Checker for Logic Programming","authors":"Ekaterina Komendantskaya, Patricia Johann, Martin Schmidt","doi":"10.1007/978-3-319-63139-4_10","DOIUrl":"https://doi.org/10.1007/978-3-319-63139-4_10","url":null,"abstract":"","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131302039","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
Nominal Unification of Higher Order Expressions with Recursive Let 高阶表达式与递归Let的标称统一
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2016-08-12 DOI: 10.1007/978-3-319-63139-4_19
M. Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret
{"title":"Nominal Unification of Higher Order Expressions with Recursive Let","authors":"M. Schmidt-Schauß, Temur Kutsia, Jordi Levy, Mateu Villaret","doi":"10.1007/978-3-319-63139-4_19","DOIUrl":"https://doi.org/10.1007/978-3-319-63139-4_19","url":null,"abstract":"","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116958038","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
A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms 通过数量级的徒步旅行:导出闭简单型Lambda项和正规形式的有效生成器
International Workshop/Symposium on Logic-based Program Synthesis and Transformation Pub Date : 2016-08-12 DOI: 10.1007/978-3-319-63139-4_14
Paul Tarau
{"title":"A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms","authors":"Paul Tarau","doi":"10.1007/978-3-319-63139-4_14","DOIUrl":"https://doi.org/10.1007/978-3-319-63139-4_14","url":null,"abstract":"","PeriodicalId":445192,"journal":{"name":"International Workshop/Symposium on Logic-based Program Synthesis and Transformation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125554792","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
首页 上一页 下一页 尾页
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学术官方微信