2026 Cesare Tinelli: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	45	7083	6878	3108	2991	167	11021

Overview

Cesare Tinelli is affiliated with the University of Iowa in the United States. Their research contributions lie primarily within the field of Computer Science, covering a total of 99 publications across various subfields.

The main subfields of study for Tinelli include:

Artificial Intelligence
Computational Theory and Mathematics
Software
Information Systems
Management Science and Operations Research

Tinelli's work focuses on several core topics, such as:

Formal Methods in Verification
Logic, programming, and type systems
Software Testing and Debugging Techniques
Software Reliability and Analysis Research
Model-Driven Software Engineering Techniques
Logic, Reasoning, and Knowledge
Safety Systems Engineering in Autonomy

Their recent publications illustrate a range of interests in system safety, formal verification, and automated reasoning. Key papers include:

"VERDICT: A Language and Framework for Engineering Cyber Resilient and Safe System" (2021), published in Systems
"SYSLITE: Syntax-Guided Synthesis of PLTL Formulas from Finite Traces" (2020), published in reposiTUm (TU Wien)
"Generating and Exploiting Automated Reasoning Proof Certificates" (2023), published in Communications of the ACM
"Reductions for Strings and Regular Expressions Revisited" (2020), published in reposiTUm (TU Wien)
"Towards Satisfiability Modulo Parametric Bit-vectors" (2021), published in Journal of Automated Reasoning

Tinelli has collaborated frequently with several researchers, including:

Clark Barrett
Andrew Reynolds
Yoni Zohar
Haniel Barbosa
Andres Nötzli

Their work has been published extensively in notable venues. Frequent publication outlets include:

arXiv (Cornell University)
Journal of Automated Reasoning
EPiC series in computing
ACM SIGAda Ada Letters
Lecture Notes in Computer Science

Best Publications

Satisfiability Modulo Theories

Clark W. Barrett;Cesare Tinelli

1469
Citations
The SMT-LIB Standard Version 2.0

Clark Barrett;Aaron Stump;Cesare Tinelli

1180
Citations
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Robert Nieuwenhuis;Albert Oliveras;Cesare Tinelli

1151
Citations
cvc5: A Versatile and Industrial-Strength SMT Solver

Unknown

507
Citations
DPLL(T): Fast Decision Procedures

Harald Ganzinger;George Hagen;Robert Nieuwenhuis;Albert Oliveras

446
Citations
Cvc4

Unknown

353
Citations
Starexec: A cross-community infrastructure for logic solving

Aaron Stump;Geoff Sutcliffe;Cesare Tinelli

226
Citations
A New Correctness Proof of the Nelson-Oppen Combination Procedure

Cesare Tinelli;Mehdi T. Harandi

210
Citations
A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions

Tianyi Liang;Andrew Reynolds;Cesare Tinelli;Clark Barrett

168
Citations
Counterexample-Guided Quantifier Instantiation for Synthesis in SMT

Andrew Reynolds;Morgan Deters;Viktor Kuncak;Cesare Tinelli

160
Citations
The SMT-LIB Standard: Version 1.2

Silvio Ranise;Cesare Tinelli

149
Citations
Abstract DPLL and Abstract DPLL Modulo Theories

Robert Nieuwenhuis;Albert Oliveras;Cesare Tinelli

148
Citations
Splitting on demand in SAT modulo theories

Clark Barrett;Robert Nieuwenhuis;Albert Oliveras;Cesare Tinelli

135
Citations
Scaling Up the Formal Verification of Lustre Programs with SMT-Based Techniques

G. Hagen;C. Tinelli

132
Citations
Solving quantified verification conditions using satisfiability modulo theories

Yeting Ge;Clark Barrett;Cesare Tinelli

130
Citations
A DPLL-Based Calculus for Ground Satisfiability Modulo Theories

Cesare Tinelli

129
Citations
The model evolution calculus

Peter Baumgartner;Cesare Tinelli

120
Citations
The Kind 2 Model Checker

Adrien Champion;Alain Mebsout;Christoph Sticksel;Cesare Tinelli

117
Citations
Unions of non-disjoint theories and combinations of satisfiability procedures

Cesare Tinelli;Christophe Ringeissen

109
Citations
Combining Nonstably Infinite Theories

Cesare Tinelli;Calogero G. Zarba

100
Citations
Computing finite models by reduction to function-free clause logic

Peter Baumgartner;Alexander Fuchs;Hans de Nivelle;Cesare Tinelli

89
Citations
Tools and Algorithms for the Construction and Analysis of Systems

Christel Baier;Cesare Tinelli

19
Citations

Frequent Co-Authors

Clark Barrett Stanford University

Franz Baader TU Dresden

Christel Baier TU Dresden

Geoff Sutcliffe University of Miami

Leonardo de Moura Microsoft (United States)

Viktor Kuncak École Polytechnique Fédérale de Lausanne

Scott A. Smolka Stony Brook University

Arie Gurfinkel University of Waterloo

Frank Wolter University of Liverpool

Reiner Hähnle Technical University of Darmstadt

External Links

Personal website of Cesare Tinelli Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

As you consider a Computer Science education in the USA, exploring online degree options can open flexible and affordable pathways to various careers. Many students weigh the benefits of pursuing advanced education while managing work and life commitments.

If cost is a priority, cheap doctoral programs can make it feasible to earn a terminal degree without significant debt. For professionals seeking leadership roles in education or academia, pursuing one of the quickest edd program options may fast-track your credentials and career progression.

Not everyone is ready to commit to a multi-year program. An accelerated associates degree online can provide rapid entry into the job market and build a foundation for further study. Meanwhile, for future tech entrepreneurs or those interested in the business side of technology, exploring business degree programs online can complement your technical skills and broaden your career prospects.

With so many affordable, fast, and flexible options available, students can find an educational path that matches their goals—whether advancing within computer science or branching into related fields.