PDF-Logical Abstract Interpretation
Sumit Gulwani
Microsoft Research Redmond
UninterpretedFunctions Complexity
149Complexity of congruence closure Onlog n where n is the size of the input formula
150In
Download Presentation
"Logical Abstract Interpretation" is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
Transcript not available.