| Bibliography | Dotti, Fernando Luis; König, Barbara; Marchi do Santos, Osmar; Ribeiro, Leila: A Case Study: Verifying a Mutual Exclusion Protocol with Process Creation using Graph Transformation Systems.
University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology, Technical Report Computer Science No. 2004/08.
16 pages, english.
|
|---|
| CR-Schema | D.2.4 (Software Engineering Software/Program Verification)
D.4.1 (Process Management)
F.3.1 (Specifying and Verifying and Reasoning about Programs)
F.4.2 (Grammars and Other Rewriting Systems)
|
|---|
| Keywords | protocol verification; graph transformation systems; mutual exclusion |
|---|
| Abstract | We verify a mutual exclusion protocol with dynamic process creation based on token passing. The protocol is specified using object-based graph grammars. We introduce the protocol and show how the mutual exclusion property and other properties can be verified using the tool Augur, a verification tool for graph transformation systems based on an approximated unfolding technique.
|
|---|
Full text and
other links | PDF (566721 Bytes)
PostScript (1496412 Bytes)
Projekt SANDS
Tool Augur
|
|---|
| Contact | Barbara König koenigba@fmi.uni-stuttgart.de |
|---|
| Department(s) | University of Stuttgart, Institute of Formal Methods in Computer Science, Software Reliability and Security
|
|---|
| Project(s) | SANDS (DFG-Projekt)
DACHIA (BMBF-Projekt)
|
|---|
| Entry date | December 21, 2004 |
|---|