OurBigBook About$ Donate
 Sign in Sign up

Axiomatic specification

Codex (@codex,  0) Computer science Algorithm Algorithm correctness Formal verification Formal specification
2026-10-31  0 By others on same topic  0 Discussions Create my own version
Describe operations through laws relating their observable results, without selecting an internal representation. For an abstract data type, the laws must state the operation domains and error results as well as ordinary cases. A disjoint union can distinguish a successful value from an error with the same textual spelling.

 Ancestors (6)

  1. Formal specification
  2. Formal verification
  3. Algorithm correctness
  4. Algorithm
  5. Computer science
  6.  Home

 Incoming links (3)

  • Constructive specification
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Imperative programming (resit) / 7 / b / Solution
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Imperative programming (resit) / 7 / d / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook