A Formal Approach for Analysis and Testing of Reliable Embedded Systems

Guerrouat, Abdelaziz; Richter, H.

doi:10.1016/j.entcs.2005.02.050

Cited by 10 publications

(4 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…6 Concurrent processing A remarkable feature of real-time system is the concurrent processing and the arrival of external events usually cannot be expected.…”

Section: Reactivementioning

confidence: 99%

“…At the same time, he proposed some methods to reduce risk in different stages of the software life cycle and described two formal verification tools developed by his research team [5]. Guerrouat proposed an assertion-based extended finite state machine (EFSM) model, named p-EFSM, for the embedded software testing which can be used to analyze and test crucial tasks effectively in the design of reliable embedded systems [6]. Using variety of formal methods and tools, U. S. Naval Research Laboratory successfully realized the security verification of the read and write storage embedded devices software, and got higher test efficiency and reduced the verification costs [7].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Real-time embedded software testing method based on extended finite state machine

Yin

Liu

Ni³

2012

J. of Syst. Eng. Electron.

View full text Add to dashboard Cite

The reliability of real-time embedded software directly determines the reliability of the whole real-time embedded system, and the effective software testing is an important way to ensure software quality and reliability. Based on the analysis of the characteristics of real-time embedded software, the formal method is introduced into the real-time embedded software testing field and the real-time extended finite state machine (RT-EFSM) model is studied firstly. Then, the time zone division method of real-time embedded system is presented and the definition and description methods of time-constrained transition equivalence class (timeCTEC) are presented. Furthermore, the approaches of the testing sequence and test case generation are put forward. Finally, the proposed method is applied to a typical avionics realtime embedded software testing practice and the examples of the timeCTEC, testing sequences and test cases are given. With the analysis of the testing result, the application verification shows that the proposed method can effectively describe the real-time embedded software state transition characteristics and real-time requirements and play the advantages of the formal methods in accuracy, effectiveness and the automation supporting. Combined with the testing platform, the real-time, closed loop and automated simulation testing for real-time embedded software can be realized effectively.

show abstract

“…6 Concurrent processing A remarkable feature of real-time system is the concurrent processing and the arrival of external events usually cannot be expected.…”

Section: Reactivementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Real-time embedded software testing method based on extended finite state machine

Yin

Liu

Ni³

2012

J. of Syst. Eng. Electron.

View full text Add to dashboard Cite

show abstract

“…ASCS usually shows the state based behaviors wholly or partly, and one of the most commonly used formal method for testing this kind of embedded software is FSM or EFSM [10] [11] [12] [13]. Literature [4] proposed an assertion-based extended EFSM model p-EFSM for embedded software testing; literature [5] proposed a real-time finite state machine (RTFSM) model for numerical control system micro-fabrication (NCS); literature [6] presented a testing method which is based on incremental conformance; literature [7] proposed a kind of EFSM-based test input data automatically selected method; literature [8] showed an time extended finite state machine to describe the system modeling with time characteristics; literature [9] presented a testing method based on statecharts and temporal logic that oriented reactive system; literature [14] gave a EFSM model based testing method combined with hardware structure, and adopting fault injection method.…”

Section: Introductionmentioning

confidence: 99%

Research on Formal Verification Technique for Aircraft Safety-Critical Software

Yin

Liu²,

Su³

2010

JCP

View full text Add to dashboard Cite

As an important part of airborne avionics system, aircraft safety critical software (ASCS) plays an essential role to the safety of the aircraft, and to ensure its quality and reliability is one of the key problems we are facing. Formal methods have become important means for modeling and verifying safety critical software. In this paper, formal method is introduced into the ASCS verification field and the real-time extended finite state machine model (RT-EFSM) is studied, which includes the detailed real-time extension schemes and its validation methods. The verification process of ASCS based on RT-EFSM is also proposed. Furthermore, combined with the verification of an aircraft inertial/satellite navigation systems, a timed unique input/output sequence (t_UIO) is presented and the automatic generation algorithm of sub-transfer sequences based on t_UIO is given. Finally, the test adequacy criteria are discussed and a time condition coverage criterion is proposed. The actual engineering project application shows that the method proposed in this paper is of great value for the ASCS, which can be generally and effectively used in engineering

show abstract

“…In essence, the DymaMachine is a non-deterministic form of a communicating extended finite state machine with predicates [5]. As such, a DymaMachine can be constructed so as to be equivalent to many classes of automata including: finite state machines (FSM), extended finite state machines (EFSM), non-deterministic finite state machines (NDA), and extended finite state machines with predicates (p-EFSM) for example.…”

Section: Dymamachinementioning

confidence: 99%

Detecting Coordinated Attacks in Tactical Wireless Networks using Cooperative Signature-based Detectors

Little¹,

Ko²

MILCOM 2005 - 2005 IEEE Military Communications Conference

View full text Add to dashboard Cite

†We describe an approach to detecting coordinated attacks in tactical wireless networks in which distributed detectors cooperate to match signatures from audit events generated at different locations. Traditionally, the signature matching engine compares the signature with a single audit data stream to identify occurrences of the action sequence described in the signature. Such approach introduces a single point of failure and uses huge bandwidth for transferring audit data from the data sources to the matching engine. Our approach decomposes an extended infinite state machine, an operational representation of an attack signature, into multiple cooperative finite state machines that enable distributed signature engines to match the signature. We describe the decomposition methodology and the distributed matching algorithm and illustrate them using several example multistage attacks in tactical networks. In addition, we implemented an example distributed signature matching engine for detecting the example attacks in a simulation framework based on MASON. Our approach avoids a single point of failure and reduces the bandwidth usage by communicating internal state information rather than audit events.

show abstract

A Formal Approach for Analysis and Testing of Reliable Embedded Systems

Cited by 10 publications

References 7 publications

Real-time embedded software testing method based on extended finite state machine

Real-time embedded software testing method based on extended finite state machine

Research on Formal Verification Technique for Aircraft Safety-Critical Software

Detecting Coordinated Attacks in Tactical Wireless Networks using Cooperative Signature-based Detectors

Contact Info

Product

Resources

About