Author:Laura Kovács

Keyphrases

Algebraic Recurrences, arithmetic², automated deduction, automated inductive reasoning, automated reasoning¹¹, automated software verification², automated theorem prover, automated theorem proving⁵, automating induction, Avatar, AVATAR architecture, blockchain protocols, clause normal form, consequence finding, Decentralized Protocols, decision procedure, Descision Procedure, finite fields, first-order logic², first-order theorem prover, first-order theorem proving⁷, FOOL, fool formula, formal methods, formal verification, function calls, game theory, Game-theoretic security, incentive compatibility, induction⁶, induction in first-order logic, induction with generalization, inductive benchmarks, Inductive data types, integer induction, integers, interpolation, invariant generation³, LIA, linear arithmetic², LIRA², logic, loop, loop invariants, loop synthesis, LRA, next state relation, Optimization, polymorphic arrays, polynomial arithmetic, Presburger arithmetic, program analysis², program synthesis³, program verification³, protocol verification, Quantified First-Order Logic, quantifier elimination², recursion, recursive programs, Reducibility constraints, redundancy, Resolution Calculus, rewriting, SAT solving, saturation⁶, saturation based proof search², saturation-based theorem proving, Secure Protocols, security analysis, SMT³, SMT solving, software correctness, sorting algorithms², static analysis, structural induction², superposition⁶, superposition calculus, superposition reasoning³, superposition theorem prover, superposition-based theorem proving, symbol elimination, symbolic computation, term algebra², termination, theorem prover, theorem proving⁵, translation, Triangular Sets, unification, Unification with Abstraction, Vampire⁴, virtual substitution.