Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Last revision Both sides next revision | ||
|
sav08:lecture17 [2008/04/23 10:13] vkuncak |
sav08:lecture17 [2008/04/23 16:21] vkuncak |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== Lecture 17: Congruence Closure. Combining Quantifier-Free Models ====== | + | ====== Lecture 17: Congruence Closure ====== |
| ===== Deciding Quantifier-Free FOL ===== | ===== Deciding Quantifier-Free FOL ===== | ||
| Line 18: | Line 18: | ||
| [[Deciding Quantifier-Free FOL over Ground Terms]] | [[Deciding Quantifier-Free FOL over Ground Terms]] | ||
| - | |||
| - | ===== Quantifier-Free Combination of FOL Theories ===== | ||
| - | |||
| - | [[Idea of Quantifier-Free Combination]] | ||
| - | |||
| - | [[Atomic Diagram Normal Form]] | ||
| ===== References ===== | ===== References ===== | ||
| * {{:nelsonoppen80decisionprocedurescongruenceclosure.pdf|Decision Procedures Based on Congruence Closure}} | * {{:nelsonoppen80decisionprocedurescongruenceclosure.pdf|Decision Procedures Based on Congruence Closure}} | ||
| - | * Greg Nelson's PhD thesis: Techniques for Program Verification, Stanford, 1981 | + | * [[http://lara.epfl.ch/~kuncak/lectures/Nelson81TechniquesProgramVerification.pdf|Greg Nelson: Techniques for Program Verification, Stanford, 1981]] |