scholarly journals Verifying Real-Time Embedded Software by Means of Automated State-based Online Testing and the SPIN Model Checker—Application to RTEdge Models

2013 ◽  
Author(s):  
Wafa Hasanain
Keyword(s):  
Real Time ◽  
Embedded Software ◽  
Spin Model ◽  
Online Testing ◽  
Model Checker ◽  
Spin Model Checker

scholarly journals Online On-the-Fly Testing of Real-time Systems

2003 ◽  
Vol 10 (49) ◽  
Author(s):  
Marius Mikucionis ◽  
Kim G. Larsen ◽  
Brian Nielsen
Keyword(s):  
Real Time ◽  
Test Generation ◽  
Timed Automata ◽  
Online Testing ◽  
Real Time Systems ◽  
Model Checker ◽  
Test Specification ◽  
And Performance ◽  
Automata Network ◽  
Time Systems

In this paper we present a framework, an algorithm and a new tool for online testing of real-time systems based on symbolic techniques used in UPPAAL model checker. We extend UPPAAL timed automata network model to a test specification which is used to generate test primitives and to check the correctness of system responses including the timing aspects. We use timed trace inclusion as a conformance relation between system and specification to draw a test verdict. The test generation and execution algorithm is implemented as an extension to UPPAAL and experiments carried out to examine the correctness and performance of the tool. The experiment results are promising.

scholarly journals Towards Automated Verification of P Systems Using Spin

2011 ◽  
Vol 2 (3) ◽  
pp. 1-12 ◽  
Author(s):  
Raluca Lefticaru ◽  
Cristina Tudose ◽  
Florentin Ipate
Keyword(s):  
Natural Language ◽  
Spin Model ◽  
P Systems ◽  
Automated Verification ◽  
P System ◽  
Model Checker ◽  
High Level ◽  
Spin Model Checker

This paper presents an approach to P systems verification using the Spin model checker. The authors have developed a tool which implements the proposed approach and can automatically transform P system specifications from P-Lingua into Promela, the language accepted by the well known model checker Spin. The properties expected for the P system are specified using some patterns, representing high level descriptions of frequently asked questions, formulated in natural language. These properties are automatically translated into LTL specifications for the Promela model and the Spin model checker is run against them. In case a counterexample is received, the Spin trace is decoded and expressed as a P system computation. The tool has been tested on a number of examples and the results obtained are presented in the paper.

Research on Model Checking for SELinux Inter-Process Communication

2013 ◽  
Vol 380-384 ◽  
pp. 3826-3829
Author(s):  
Ning Wang ◽  
Sheng Wen Gong ◽  
Huai Xiao Wang
Keyword(s):  
Operating System ◽  
Spin Model ◽  
Finite State Automaton ◽  
Basic Design ◽  
Model Checker ◽  
Process Communication ◽  
Know How ◽  
Finite State ◽  
Inter Process Communication ◽  
Spin Model Checker

SELinux (Security Enhanced Linux) inherited the basic design of LINUX, and it is a high secure operating system. It is important to know how to make the IPC (Inter-Process Communication) for this kind of multi-task and multi-user system. In this paper, Finite State Automaton is used to verify the security of IPC mechanisms of SELinux. Finally, IPC mechanisms are verified with SPIN model checker.

Sign in / Sign up

Export Citation Format

Share Document