Download | - View accepted manuscript: Verifying Semantic Relations in SPIN (PDF, 328 KiB)
|
---|
Author | Search for: Erdogmus, Hakan |
---|
Format | Text, Article |
---|
Conference | First SPIN Workshop, October 16, 1995, Verdun, Quebec, Canada |
---|
Abstract | Spin is a general verification tool for proving correctness properties of concurrent/distributed systems specified in the CSP-like modeling language Promela. We extended Promela's syntax to differentiate between external and internal transitions in a given model and the Spin tool with the ability to verify a particular class of semantic relations between two Promela models. This document describes this extension and gives an overview of the relevant theoretical foundations. |
---|
Publication date | 1995 |
---|
In | |
---|
Language | English |
---|
NRC number | NRCC 39182 |
---|
NPARC number | 5765355 |
---|
Export citation | Export as RIS |
---|
Report a correction | Report a correction (opens in a new tab) |
---|
Record identifier | cc0c86b1-43f4-4114-ad96-0cc8db85493e |
---|
Record created | 2009-03-29 |
---|
Record modified | 2020-04-29 |
---|