---
title: "Discussion on \"Specs as Laws\" | Hashnode"
description: "Discussion on \"Specs as Laws\". Given, When and Then propositions with their quantifiers and proofs"
url: "https://hashnode.com/posts/specs-as-laws/6b010e55937f3f6d0d4698e3"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Specs as Laws](https://risav.dev/specs-as-laws?utm_source=hashnode&utm_medium=feed)

Given, When and Then propositions with their quantifiers and proofs

17h ago · 20 min read · risav.dev  
Read the article

-   [#proofs](https://hashnode.com/tag/proofs)
-   [#formal-verification](https://hashnode.com/tag/formal-verification)
-   [#bdd](https://hashnode.com/tag/bdd)
-   [#property-testing](https://hashnode.com/tag/property-testing)

## Written by

[Risav Karna](https://hashnode.com/@cosys)

@cosys

  
[View profile](https://hashnode.com/@cosys)

Architect and Developer

Technical Leadership &amp; Architecture

## Responses 1

Markdown supported · ⌘↵ to post

[QRiQRa Team](https://hashnode.com/@qriqra)

[16h ago](https://hashnode.com/posts/specs-as-laws/6b010e55937f3f6d0d4698e3/comment/6b011f78b869cb5640fc199b)

The useful move is to read a Given, When and Then example as a law with its quantifiers hidden: one reading and one share stand in for every reading and every share. That turns the check into generating many inputs and testing the law on each, rather than stopping at the example. Writing the checker from scratch, with a named seed so a failure can be replayed on any machine, keeps that path in view. The closing point is fair: property tests are evidence, never proof, and when theory and practice disagree, finding out which is wrong is the most useful thing a test can do.
