Cesare Tinelli

From MaRDI portal
Person:429585

Available identifiers

zbMath Open tinelli.cesareDBLP37/4921WikidataQ57517662 ScholiaQ57517662MaRDI QIDQ429585

List of research outcomes





PublicationDate of PublicationType
SMT-LIB release 2024 (incremental benchmarks)2024-05-13Dataset
Formal Verification of Bit-Vector Invertibility Conditions in Coq2024-05-03Paper
SMT-LIB release 2024 (non-incremental benchmarks)2024-04-24Dataset
High-level abstractions for simplifying extended string constraints in SMT2024-02-16Paper
Invertibility conditions for floating-point formulas2024-02-16Paper
SMT-LIB release 2023 (incremental benchmarks)2024-02-01Dataset
SMT-LIB release 2023 (non-incremental benchmarks)2024-02-01Dataset
Satisfiability modulo finite fields2024-01-12Paper
Combining stable infiniteness and (strong) politeness2023-10-24Paper
Reasoning about vectors: satisfiability modulo a theory of sequences2023-10-24Paper
Synthesising programs with non-trivial constants2023-06-27Paper
Solving quantified bit-vectors using invertibility conditions2023-05-05Paper
Cooperating techniques for solving nonlinear real arithmetic in the \texttt{cvc5} SMT solver (system description)2022-12-07Paper
Even Faster Conflicts and Lazier Reductions for String Solvers2022-12-07Paper
Flexible proof production in an industrial-strength SMT solver2022-12-07Paper
Reasoning about vectors using an SMT theory of sequences2022-12-07Paper
Scalable algorithms for abduction via enumerative syntax-guided synthesis2022-11-09Paper
A decision procedure for string to code point conversion2022-11-09Paper
SMTCoq: a plug-in for integrating SMT solvers into Coq2022-08-12Paper
Scaling up DPLL(T) string solvers using context-dependent simplification2022-08-12Paper
Smt-Switch: a solver-agnostic C++ API for SMT solving2022-03-22Paper
Politeness and stable infiniteness: stronger together2021-12-01Paper
Towards satisfiability modulo parametric bit-vectors2021-11-24Paper
Syntax-guided quantifier instantiation2021-10-18Paper
On solving quantified bit-vector constraints using invertibility conditions2021-08-30Paper
Theory combination: beyond equality sharing2020-06-04Paper
A tour of Franz Baader's contributions to knowledge representation and automated deduction2020-06-04Paper
Syntax-guided rewrite rule enumeration for SMT solvers2020-05-20Paper
Extending SMT solvers to higher-order logic2020-03-10Paper
Towards bit-width-independent proofs in SMT solvers2020-03-10Paper
Refutation-based synthesis in SMT2019-12-18Paper
A New approach for combining decision procedures for the word problem, and its connection to the Nelson-Oppen combination method2019-10-01Paper
https://portal.mardi4nfdi.de/entity/Q45532832018-11-02Paper
Datatypes with shared selectors2018-10-18Paper
Satisfiability Modulo Theories2018-07-20Paper
Counterexample-guided quantifier instantiation for synthesis in SMT2018-03-01Paper
Designing theory solvers with extensions2018-01-04Paper
Constraint solving for finite model finding in SMT solvers2017-11-09Paper
Relational constraint solving in SMT2017-09-22Paper
An efficient SMT solver for string constraints2017-03-28Paper
A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings2017-02-27Paper
A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT2016-09-05Paper
Model Finding for Recursive Functions in SMT2016-09-05Paper
Fine Grained SMT Proofs for the Theory of Fixed-Width Bit-Vectors2016-01-12Paper
Solving SAT and SAT Modulo Theories2015-12-04Paper
SMT proof checking using a logical framework2014-03-28Paper
An abstract decision procedure for satisfiability in the theory of recursive data types2013-12-06Paper
Quantifier Instantiation Techniques for Finite Model Finding in SMT2013-06-14Paper
Combining Non-Stably Infinite Theories2013-04-19Paper
Model evolution with equality -- revised and implemented2012-06-20Paper
Ground interpolation for the theory of equality2012-04-03Paper
Model Evolution with Equality Modulo Built-in Theories2011-07-29Paper
Foundations of Satisfiability Modulo Theories2010-09-29Paper
Automated Deduction – CADE-192010-04-20Paper
Solving quantified verification conditions using satisfiability modulo theories2009-11-16Paper
Ground Interpolation for Combined Theories2009-07-28Paper
The model evolution calculus as a first-order DPLL method2009-07-17Paper
Ground Interpolation for the Theory of Equality2009-03-31Paper
Computing finite models by reduction to function-free clause logic2009-03-25Paper
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories2009-03-06Paper
(LIA) - Model Evolution with Linear Integer Arithmetic Constraints2009-01-27Paper
Splitting on Demand in SAT Modulo Theories2008-05-27Paper
Lemma Learning in the Model Evolution Calculus2008-05-27Paper
An Abstract Framework for Satisfiability Modulo Theories2008-01-04Paper
https://portal.mardi4nfdi.de/entity/Q53090322007-10-09Paper
Automated Reasoning2007-09-25Paper
Combined Satisfiability Modulo Parametric Theories2007-09-03Paper
Combining nonstably infinite theories2006-11-17Paper
Automated Deduction – CADE-202006-11-01Paper
Logics in Artificial Intelligence2006-10-25Paper
A new combination procedure for the word problem that generalizes fusion decidability results in modal logics2006-10-25Paper
Logic for Programming, Artificial Intelligence, and Reasoning2005-11-10Paper
Computer Aided Verification2005-08-25Paper
https://portal.mardi4nfdi.de/entity/Q48087582004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47089272003-06-20Paper
Cooperation of background reasoners in theory reasoning by residue sharing2003-06-09Paper
Unions of non-disjoint theories and combinations of satisfiability procedures2003-01-21Paper
Deciding the word problem in the union of equational theories.2002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q45188742000-12-03Paper
https://portal.mardi4nfdi.de/entity/Q49386052000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q42599711999-09-09Paper
https://portal.mardi4nfdi.de/entity/Q43854391998-07-20Paper

Research outcomes over time

This page was built for person: Cesare Tinelli