A Tale of Two Proofs

One of the touted advantages of formal methods is the ability to do proof . But examples of proofs as part of industrial formal methods projects are relatively hard to find. I describe here two of the large Z proof projects I have been involved in at Logica, and show how the entire specification and proof process is deeply affected by why something is being proved, what is being proved, and how the finished proof is to be presented . I finish off by describing, based on my experiences, what I believe to be the requirements for an industrial-strength Z proof tool.

Content

Author and article information

Contributors

Susan Stepney

Conference

Publication date: September 1998

Publication date (Print): September 1998

Pages: 1-8

Affiliations

[0001]Logica UK Ltd. and University of York

Article

DOI: 10.14236/ewic/NFM1998.15

SO-VID: 6c0859fa-6d49-49a3-b533-815da72b974f

License:

This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Conference name: 3rd BCS-FACS Northern Formal Methods Workshop

Conference acronym: NFM

Conference number: 3

Conference location: Ilkley, UK

Conference date: 14-15 September 1998

Conference sponsor: Electronic Workshops in Computing (eWiC)

Conference theme: BCS-FACS Northern Formal Methods Workshop

History

Product

1477-9358 BCS Learning & Development

Self URI (article page): https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/NFM1998.15

Self URI (journal page): https://ewic.bcs.org/

Celebrating 65 years of The Computer Journal - free-to-read perspectives - bcs.org/tcj65

A Tale of Two Proofs

Abstract