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 11: Congruence Closure

Introductory Remarks on SMT Provers

Deciding Quantifier-Free FOL

Deciding Quantifier-Free FOL

Axioms for Equality

Notes on Congruences

Congruence Closure Algorithm and Correctness

Implementing Congruence Closure

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
  • Calculus of Computation Textbook, Section 9.3
  • 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: • tool_compiler_project • lecture_10 • lecture_11
sav09/lecture_11.txt · Last modified: 2009/05/10 22:42 by vkuncak