| Download | - View accepted manuscript: Formal Verification Based on Relation Checking in SPIN: A Case Study (PDF, 678 KiB)
|
|---|
| Author | Search for: Erdogmus, Hakan; Search for: Johnston, R.; Search for: Cleary, C. |
|---|
| Format | Text, Article |
|---|
| Conference | Proceedings of the First Workshop on Formal Methods in Software Practice, January 11, 1996., San Diego, California, USA |
|---|
| Abstract | A case study in formal verification of concurrent/distributed software is presented. The study concerns the modular specification and verification of a remote task protocol. The verification methodology used is based on semantic equivalence checking and is applicable to systems with hierarchical architectures. To support the methodology, we extended the verification tool Spin with the ability to check a particular class of semantic relations,and the language Promela upon which Spin is based with a simple mechanism to specify external operations. The foundations of semantic equivalence checking are also discussed briefly. |
|---|
| Publication date | 1996 |
|---|
| Language | English |
|---|
| NRC number | NRCC 39183 |
|---|
| NPARC number | 5765210 |
|---|
| Export citation | Export as RIS |
|---|
| Report a correction | Report a correction (opens in a new tab) |
|---|
| Record identifier | 2236c9d2-5c5a-4e38-a247-c782e780e4a0 |
|---|
| Record created | 2009-03-29 |
|---|
| Record modified | 2020-03-20 |
|---|
