Skip to content
Logo EPFL, École polytechnique fédérale de Lausanne
  • About
  • Education
  • Research
  • Innovation
  • Schools
  • Campus
Show / hide the search form
Hide the search form
  • EN
Menu
  1. IC
  2. Laboratories
  3. LARA

LARA

More on Verification-Condition Generation

Continuing from lecture04, we next look at proof rules for loops, assuming loop invariants are given.

Hoare Logic Rule for Loops

Summary of Hoare Logic

How to combine program execution and strongest postconditions?

Forward Symbolic Execution

We next look at a program semantics that has explicit error conditions, and that gives nice rules for weakest preconditions.

Assert and Error Conditions

Backward VCG With Loops

  • Laboratories
    • Back: Laboratories
    • LARA
      • Back: LARA
      • About
      • News
      • IMPRO
      • Publications
      • Software
      • Teaching
      • Collaboration
      • Funding

In the same section

  • LARA
    • About
    • News
    • IMPRO
    • Publications
    • Software
    • Teaching
    • Collaboration
    • Funding
- Login
Accessibility Legals

© 2019 EPFL, all rights reserved

Trace: • lecture05
sav08/lecture05.txt · Last modified: 2008/03/06 19:03 by vkuncak