Author:Laura Kovács

EasyChair Preprint no. 12145
EasyChair Preprint no. 12142
EasyChair Preprint no. 10632
EasyChair Preprint no. 10853
EasyChair Preprint no. 10223
EasyChair Preprint no. 9606
EasyChair Preprint no. 9217
EasyChair Preprint no. 8182
EasyChair Preprint no. 6513
EasyChair Preprint no. 5531
EasyChair Preprint no. 5176
EasyChair Preprint no. 4946
EasyChair Preprint no. 2468
EasyChair Preprint no. 98


Algebraic Recurrences, arithmetic, automated deduction, automated reasoning8, automated software verification, automated theorem prover, automated theorem proving4, automating induction, Avatar, AVATAR architecture, clause normal form, consequence finding, Decentralized Protocols, finite fields, first-order logic2, first-order theorem prover, first-order theorem proving6, FOOL, fool formula, formal verification, function calls, game theory, induction5, induction in first-order logic, induction with generalization, inductive benchmarks, Inductive data types, integer induction, integers, interpolation, invariant generation3, linear arithmetic, loop, loop invariants, loop synthesis, next state relation, Optimization, polymorphic arrays, polynomial arithmetic, program analysis2, program synthesis3, program verification3, Quantified First-Order Logic, recursion, Reducibility constraints, redundancy, Resolution Calculus, SAT solving, saturation5, saturation based proof search2, saturation-based theorem proving, Secure Protocols, security analysis, SMT, SMT solving, software correctness, sorting algorithms, static analysis, structural induction2, superposition5, superposition reasoning3, superposition theorem prover, superposition-based theorem proving, symbol elimination, symbolic computation, term algebra2, termination, theorem prover, theorem proving5, translation, Triangular Sets, unification, Unification with Abstraction, Vampire4.