On Set-Driven Combination of Logics and Verifiers LARA Technical Report, February 2, 2009 Viktor Kuncak1 and Thomas Wies1,2 1 2 - Mathematical logic - Document - PDFSEARCH.IO

First Page	Meta Content
	On Set-Driven Combination of Logics and Verifiers LARA Technical Report, February 2, 2009 Viktor Kuncak1 and Thomas Wies1,2 1 2 Add to Reading List Document Date: 2009-02-02 09:55:31 Open Document File Size: 234,71 KB Share Result on Facebook Country Germany / / Facility University of Freiburg / / IndustryTerm loop invariant inference algorithm / machinery / binary search tree / infinite-state systems / over-approximating algorithm / quantifier elimination algorithm / search tree / broader applications / / Organization Switzerland Department of Computer Science / EPFL School of Computer and Communication Sciences / University of Freiburg / / Person Viktor Kuncak / Thomas Wies / / ProgrammingLanguage Java / / Technology quantifier elimination algorithm / Java / loop invariant inference algorithm / over-approximating algorithm / / SocialTag Model theory Logic in computer science Metalogic Predicate logic Proof theory First-order logic Satisfiability Modulo Theories Presburger arithmetic Quantifier elimination Logic

On Set-Driven Combination of Logics and Verifiers LARA Technical Report, February 2, 2009 Viktor Kuncak1 and Thomas Wies1,2 1 2Add to Reading List