pith. sign in

arxiv: 1903.04159 · v1 · pith:YLZO24DTnew · submitted 2019-03-11 · 💻 cs.SE

Towards Deriving Verification Properties

classification 💻 cs.SE
keywords propertiesverificationsoftwarecertainformalprocessassumptionbehaviour
0
0 comments X
read the original abstract

Formal software verification uses mathematical techniques to establish that software has certain properties. For example, that the behaviour of a software system satisfies certain logically-specified properties. Formal methods have a long history, but a recurring assumption is that the properties to be verified are known, or provided as part of the requirements elicitation process. This working note considers the question: where do the verification properties come from? It proposes a process for systematically identifying verification properties.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.