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

Formal Aspects of Computing最新文献

筛选
英文 中文
Editorial 编辑
IF 1 4区 计算机科学
Formal Aspects of Computing Pub Date : 2021-12-01 DOI: 10.1007/s00165-021-00568-x
Alessandro Fantechi, Anne E. Haxthausen, Jim Woodcock
{"title":"Editorial","authors":"Alessandro Fantechi, Anne E. Haxthausen, Jim Woodcock","doi":"10.1007/s00165-021-00568-x","DOIUrl":"https://doi.org/10.1007/s00165-021-00568-x","url":null,"abstract":"","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44393017","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A refinement-based development of a distributed signalling system 基于改进的分布式信号系统开发
IF 1 4区 计算机科学
Formal Aspects of Computing Pub Date : 2021-11-24 DOI: 10.1007/s00165-021-00567-y
P. Stankaitis, A. Iliasov, Tsutomu Kobayashi, Y. A. Ameur, F. Ishikawa, A. Romanovsky
{"title":"A refinement-based development of a distributed signalling system","authors":"P. Stankaitis, A. Iliasov, Tsutomu Kobayashi, Y. A. Ameur, F. Ishikawa, A. Romanovsky","doi":"10.1007/s00165-021-00567-y","DOIUrl":"https://doi.org/10.1007/s00165-021-00567-y","url":null,"abstract":"","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44004990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
TOrPEDO: witnessing model correctness with topological proofs 鱼雷:用拓扑证明证明模型的正确性
IF 1 4区 计算机科学
Formal Aspects of Computing Pub Date : 2021-11-06 DOI: 10.1007/s00165-021-00564-1
C. Menghi, A. M. Rizzi, A. Bernasconi, P. Spoletini
{"title":"TOrPEDO: witnessing model correctness with topological proofs","authors":"C. Menghi, A. M. Rizzi, A. Bernasconi, P. Spoletini","doi":"10.1007/s00165-021-00564-1","DOIUrl":"https://doi.org/10.1007/s00165-021-00564-1","url":null,"abstract":"","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48780351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Drawing with SAT: four methods and A tool for producing railway infrastructure schematics 用SAT绘图:制作铁路基础设施图的四种方法和工具
IF 1 4区 计算机科学
Formal Aspects of Computing Pub Date : 2021-10-20 DOI: 10.1007/s00165-021-00566-z
Bjørnar Luteberget, Christian Johansen
{"title":"Drawing with SAT: four methods and A tool for producing railway infrastructure schematics","authors":"Bjørnar Luteberget, Christian Johansen","doi":"10.1007/s00165-021-00566-z","DOIUrl":"https://doi.org/10.1007/s00165-021-00566-z","url":null,"abstract":"","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44247597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Compositional modeling of railway Virtual Coupling with Stochastic Activity Networks 基于随机活动网络的铁路虚拟耦合组合建模
IF 1 4区 计算机科学
Formal Aspects of Computing Pub Date : 2021-09-24 DOI: 10.1007/s00165-021-00560-5
Francesco Flammini, S. Marrone, Roberto Nardone, V. Vittorini
{"title":"Compositional modeling of railway Virtual Coupling with Stochastic Activity Networks","authors":"Francesco Flammini, S. Marrone, Roberto Nardone, V. Vittorini","doi":"10.1007/s00165-021-00560-5","DOIUrl":"https://doi.org/10.1007/s00165-021-00560-5","url":null,"abstract":"","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44648938","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
A Survey of Practical Formal Methods for Security 安全实用形式化方法综述
IF 1 4区 计算机科学
Formal Aspects of Computing Pub Date : 2021-09-03 DOI: 10.1145/3522582
T. Kulik, Brijesh Dongol, P. Larsen, H. D. Macedo, S. Schneider, P. Tran-Jørgensen, James Woodcock
{"title":"A Survey of Practical Formal Methods for Security","authors":"T. Kulik, Brijesh Dongol, P. Larsen, H. D. Macedo, S. Schneider, P. Tran-Jørgensen, James Woodcock","doi":"10.1145/3522582","DOIUrl":"https://doi.org/10.1145/3522582","url":null,"abstract":"In today’s world, critical infrastructure is often controlled by computing systems. This introduces new risks for cyber attacks, which can compromise the security and disrupt the functionality of these systems. It is therefore necessary to build such systems with strong guarantees of resiliency against cyber attacks. One way to achieve this level of assurance is using formal verification, which provides proofs of system compliance with desired cyber security properties. The use of Formal Methods (FM) in aspects of cyber security and safety-critical systems are reviewed in this article. We split FM into the three main classes: theorem proving, model checking, and lightweight FM. To allow the different uses of FM to be compared, we define a common set of terms. We further develop categories based on the type of computing system FM are applied in. Solutions in each class and category are presented, discussed, compared, and summarised. We describe historical highlights and developments and present a state-of-the-art review in the area of FM in cyber security. This review is presented from the point of view of FM practitioners and researchers, commenting on the trends in each of the classes and categories. This is achieved by considering all types of FM, several types of security and safety-critical systems, and by structuring the taxonomy accordingly. The article hence provides a comprehensive overview of FM and techniques available to system designers of security-critical systems, simplifying the process of choosing the right tool for the task. The article concludes by summarising the discussion of the review, focusing on best practices, challenges, general future trends, and directions of research within this field.","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41962278","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Foundations of programming languages 编程语言基础
IF 1 4区 计算机科学
Formal Aspects of Computing Pub Date : 2021-08-16 DOI: 10.1007/s00165-021-00561-4
R. Wilhelm
{"title":"Foundations of programming languages","authors":"R. Wilhelm","doi":"10.1007/s00165-021-00561-4","DOIUrl":"https://doi.org/10.1007/s00165-021-00561-4","url":null,"abstract":"","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00165-021-00561-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45052710","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Language Family Engineering with Product Lines of Multi-level Models 具有多层次模型产品线的语言族工程
IF 1 4区 计算机科学
Formal Aspects of Computing Pub Date : 2021-08-10 DOI: 10.1007/s00165-021-00554-3
J. de Lara, E. Guerra
{"title":"Language Family Engineering with Product Lines of Multi-level Models","authors":"J. de Lara, E. Guerra","doi":"10.1007/s00165-021-00554-3","DOIUrl":"https://doi.org/10.1007/s00165-021-00554-3","url":null,"abstract":"","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00165-021-00554-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48306707","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On Lexicographic Proof Rules for Probabilistic Termination 论概率终止的词典证明规则
IF 1 4区 计算机科学
Formal Aspects of Computing Pub Date : 2021-08-04 DOI: 10.1145/3585391
K. Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotn'y, Jiri Zárevúcky, Đorđe Žikelić
{"title":"On Lexicographic Proof Rules for Probabilistic Termination","authors":"K. Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotn'y, Jiri Zárevúcky, Đorđe Žikelić","doi":"10.1145/3585391","DOIUrl":"https://doi.org/10.1145/3585391","url":null,"abstract":"We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous work have a limitation that impedes their automation: all of their components have to be non-negative in all reachable states. This might result in a LexRSM not existing even for simple terminating programs. Our contributions are twofold. First, we introduce a generalization of LexRSMs that allows for some components to be negative. This standard feature of non-probabilistic termination proofs was hitherto not known to be sound in the probabilistic setting, as the soundness proof requires a careful analysis of the underlying stochastic process. Second, we present polynomial-time algorithms using our generalized LexRSMs for proving a.s. termination in broad classes of linear-arithmetic programs.","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46836077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Verification of piecewise deep neural networks: a star set approach with zonotope pre-filter 分段深度神经网络的验证:带分区预滤波的星集方法
IF 1 4区 计算机科学
Formal Aspects of Computing Pub Date : 2021-08-01 DOI: 10.1007/s00165-021-00553-4
Hoang-Dung Tran, Neelanjana Pal, Diego Manzanas Lopez, Patrick Musau, Xiaodong Yang, L. V. Nguyen, Weiming Xiang, Stanley Bak, Taylor T. Johnson
{"title":"Verification of piecewise deep neural networks: a star set approach with zonotope pre-filter","authors":"Hoang-Dung Tran, Neelanjana Pal, Diego Manzanas Lopez, Patrick Musau, Xiaodong Yang, L. V. Nguyen, Weiming Xiang, Stanley Bak, Taylor T. Johnson","doi":"10.1007/s00165-021-00553-4","DOIUrl":"https://doi.org/10.1007/s00165-021-00553-4","url":null,"abstract":"","PeriodicalId":50432,"journal":{"name":"Formal Aspects of Computing","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00165-021-00553-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42415708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
首页 上一页
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学术官方微信