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

Exercise 03

Sufficiently annotated programs from Syntactic Rules for Hoare Logic

Forward Symbolic Execution - How to combine program execution and strongest postconditions.

Quantifier Elimination

Applications of Quantifier Elimination

Quantifier Elimination Definition

QE from Conjunction of Literals Suffices

Simple QE for Dense Linear Orders

Simple QE for Integer Difference Inequalities

Definition of Presburger Arithmetic

Continued in Lab 03

  • 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: • exercise_03
sav12/exercise_03.txt · Last modified: 2012/04/01 20:59 by evka