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

Foundations of Software Science and Computation Structure最新文献

筛选
英文 中文
Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces 概率相干空间的强充分性和无类型全抽象
Foundations of Software Science and Computation Structure Pub Date : 2019-04-08 DOI: 10.1007/978-3-030-17127-8_21
Thomas Leventis, Michele Pagani
{"title":"Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces","authors":"Thomas Leventis, Michele Pagani","doi":"10.1007/978-3-030-17127-8_21","DOIUrl":"https://doi.org/10.1007/978-3-030-17127-8_21","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124896622","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}
引用次数: 7
Tight Worst-Case Bounds for Polynomial Loop Programs 多项式循环程序的紧最坏情况界
Foundations of Software Science and Computation Structure Pub Date : 2019-04-08 DOI: 10.1007/978-3-030-17127-8_5
Amir M. Ben-Amram, G. Hamilton
{"title":"Tight Worst-Case Bounds for Polynomial Loop Programs","authors":"Amir M. Ben-Amram, G. Hamilton","doi":"10.1007/978-3-030-17127-8_5","DOIUrl":"https://doi.org/10.1007/978-3-030-17127-8_5","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125464472","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
Causality in Linear Logic - Full Completeness and Injectivity (Unit-Free Multiplicative-Additive Fragment) 线性逻辑中的因果关系-完全完备性和注入性(无单位乘法加性片段)
Foundations of Software Science and Computation Structure Pub Date : 2019-04-08 DOI: 10.1007/978-3-030-17127-8_9
Simon Castellan, N. Yoshida
{"title":"Causality in Linear Logic - Full Completeness and Injectivity (Unit-Free Multiplicative-Additive Fragment)","authors":"Simon Castellan, N. Yoshida","doi":"10.1007/978-3-030-17127-8_9","DOIUrl":"https://doi.org/10.1007/978-3-030-17127-8_9","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115965029","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
The Bernays-Schönfinkel-Ramsey Class of Separation Logic on Arbitrary Domains Bernays-Schönfinkel-Ramsey任意域上的分离逻辑类
Foundations of Software Science and Computation Structure Pub Date : 2019-04-08 DOI: 10.1007/978-3-030-17127-8_14
M. Echenim, Radu Iosif, N. Peltier
{"title":"The Bernays-Schönfinkel-Ramsey Class of Separation Logic on Arbitrary Domains","authors":"M. Echenim, Radu Iosif, N. Peltier","doi":"10.1007/978-3-030-17127-8_14","DOIUrl":"https://doi.org/10.1007/978-3-030-17127-8_14","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"2017 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132575776","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
Constructing Inductive-Inductive Types in Cubical Type Theory 在立方型理论中构造归纳-归纳类型
Foundations of Software Science and Computation Structure Pub Date : 2019-04-08 DOI: 10.1007/978-3-030-17127-8_17
Jasper Hugunin
{"title":"Constructing Inductive-Inductive Types in Cubical Type Theory","authors":"Jasper Hugunin","doi":"10.1007/978-3-030-17127-8_17","DOIUrl":"https://doi.org/10.1007/978-3-030-17127-8_17","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114325699","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}
引用次数: 2
Coalgebra Learning via Duality 通过对偶学习协代数
Foundations of Software Science and Computation Structure Pub Date : 2019-02-15 DOI: 10.1007/978-3-030-17127-8_4
Simone Barlocco, C. Kupke, J. Rot
{"title":"Coalgebra Learning via Duality","authors":"Simone Barlocco, C. Kupke, J. Rot","doi":"10.1007/978-3-030-17127-8_4","DOIUrl":"https://doi.org/10.1007/978-3-030-17127-8_4","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115105946","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
Continuous Reachability for Unordered Data Petri nets is in PTime 无序数据Petri网的连续可达性在PTime范围内
Foundations of Software Science and Computation Structure Pub Date : 2019-02-14 DOI: 10.1007/978-3-030-17127-8_15
Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman
{"title":"Continuous Reachability for Unordered Data Petri nets is in PTime","authors":"Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman","doi":"10.1007/978-3-030-17127-8_15","DOIUrl":"https://doi.org/10.1007/978-3-030-17127-8_15","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134359123","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
Rewriting Abstract Structures: Materialization Explained Categorically 重写抽象结构:物质化的绝对解释
Foundations of Software Science and Computation Structure Pub Date : 2019-02-13 DOI: 10.1007/978-3-030-17127-8_10
A. Corradini, T. Heindel, B. König, Dennis Nolte, A. Rensink
{"title":"Rewriting Abstract Structures: Materialization Explained Categorically","authors":"A. Corradini, T. Heindel, B. König, Dennis Nolte, A. Rensink","doi":"10.1007/978-3-030-17127-8_10","DOIUrl":"https://doi.org/10.1007/978-3-030-17127-8_10","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122711674","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}
引用次数: 7
Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time 多项式时间下分离非嵌套属性系统的等价性判定
Foundations of Software Science and Computation Structure Pub Date : 2019-02-11 DOI: 10.1007/978-3-030-17127-8_28
H. Seidl, Raphaela Palenta, S. Maneth
{"title":"Deciding Equivalence of Separated Non-Nested Attribute Systems in Polynomial Time","authors":"H. Seidl, Raphaela Palenta, S. Maneth","doi":"10.1007/978-3-030-17127-8_28","DOIUrl":"https://doi.org/10.1007/978-3-030-17127-8_28","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"1 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134632944","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
Higher-Order Distributions for Differential Linear Logic 微分线性逻辑的高阶分布
Foundations of Software Science and Computation Structure Pub Date : 2019-01-16 DOI: 10.1007/978-3-030-17127-8_19
M. Kerjean, J. Lemay
{"title":"Higher-Order Distributions for Differential Linear Logic","authors":"M. Kerjean, J. Lemay","doi":"10.1007/978-3-030-17127-8_19","DOIUrl":"https://doi.org/10.1007/978-3-030-17127-8_19","url":null,"abstract":"","PeriodicalId":330721,"journal":{"name":"Foundations of Software Science and Computation Structure","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116923567","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
首页 上一页 下一页 尾页
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学术官方微信