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

International Colloquium on Theoretical Aspects of Computing最新文献

筛选
英文 中文
Double Applicative Functors 双应用函子
International Colloquium on Theoretical Aspects of Computing Pub Date : 2018-10-16 DOI: 10.1007/978-3-030-02508-3_18
Härmel Nestra
{"title":"Double Applicative Functors","authors":"Härmel Nestra","doi":"10.1007/978-3-030-02508-3_18","DOIUrl":"https://doi.org/10.1007/978-3-030-02508-3_18","url":null,"abstract":"","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116636007","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
An Automata-Based View on Configurability and Uncertainty 基于自动机的可配置性和不确定性观点
International Colloquium on Theoretical Aspects of Computing Pub Date : 2018-10-16 DOI: 10.1007/978-3-030-02508-3_5
Martin Berglund, Ina Schaefer
{"title":"An Automata-Based View on Configurability and Uncertainty","authors":"Martin Berglund, Ina Schaefer","doi":"10.1007/978-3-030-02508-3_5","DOIUrl":"https://doi.org/10.1007/978-3-030-02508-3_5","url":null,"abstract":"","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126884674","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
Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables 有限多变量分支时间和交替时间逻辑的复杂性和表达性
International Colloquium on Theoretical Aspects of Computing Pub Date : 2018-10-16 DOI: 10.1007/978-3-030-02508-3_21
M. Rybakov, D. Shkatov
{"title":"Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables","authors":"M. Rybakov, D. Shkatov","doi":"10.1007/978-3-030-02508-3_21","DOIUrl":"https://doi.org/10.1007/978-3-030-02508-3_21","url":null,"abstract":"","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133543894","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
Abstraction of Bit-Vector Operations for BDD-Based SMT Solvers 基于bdd的SMT解算器位向量运算的抽象
International Colloquium on Theoretical Aspects of Computing Pub Date : 2018-10-16 DOI: 10.1007/978-3-030-02508-3_15
Martin Jonás, J. Strejček
{"title":"Abstraction of Bit-Vector Operations for BDD-Based SMT Solvers","authors":"Martin Jonás, J. Strejček","doi":"10.1007/978-3-030-02508-3_15","DOIUrl":"https://doi.org/10.1007/978-3-030-02508-3_15","url":null,"abstract":"","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121049237","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
Checking Sequence Generation for Symbolic Input/Output FSMs by Constraint Solving 基于约束求解的符号输入/输出fsm序列生成检验
International Colloquium on Theoretical Aspects of Computing Pub Date : 2018-10-16 DOI: 10.1007/978-3-030-02508-3_19
Omer Nguena-Timo, A. Petrenko, S. Ramesh
{"title":"Checking Sequence Generation for Symbolic Input/Output FSMs by Constraint Solving","authors":"Omer Nguena-Timo, A. Petrenko, S. Ramesh","doi":"10.1007/978-3-030-02508-3_19","DOIUrl":"https://doi.org/10.1007/978-3-030-02508-3_19","url":null,"abstract":"","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116011845","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}
引用次数: 6
Formal Verification of a Geometry Algorithm: A Quest for Abstract Views and Symmetry in Coq Proofs 几何算法的形式化验证:对Coq证明中抽象视图和对称性的探索
International Colloquium on Theoretical Aspects of Computing Pub Date : 2018-09-03 DOI: 10.1007/978-3-030-02508-3_1
Yves Bertot
{"title":"Formal Verification of a Geometry Algorithm: A Quest for Abstract Views and Symmetry in Coq Proofs","authors":"Yves Bertot","doi":"10.1007/978-3-030-02508-3_1","DOIUrl":"https://doi.org/10.1007/978-3-030-02508-3_1","url":null,"abstract":"","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123139781","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
Input/Output Stochastic Automata with Urgency: Confluence and weak determinism 具有紧急性的输入/输出随机自动机:合流和弱确定性
International Colloquium on Theoretical Aspects of Computing Pub Date : 2018-08-08 DOI: 10.1007/978-3-030-02508-3_8
P. D’Argenio, Raúl E. Monti
{"title":"Input/Output Stochastic Automata with Urgency: Confluence and weak determinism","authors":"P. D’Argenio, Raúl E. Monti","doi":"10.1007/978-3-030-02508-3_8","DOIUrl":"https://doi.org/10.1007/978-3-030-02508-3_8","url":null,"abstract":"","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128193210","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
Explicit Auditing 明确审计
International Colloquium on Theoretical Aspects of Computing Pub Date : 2018-08-01 DOI: 10.1007/978-3-030-02508-3_20
W. Ricciotti, J. Cheney
{"title":"Explicit Auditing","authors":"W. Ricciotti, J. Cheney","doi":"10.1007/978-3-030-02508-3_20","DOIUrl":"https://doi.org/10.1007/978-3-030-02508-3_20","url":null,"abstract":"","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125417559","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
Convex Language Semantics for Nondeterministic Probabilistic Automata 非确定性概率自动机的凸语言语义
International Colloquium on Theoretical Aspects of Computing Pub Date : 2018-05-29 DOI: 10.1007/978-3-030-02508-3_25
Gerco van Heerdt, Justin Hsu, J. Ouaknine, Alexandra Silva
{"title":"Convex Language Semantics for Nondeterministic Probabilistic Automata","authors":"Gerco van Heerdt, Justin Hsu, J. Ouaknine, Alexandra Silva","doi":"10.1007/978-3-030-02508-3_25","DOIUrl":"https://doi.org/10.1007/978-3-030-02508-3_25","url":null,"abstract":"","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126636979","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
Polynomial Time Learner for Inferring Subclasses of Internal Contextual Grammars with Local Maximum Selectors 利用局部最大值选择器推断内部上下文语法子类的多项式时间学习器
International Colloquium on Theoretical Aspects of Computing Pub Date : 2017-10-23 DOI: 10.1007/978-3-319-67729-3_11
Abhisek Midya, D. G. Thomas, Saleem Malik, A. Pani
{"title":"Polynomial Time Learner for Inferring Subclasses of Internal Contextual Grammars with Local Maximum Selectors","authors":"Abhisek Midya, D. G. Thomas, Saleem Malik, A. Pani","doi":"10.1007/978-3-319-67729-3_11","DOIUrl":"https://doi.org/10.1007/978-3-319-67729-3_11","url":null,"abstract":"","PeriodicalId":142552,"journal":{"name":"International Colloquium on Theoretical Aspects of Computing","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133452918","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学术文献互助群
群 号：481959085
Book学术官方微信