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

Lecture 17: Congruence Closure

Deciding Quantifier-Free FOL

Deciding Quantifier-Free FOL

Notes on Congruences

Congruence Closure Theorem

Partial Congruences

Implementing Congruence Closure

Arrays are Functions

Deciding Quantifier-Free FOL over Ground Terms

Deciding Quantifier-Free FOL over Ground Terms

References

  • Decision Procedures Based on Congruence Closure
  • Greg Nelson: Techniques for Program Verification
  • 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: • lecture17
sav08/lecture17.txt · Last modified: 2008/04/23 16:22 by vkuncak