Systematic Verification of Embedded Components with Re-usable Properties

被引:0
作者
Assayad, Ismail [1 ]
Eljadiri, Lamia [1 ]
Zakari, Abdelouahed [2 ]
机构
[1] Univ Hassan II Casablanca, LIMSAD, Fac Sci, Casablanca, Morocco
[2] Univ Lorraine, IUT, Metz, France
来源
2017 INTERNATIONAL CONFERENCE ON WIRELESS NETWORKS AND MOBILE COMMUNICATIONS (WINCOM) | 2017年
关键词
Embedded Systems; Components; Verification; Spin; LTL; Promela; SystemC; TEMPORAL LOGIC;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Formal verification has become very useful and popular in last decade in area of embedded systems design and in analysis of critical systems. It can reveal common errors like deadlocks, starvation, check system invariants, but also verify more complex properties defined by LTL formulas whose writing may be very error prone for non expert users. To reduce the time-to-market for embedded systems and assist designers in the complexity of verification step at design time, we advocate the pre-development of re-usable behavioral properties for each family of embedded components to be verified. The proposed approach is to pre-define the re-usable properties by specifying them as logics on standard input/output signals and standard data values. Obtaining this re-usable form enables them to be used for every new component in the product line, hence without the need to spend additional time to redo the verification setup every time a new component is used to create a new design. We have successfully pre-defined LTL re-usable properties for widely used industrial embedded components families such as fifos and buses, and have performed generic verification using SPIN tool.
引用
收藏
页码:225 / 231
页数:7
相关论文
共 19 条
[1]  
Almagor S., 2014, DISCOUNTING IN LTL, P424, DOI [10.1007/978-3-642-54862-837, DOI 10.1007/978-3-642-54862-837]
[2]  
ALUR R, 1992, LECT NOTES COMPUT SC, V600, P74, DOI 10.1007/BFb0031988
[3]  
[Anonymous], 1992, TEMPORAL LOGIC REACT, DOI DOI 10.1007/978-1-4612-0931-7
[4]  
[Anonymous], 1995, Temporal verification of reactive systems: safety
[5]  
[Anonymous], 1993, Symbolic Model Checking
[6]  
Basu A, 2006, I C SOFTW ENG FORM M, P3
[7]   THE TEMPORAL LOGIC OF BRANCHING TIME [J].
BENARI, M ;
PNUELI, A ;
MANNA, Z .
ACTA INFORMATICA, 1983, 20 (03) :207-226
[8]  
Campos S, 1995, INTERNATIONAL CONFERENCE ON COMPUTER DESIGN: VLSI IN COMPUTERS & PROCESSORS, PROCEEDINGS, P72, DOI 10.1109/ICCD.1995.528793
[9]   AUTOMATIC VERIFICATION OF FINITE-STATE CONCURRENT SYSTEMS USING TEMPORAL LOGIC SPECIFICATIONS [J].
CLARKE, EM ;
EMERSON, EA ;
SISTLA, AP .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1986, 8 (02) :244-263
[10]  
Clarke EM, 1999, MODEL CHECKING, P1