Results 141 to 150 of about 2,823 (181)

A generalized semantics of PROMELA for abstract model checking

Formal Aspects of Computing, 2004
Abstract. Semantics of description languages for complex systems are a central issue for implementing verification methods such as abstract model checking . This technique is employed to verify systems by inspecting only a small state space that represents its potential behaviors.
Maria del Mar Gallardo, Pedro Merino, Ernesto Pimentel   +2 more
exaly   +2 more sources

Implementing statecharts in PROMELA/SPIN

Proceedings. 2nd IEEE Workshop on Industrial Strength Formal Specification Techniques, 2002
We translate statecharts into PROMELA, the input language of the SPIN verification system, using extended hierarchical automata as an intermediate format. We discuss two possible frameworks for this translation, leading to either sequential or parallel code.
Erich Mikk, Yassine Lakhnech, Michael Siegel, Gerard J. Holzmann   +3 more
openaire   +1 more source

Discrete-time Promela and Spin

1998
Spin is a software package for the verification of concurrent systems. A system to be verified is modeled in Promela — Spin’s input language. We present an extension of Promela and Spin with discrete time that provides an opportunity to model systems whose correct functioning crucially depends on timing parameters.
Bosnacki, D., Dams, D.R.
openaire   +2 more sources

Channel dependence analysis for slicing Promela

Proceedings International Symposium on Software Engineering for Parallel and Distributed Systems PDSE-99, 1999
Accurate channel analysis and communication dependence information is necessary for source code analysis tools to be useful in the concurrent specification and programming language domain. We present channel analysis along with an application thereof and describe its implications for the development and understanding of programs written in concurrent ...
Lynette I. Millett, Tim Teitelbaum
openaire   +1 more source

A Promela Model for Contiki’s Scheduler

2020 CSI/CPSSI International Symposium on Real-Time and Embedded Systems and Technologies (RTEST), 2020
This paper presents a formal model for the scheduler of Contiki, which is an event-driven lightweight Operating System for the Internet of Things (IoT). The proposed formal model enhances our knowledge regarding the most critical components of Contiki, namely its process and event queues, and its scheduler.
Hassan Mousavi, Elham Mahmoudzadeh, Ali Ebnenasir   +2 more
openaire   +1 more source

Modeling Railway Control Systems in Promela

2016
This paper presents an approach to systematically build Promela models with the aim of generating test cases within the system level testing process of railway control systems. The paper focuses on the encoding of the system model, of the aspects related to the representation of possible execution environments and their interaction with the system. The
Roberto Nardone, Ugo Gentile, Massimo Benerecetti, Adriano Peron, Valeria Vittorini, Stefano Marrone 0001, Nicola Mazzocca   +6 more
openaire   +4 more sources

VIP: A Visual Interface for Promela

1999
The Visual Interface to Promela (VIP) tool is a Java based graphical front end to the Promela specication language and the SPIN model checker [2]. VIP supports a visual formalism called v-Promela [3] which extends the Promela lan- guage with a graphical notation to describe structural and behavioral aspects of a system.
Moataz Kamel, Stefan Leue
openaire   +1 more source

Data decision diagrams for Promela systems analysis

International Journal on Software Tools for Technology Transfer, 2010
In this paper, we show how to verify computation tree logic (CTL) properties, using symbolic methods, on systems described in Promela. Symbolic representation is based on data decision diagrams (DDDs) which are n-valued Shared Decision Trees designed to represent dynamic systems with integer domain variables.
Beaudenon, Vincent, Encrenaz, Emmanuelle, Taktak, Sami   +2 more
openaire   +2 more sources

From Dynamic State Machines to Promela

2019
Dynamic State Machines (DSTM) is an extension of Hierarchical State Machines recently introduced to answer some concerns raised by model-based validation of railway control systems. However, DSTM can be used to model a wide class of systems for design, verification and validation purposes.
Massimo Benerecetti, Ugo Gentile, Roberto Nardone, Adriano Peron, Luigi Libero Lucio Starace, Valeria Vittorini, Stefano Marrone   +6 more
openaire   +2 more sources

Extending the Translation from SDL to Promela

2002
This paper tackles the problem of model-checking SDL programs that use the save operator. Previous work on model-checking SDL programs with SPIN consisted in translating SDL into IF (using sdl2if) and finally IF to Promela (if2pml). However, the save operator of SDL is not handled by the (final) translator if2pml.
Armelle Prigent, Franck Cassez, Philippe Dhaussy, Olivier F. Roux   +3 more
openaire   +1 more source