An Abstract Domain of Uninterpreted Functions Graeme Gange1 , Jorge A. Navas2 , Peter Schachte1 , Harald Søndergaard1 , and Peter J. Stuckey1 1 2

First Page		Document Content
Date: 2018-08-03 20:31:21 Mathematics Theoretical computer science Logic Automated theorem proving Logic programming Complex analysis Logical truth Propositional calculus Substitution Abstract interpretation Unification Term		An Abstract Domain of Uninterpreted Functions Graeme Gange1 , Jorge A. Navas2 , Peter Schachte1 , Harald Søndergaard1 , and Peter J. Stuckey1 1 2 Add to Reading List Source URL: seahorn.github.io Download Document from Source Website File Size: 515,41 KB Share Document on Facebook

	AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING 1. I NTRODUCTION DocID: 1vah4 - View Document
	Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both for DocID: 1sXwT - View Document
	Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa Johansson DocID: 1sOSK - View Document
	Microsoft Word - BlankPage DocID: 1rugC - View Document
	SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany DocID: 1rrok - View Document