Name
Affiliation
Papers
CESARE TINELLI
University of Iowa
105
Collaborators
Citations 
PageRank 
150
1409
79.86
Referers 
Referees 
References 
1611
1076
1206
Search Limit
1001000
Title
Citations
PageRank
Year
Even Faster Conflicts and Lazier Reductions for String Solvers00.342022
Politeness And Stable Infiniteness: Stronger Together00.342021
Verdict: A Language And Framework For Engineering Cyber Resilient And Safe System00.342021
Towards Satisfiability Modulo Parametric Bit-vectors00.342021
On Solving Quantified Bit-Vector Constraints Using Invertibility Conditions00.342021
Smt-Switch: A Solver-Agnostic C plus plus API for SMT Solving00.342021
First Results on How to Certify Subsumptions Computed by the EL Reasoner ELK Using the Logical Framework with Side Conditions.00.342020
Smt-Switch: a solver-agnostic C++ API for SMT Solving00.342020
Reductions for Strings and Regular Expressions Revisited00.342020
SYSLITE: Syntax-Guided Synthesis of PLTL Formulas from Finite Traces00.342020
Symbolic computation and satisfiability checking00.342020
Scalable Algorithms for Abduction via Enumerative Syntax-Guided Synthesis.00.342020
Syntax-Guided Rewrite Rule Enumeration for SMT Solvers.00.342019
Invertibility Conditions For Floating-Point Formulas10.362019
Theory Combination - Beyond Equality Sharing.00.342019
A Tour of Franz Baader's Contributions to Knowledge Representation and Automated Deduction.00.342019
Towards Bit-Width-Independent Proofs in SMT Solvers.10.362019
Extending enumerative function synthesis via SMT-driven classification00.342019
Deduction Beyond Satisfiability (Dagstuhl Seminar 19371).00.342019
Refutation-based synthesis in SMT40.472019
Cvc4sy: Smart And Fast Term Enumeration For Syntax-Guided Synthesis30.392019
Extending SMT Solvers to Higher-Order Logic.10.352019
High-Level Abstractions For Simplifying Extended String Constraints In Smt10.362019
CVC4 at the SMT Competition 2018.00.342018
Reasoning with Finite Sets and Cardinality Constraints in SMT.00.342018
Solving Quantified Bit-Vectors Using Invertibility Conditions10.362018
Datatypes with Shared Selectors.10.352018
Constraint Solving for Finite Model Finding in SMT Solvers.00.342017
Qualification of a Model Checker for Avionics Software Verification.00.342017
Deduction Beyond First-Order Logic (Dagstuhl Seminar 17371).00.342017
Designing Theory Solvers with Extensions.40.412017
Some advances in tools and algorithms for the construction and analysis of systems.00.342017
A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT.70.462017
Sygus Techniques In The Core Of An Smt Solver00.342017
Special issue of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2015).00.342017
Relational Constraint Solving in SMT.20.352017
Efficient solving of string constraints for security analysis.10.352016
Model Finding for Recursive Functions in SMT.50.422016
Extending Smtcoq, A Certified Checker For Smt10.352016
An efficient SMT solver for string constraints.40.412016
Lazy proofs for DPLL(T)-based SMT solvers.10.352016
The Kind 2 Model Checker100.552016
Proof certificates for SMT-based model checkers for infinite-state systems.00.342016
Counterexample-Guided Quantifier Instantiation for Synthesis in SMT.00.342015
An Automatable Formal Semantics for IEEE-754 Floating-Point Arithmetic120.612015
Fine Grained SMT Proofs for the Theory of Fixed-Width Bit-Vectors.30.412015
Counterexample-Guided Quantifier Instantiation For Synthesis In Smt300.912015
A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings.50.412015
Finding conflicting instances of quantified formulas in SMT150.602014
A Tale of Two Solvers: Eager and Lazy Approaches to Bit-Vectors.20.362014
  • 1
  • 2