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

Formal Techniques for (Networked and) Distributed Systems最新文献

筛选
英文 中文
Branching Place Bisimilarity: A Decidable Behavioral Equivalence for Finite Petri Nets with Silent Moves 分支位置双相似性:具有静止运动的有限Petri网的可判定行为等价
Formal Techniques for (Networked and) Distributed Systems Pub Date : 2023-05-07 DOI: 10.1007/978-3-030-78089-0_5
R. Gorrieri
{"title":"Branching Place Bisimilarity: A Decidable Behavioral Equivalence for Finite Petri Nets with Silent Moves","authors":"R. Gorrieri","doi":"10.1007/978-3-030-78089-0_5","DOIUrl":"https://doi.org/10.1007/978-3-030-78089-0_5","url":null,"abstract":"","PeriodicalId":448077,"journal":{"name":"Formal Techniques for (Networked and) Distributed Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122986801","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
Efficient dynamic model based testing using greedy test case selection 有效的基于动态模型的测试，使用贪婪的测试用例选择
Formal Techniques for (Networked and) Distributed Systems Pub Date : 2023-05-01 DOI: 10.48550/arXiv.2305.00705
P. V. Spaendonck
{"title":"Efficient dynamic model based testing using greedy test case selection","authors":"P. V. Spaendonck","doi":"10.48550/arXiv.2305.00705","DOIUrl":"https://doi.org/10.48550/arXiv.2305.00705","url":null,"abstract":"Model-based testing (MBT) provides an automated approach for finding discrepancies between software models and their implementation. If we want to incorporate MBT into the fast and iterative software development process that is Continuous Integration Continuous Deployment, then MBT must be able to test the entire model in as little time as possible. However, current academic MBT tools either traverse models at random, which we show to be ineffective for this purpose, or use precalculated optimal paths which can not be efficiently calculated for large industrial models. We provide a new traversal strategy that provides an improvement in error-detection rate comparable to using recalculated paths. We show that the new strategy is able to be applied efficiently to large models. The benchmarks are performed on a mix of real-world and pseudo-randomly generated models. We observe no significant difference between these two types of models.","PeriodicalId":448077,"journal":{"name":"Formal Techniques for (Networked and) Distributed Systems","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127042943","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
With a little help from your friends: semi-cooperative games via Joker moves 从你的朋友的一点帮助:半合作游戏通过小丑移动
Formal Techniques for (Networked and) Distributed Systems Pub Date : 2023-04-26 DOI: 10.48550/arXiv.2304.13417
Petra van den Bos, Marielle Stoelinga
{"title":"With a little help from your friends: semi-cooperative games via Joker moves","authors":"Petra van den Bos, Marielle Stoelinga","doi":"10.48550/arXiv.2304.13417","DOIUrl":"https://doi.org/10.48550/arXiv.2304.13417","url":null,"abstract":"This paper coins the notion of Joker games where Player 2 is not strictly adversarial: Player 1 gets help from Player 2 by playing a Joker. We formalize these games as cost games, and study their theoretical properties. Finally, we illustrate their use in model-based testing.","PeriodicalId":448077,"journal":{"name":"Formal Techniques for (Networked and) Distributed Systems","volume":"440 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115924504","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
Certified Compilation of Choreographies with hacc 认证编舞与hacc
Formal Techniques for (Networked and) Distributed Systems Pub Date : 2023-03-07 DOI: 10.48550/arXiv.2303.03972
L. Cruz-Filipe, Lovro Lugovi'c, F. Montesi
{"title":"Certified Compilation of Choreographies with hacc","authors":"L. Cruz-Filipe, Lovro Lugovi'c, F. Montesi","doi":"10.48550/arXiv.2303.03972","DOIUrl":"https://doi.org/10.48550/arXiv.2303.03972","url":null,"abstract":"Programming communicating processes is challenging, because it requires writing separate programs that perform compatible send and receive actions at the right time during execution. Leaving this task to the programmer can easily lead to bugs. Choreographic programming addresses this challenge by equipping developers with high-level abstractions for codifying the desired communication structures from a global viewpoint. Given a choreography, implementations of the involved processes can be automatically generated by endpoint projection (EPP). While choreographic programming prevents manual mistakes in the implementation of communications, the correctness of a choreographic programming framework crucially hinges on the correctness of its complex compiler, which has motivated formalisation of theories of choreographic programming in theorem provers. In this paper, we build upon one of these formalisations to construct a toolchain that produces executable code from a choreography.","PeriodicalId":448077,"journal":{"name":"Formal Techniques for (Networked and) Distributed Systems","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114682253","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
Branch-Well-Structured Transition Systems and Extensions 分支——结构良好的转换系统和扩展
Formal Techniques for (Networked and) Distributed Systems Pub Date : 2022-11-29 DOI: 10.1007/978-3-031-08679-3_4
B. Bollig, A. Finkel, Amrita Suresh
{"title":"Branch-Well-Structured Transition Systems and Extensions","authors":"B. Bollig, A. Finkel, Amrita Suresh","doi":"10.1007/978-3-031-08679-3_4","DOIUrl":"https://doi.org/10.1007/978-3-031-08679-3_4","url":null,"abstract":"","PeriodicalId":448077,"journal":{"name":"Formal Techniques for (Networked and) Distributed Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126890388","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
Fault-Tolerant Multiparty Session Types 容错多方会话类型
Formal Techniques for (Networked and) Distributed Systems Pub Date : 2022-04-16 DOI: 10.1007/978-3-031-08679-3_7
Kirstin Peters, U. Nestmann, Christopher Wagner
{"title":"Fault-Tolerant Multiparty Session Types","authors":"Kirstin Peters, U. Nestmann, Christopher Wagner","doi":"10.1007/978-3-031-08679-3_7","DOIUrl":"https://doi.org/10.1007/978-3-031-08679-3_7","url":null,"abstract":"","PeriodicalId":448077,"journal":{"name":"Formal Techniques for (Networked and) Distributed Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129205928","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
Encodability Criteria for Quantum Based Systems 量子系统的可编码性标准
Formal Techniques for (Networked and) Distributed Systems Pub Date : 2022-04-12 DOI: 10.1007/978-3-031-08679-3_10
Anna Schmitt, Kirstin Peters, Yuxin Deng
{"title":"Encodability Criteria for Quantum Based Systems","authors":"Anna Schmitt, Kirstin Peters, Yuxin Deng","doi":"10.1007/978-3-031-08679-3_10","DOIUrl":"https://doi.org/10.1007/978-3-031-08679-3_10","url":null,"abstract":"","PeriodicalId":448077,"journal":{"name":"Formal Techniques for (Networked and) Distributed Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129120308","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
Monitoring hyperproperties with circuits 用电路监测超属性
Formal Techniques for (Networked and) Distributed Systems Pub Date : 2022-02-23 DOI: 10.1007/978-3-031-08679-3_1
L. Aceto, Antonios Achilleos, Elli Anastasiadi, Adrian Francalanza
{"title":"Monitoring hyperproperties with circuits","authors":"L. Aceto, Antonios Achilleos, Elli Anastasiadi, Adrian Francalanza","doi":"10.1007/978-3-031-08679-3_1","DOIUrl":"https://doi.org/10.1007/978-3-031-08679-3_1","url":null,"abstract":"","PeriodicalId":448077,"journal":{"name":"Formal Techniques for (Networked and) Distributed Systems","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114232178","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
LTL under reductions with weaker conditions than stutter-invariance LTL在较弱条件下的约简
Formal Techniques for (Networked and) Distributed Systems Pub Date : 2021-11-05 DOI: 10.1007/978-3-031-08679-3_11
E. Paviot-Adet, D. Poitrenaud, E. Renault, Y. Thierry-Mieg
{"title":"LTL under reductions with weaker conditions than stutter-invariance","authors":"E. Paviot-Adet, D. Poitrenaud, E. Renault, Y. Thierry-Mieg","doi":"10.1007/978-3-031-08679-3_11","DOIUrl":"https://doi.org/10.1007/978-3-031-08679-3_11","url":null,"abstract":"","PeriodicalId":448077,"journal":{"name":"Formal Techniques for (Networked and) Distributed Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114398164","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
π with leftovers: a mechanisation in Agda 带剩菜的π:《阿格达》中的机械化
Formal Techniques for (Networked and) Distributed Systems Pub Date : 2020-05-08 DOI: 10.1007/978-3-030-78089-0_9
Uma Zalakain, Ornela Dardha
{"title":"π with leftovers: a mechanisation in Agda","authors":"Uma Zalakain, Ornela Dardha","doi":"10.1007/978-3-030-78089-0_9","DOIUrl":"https://doi.org/10.1007/978-3-030-78089-0_9","url":null,"abstract":"","PeriodicalId":448077,"journal":{"name":"Formal Techniques for (Networked and) Distributed Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114803554","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
下一页 尾页
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学术官方微信