Name
Abstract | ||
|---|---|---|
We present the architecture and implementation of the proz tool to validate high-level Z specifications. The tool was integrated into prob, by providing a translation of Z into B and by extending the kernel of prob to accommodate some new syntax and data types. We describe the challenge of going from the tool friendly formalism B to the more specification-oriented formalism Z, and show how many Z specifications can be systematically translated into B. We describe the extensions, such as record types and free types, that had to be added to the kernel to support a large subset of Z. As a side-eect, we provide a way to animate and model check records in prob. By incorporating proz into prob, we have inherited many of the recent extensions developed for B, such as the integration with CSP or the animation of recursive functions. Finally, we present a successful industrial application, which makes use of this fact, and where proz was able to discover several errors in Z specifications containing higher-order recursive functions. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-73210-5_25 | IFM |
DocType | Citations | PageRank |
Conference | 14 | 0.77 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Plagge | 1 | 133 | 7.78 |
| Michael Leuschel | 2 | 2156 | 135.89 |