检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:谢小赋 曾梦岐 庞飞 XIE Xiaofu;ZENG Mengqi;PANG Fei(No.30 Institute of CETC,Chengdu Sichuan 610041,China)
机构地区:[1]中国电子科技集团有限公司第三十研究所,四川成都610041
出 处:《信息安全与通信保密》2022年第3期54-62,共9页Information Security and Communications Privacy
摘 要:计算机并发性程序形式化验证一直是软件安全领域的难题。软件并发性漏洞难以被发现,一旦发生问题,会造成不可估量的安全问题。形式化验证基于严格的数学推导基础,采用语言、语义、推理证明三位一体方法,构建形式逻辑系统,以确保被验证系统的安全性能。传统的形式化验证方法由于人工参与多、验证工作量大、验证效率低等不足,难以对计算机并发程序进行严谨高效的模型描述与验证。研究了一种可双向转换的并发性程序形式化验证方法,解决了人工抽象建模存在的工作量大且易出错的问题,并且保证了源码层与抽象层验证的一致性,大幅提升了形式化验证的效率。Formal verification of concurrent programs is always a difficult problem in the field of software security. Software concurrency vulnerability is difficult to be detected, and once a problem occurs, it will cause immeasurable security incidents. Formal verification is based on a strict mathematical derivation basis. It adopts the trinity method of language, semantics and inference proof to construct a formal logic system to ensure the security performance of the verified system. The traditional formal verification method is difficult to carry out rigorous and efficient model description and verification of computer concurrent programs due to many human participation, large verification workload, and low verification efficiency. A bidirectional conversion concurrent formal verification method is proposed, which solves the problem of manual abstract modeling with heavy workload and prone to errors, and ensures the consistency of source code layer and abstract layer verification and greatly improves the efficiency of formal verification.
分 类 号:TP311.5[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.170