The Use of Automated Theorem Proving for Error Analysis and Removal in Safety Critical Embedded System Specifications

被引:0
作者
Lockhart, Jonathan [1 ]
Purdy, Carla [1 ]
Wilsey, Philip A. [1 ]
机构
[1] Univ Cincinnati, Dept Elect Engn & Comp Syst, Cincinnati, OH 45220 USA
来源
2017 IEEE NATIONAL AEROSPACE AND ELECTRONICS CONFERENCE (NAECON) | 2017年
关键词
Specification development; software reliability; automated theorem proving (ATP); Z (zed); ProofPower; formal methods; specification errors; software errors; software; FORMAL METHODS;
D O I
暂无
中图分类号
V [航空、航天];
学科分类号
08 ; 0825 ;
摘要
As embedded systems increase in complexity, more and more functionality is being migrated to software. Much of the migrated software is critical to the well-being of the system and users. Thus, methods to produce high quality software are needed. Software development today focuses on taking requirements and producing software as fast as possible. Traditional methods have been augmented or replaced with new, agile methods (like SCRUM) designed to produce bits of code as quickly and cheaply as possible. Unfortunately many of these methods ignore standard testing procedures and rely on reported errors to drive corrections in future releases. Traditional methods require exhaustive testing to eliminate a majority of errors. Both processes are time intensive and in the long run cost the project more to correct errors. This paper demonstrates that errors in requirements and design can be discovered and eliminated prior to implementation with the use of automated theorem provers for formal methods. This illustration is key to saving time and costs in the software development life cycle.
引用
收藏
页码:358 / 361
页数:4
相关论文
共 31 条
[1]  
[Anonymous], 2006, ProofPower: Z Tutorial, P143
[2]  
[Anonymous], 13568 ISP IEC
[3]  
[Anonymous], MULT VAL LOG 2000 IS
[4]  
[Anonymous], 2010, TECH REP
[5]  
[Anonymous], 2006, PROOFPOWER TUT
[6]  
[Anonymous], 2015, HIGH BANDW MEM HBM R
[7]  
[Anonymous], SOFTWARE DEV PROCESS
[8]  
[Anonymous], ENG COMPUTER BASED S
[9]  
[Anonymous], MIPRO 2011 P 34 INT
[10]  
[Anonymous], 2015, THESIS