Author:Laura Kovács| Publications |
|---|
EasyChair Preprint 16032 | EasyChair Preprint 16030 | EasyChair Preprint 16006 | EasyChair Preprint 15785 | EasyChair Preprint 15785 | EasyChair Preprint 13150 | EasyChair Preprint 13150 | EasyChair Preprint 12145 | EasyChair Preprint 12142 | EasyChair Preprint 10632 | EasyChair Preprint 10853 | EasyChair Preprint 10632 | EasyChair Preprint 10223 | EasyChair Preprint 9606 | EasyChair Preprint 9606 | EasyChair Preprint 9606 | EasyChair Preprint 9606 | EasyChair Preprint 9606 | EasyChair Preprint 9217 | EasyChair Preprint 8182 | EasyChair Preprint 6513 | EasyChair Preprint 5531 | EasyChair Preprint 5176 | EasyChair Preprint 4946 | EasyChair Preprint 2468 | EasyChair Preprint 2468 | EasyChair Preprint 98 | | | | | | | | | | | | | | | | | | | | | | | | | | |
KeyphrasesAlgebraic Recurrences, arithmetic2, automated deduction, automated inductive reasoning, automated reasoning15, automated software verification2, automated theorem prover, automated theorem provers, automated theorem proving6, automating induction, Avatar, AVATAR architecture, Benchmarks2, blockchain protocols, clause normal form, consequence finding, Decentralized Protocols, decision procedure, Descision Procedure, finite fields, first-order logic2, first-order theorem prover, first-order theorem proving9, FOOL, fool formula, formal methods, formal models, formal verification, function calls, Game-theoretic security, game theory3, Higher order moments, Hyperproperties2, incentive compatibility, induction6, induction in first-order logic, induction with generalization, inductive benchmarks, Inductive data types, integer induction, integers, interactive theorem proving, interpolation, invariant generation3, invariant synthesis, Lean 4, LIA, linear arithmetic4, LIRA2, literal selection2, logic, logic and types, loop, loop invariants, loop synthesis, LRA, martingale, model checking2, Modeling Template, next state relation, Optimization, optional stopping, polymorphic arrays, polynomial arithmetic, Presburger arithmetic, probabilistic programs, program analysis2, program synthesis3, program verification4, Protocol Modeling, protocol verification, Quantified First-Order Logic, quantifier elimination2, real arithmetic2, recursion, recursive programs, Reducibility constraints, redundancy3, Resolution Calculus, rewriting, SAT solving, saturation6, saturation based proof search2, saturation-based theorem proving, Secure Protocols, Security, security analysis, simplification, SMT7, SMT solving2, software correctness, software verification2, sorting algorithms2, static analysis, structural induction2, superposition8, superposition-based theorem proving, superposition calculus, superposition reasoning3, superposition theorem prover, symbol elimination, symbolic computation, term algebra2, termination, theorem prover, theorem proving5, translation, Triangular Sets, unification, Unification with Abstraction, Vampire4, virtual substitution. |
|