OurBigBook About$ Donate
 Sign in Sign up

Constructive 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
Specify behavior by constructing a mathematical model and defining the operations on that model. Finite sequences model a FIFO queue: insertion appends, the head is the first element, and successful deletion removes it. An axiomatic specification can then be checked against the model without requiring the implementation to use that representation.

 Ancestors (6)

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

 Incoming links (1)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2017 / Imperative programming (resit) / 7 / b / 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