Results 141 to 150 of about 864 (171)

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

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

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

Founding FireWire bridges through Promela prototyping

Proceedings International Parallel and Distributed Processing Symposium, 2004
The standardisation procedure of the IEEE P1394.1 Draft Standard for High Performance Serial Bus Bridges is supported through the use of the state-of-the-art model checker Spin, which has been used to simulate the complex net update procedure of the standard, and the use of which will eventually be refined to obtain a solid model checking analysis of ...
Langevelde, van, I., Romijn, J.M.T., Goga, N.   +2 more
openaire   +2 more sources

Embedding a Dialect of SDL in PROMELA

1999
We describe a translation from a dialect of SDL-88 to PROMELA, the input language of the SPIN model checker. The fairly straightforward translation covers data types as well as processes, procedures, and services. Together with SPIN the translation provides a simulation and verification environment for most SDL features.
openaire   +1 more source

Bioconcentration of nonylphenol in fathead minnows (Pimephales promelas)

Chemosphere, 2001
Bioconcentration of p-nonylphenol (NP) by fathead minnows was determined under laboratory conditions. Fish were exposed continuously for 42 days to 0.33, 0.93 and 2.36 microg NP/l in a flow-through system. NP was Soxhlet extracted from whole fish homogenates with dichloromethane (DCM).
S A, Snyder, T L, Keith, S L, Pierens, E M, Snyder, J P, Giesy   +4 more
openaire   +2 more sources

Promela++: a language for constructing correct and efficient protocols

Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98CH36169), 2002
The challenge is to develop an easily usable protocol development framework that combines the flexibility of layered implementations, the efficiency of tightly-coupled monolithic implementations and the correctness achievable using high-level protocol validation languages.
Anindya Basu, J. Gregory Morrisett, Thorsten von Eicken   +2 more
openaire   +1 more source

Translation Pattern of BPEL Process into Promela Code

2011 Joint Conference of the 21st International Workshop on Software Measurement and the 6th International Conference on Software Process and Product Measurement, 2011
To verify behavioral specification of compound Web services, this paper introduces to apply model checking to Web services flows described by BPEL. Model checking is a formal method to formalize the behavior of designed system as an automaton and to analyze automatically whether or not the automaton satisfies the specification.
Ryosuke Nakashiro, Yasutaka Kamei, Naoyasu Ubayashi, Shin Nakajima 0001, Akihito Iwai   +4 more
openaire   +1 more source

A Framework for Automatic Construction of Abstract Promela Models

1999
One of the current trends in model checking for the verification of concurrent systems is to reduce the state space produced by the model, and one of the more promising ways to achieve this objective is to support some kind of automatic construction of more abstract models. This paper presents a proposal in this direction.
María-del-Mar Gallardo, Pedro Merino 0001   +1 more
openaire   +1 more source

Abstraction of Communication Channels in Promela: A Case Study

2000
We present a case study of how abstractions can be applied to a protocol model, written in Promela, in order to make in amenable for exhaustive state-space exploration, e.g., by SPIN. The protocol is a simple version of the Five Packet Handshake Protocol, which is used in TCP for transmission of single messages.
Elena Fersman, Bengt Jonsson 0001
openaire   +1 more source