1 / 12

Provable APIs

Q.E.D. Hour 2. Provable APIs. Homework. Let M be a movement with 1 degree of freedom. Let g(M) be the number of gears in M. Let c(M) be the number of connections in M. Prove c(M) = g(M)-1. Start with one gear. Let M 0 be the movement having one gear. g(M 0 ) = 1. c(M 0 ) = 0.

verena
Download Presentation

Provable APIs

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Q.E.D. Hour 2 Provable APIs

  2. Homework • Let M be a movement with 1 degree of freedom. • Let g(M) be the number of gears in M. • Let c(M) be the number of connections in M. • Prove c(M) = g(M)-1.

  3. Start with one gear • Let M0 be the movement having one gear. • g(M0) = 1. • c(M0) = 0. • c(M0) = g(M0)-1.

  4. Add one gear • Let Mj+1 be a movement constructed by adding one gear to Mj. • Assume c(Mj) = g(Mj)-1. • Prove c(Mj+1) = g(Mj+1)-1. • g(Mj+1) = g(Mj)+1. • c(Mj+1) = c(Mj)+1. • c(Mj+1) = g(Mj)-1 + 1. • c(Mj+1) = g(Mj+1)-1. • Q.E.D.

  5. Bertrand Meyer Only through a precise definition of every module’s claims and responsibilities can we home to attain a significant degree of trust in large software systems.

  6. Unhelpful API

  7. Parameters

  8. Callbacks

  9. Foreign keys

  10. Factories

  11. Constructors

  12. Q.E.D.

More Related