The Formal Verification of the Fairisle ATM Switching Element
The work
| Authors | Paul Curzon |
|---|---|
| Editors | |
| Type | techreport |
| Year | 1994 |
| Citekey | curzon1994formal |
Where it appeared
| Publisher | University of Cambridge Computer Laboratory |
|---|---|
| Number in series | UCAM-CL-TR-329 |
| School | University of Cambridge Computer Laboratory |
| Pages | 113 |
Identifiers
| DOI | 10.48456/tr-329 |
|---|---|
| report_number | UCAM-CL-TR-329 |
Access
| URL | https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-329.html |
|---|---|
| Landing page | https://www.cl.cam.ac.uk/ftp/hvg/papers/LitFabric.ps.gz |
Related
| Distinct from | billington1987highlevel |
|---|---|
| Distinct from | curzon1994formalb |
| Distinct from | herbert1988case |
| Distinct from | hopper1986cambridge |
| Distinct from | winskel1987relating |
| Distinct from | wong1993formal |
From bibtex.
Abstract
We describe the formal verification of an implementation of the switching element of the fairisle ATM switch. This verification was performed using the HOL90 theorem proving system so is fully machine-checked. We give here all the definitions used in the verification together with the main correctness theorems proved. Fairisle switches are in use in a working network, switching real data. Thus, this work constitutes a realistic formal verification case study.
A copy is held
pdf, 442.3 kB. Not published — it may be under copyright. The facts and links here are.
How it got here
| How it got here | agent via bibtex |
|---|---|
| Added | 2026-09-16 02:43 UTC |
| Approved by | a person 2026-10-02 10:02 UTC |
Cite it as
@techreport{curzon1994formal,
title = {The Formal Verification of the Fairisle ATM Switching Element},
author = {Paul Curzon},
year = {1994},
publisher = {University of Cambridge Computer Laboratory},
school = {University of Cambridge Computer Laboratory},
pages = {113},
doi = {10.48456/tr-329},
}
This record lives at https://refs.drheap.org/curzon1994formal/ and will keep doing so.