Cesare Tinelli

8.1k total citations · 1 hit paper
73 papers, 1.3k citations indexed

About

Cesare Tinelli is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Software. According to data from OpenAlex, Cesare Tinelli has authored 73 papers receiving a total of 1.3k indexed citations (citations by other indexed papers that have themselves been cited), including 53 papers in Artificial Intelligence, 47 papers in Computational Theory and Mathematics and 20 papers in Software. Recurrent topics in Cesare Tinelli's work include Formal Methods in Verification (40 papers), Logic, programming, and type systems (39 papers) and Logic, Reasoning, and Knowledge (19 papers). Cesare Tinelli is often cited by papers focused on Formal Methods in Verification (40 papers), Logic, programming, and type systems (39 papers) and Logic, Reasoning, and Knowledge (19 papers). Cesare Tinelli collaborates with scholars based in United States, Germany and France. Cesare Tinelli's co-authors include Clark Barrett, Aaron Stump, Albert Oliveras, Robert Nieuwenhuis, Peter Baumgartner, Silvio Ranise, Andrew Reynolds, Calogero G. Zarba, Christel Baier and George Hagen and has published in prestigious journals such as SHILAP Revista de lepidopterología, Communications of the ACM and Artificial Intelligence.

In The Last Decade

Cesare Tinelli

67 papers receiving 1.2k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

The SMT-LIB Standard Version 2.0

2010 335 citations Clark Barrett, Aaron Stump et al. profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Cesare Tinelli United States	17	872	784	447	218	216	73	1.3k
Andreas Podelski Germany	24	1.2k 1.4×	1.1k 1.4×	625 1.4×	227 1.0×	357 1.7×	113	1.7k
Helmut Veith Austria	19	802 0.9×	865 1.1×	547 1.2×	218 1.0×	384 1.8×	60	1.6k
Christian Schallhart United Kingdom	13	547 0.6×	469 0.6×	393 0.9×	299 1.4×	313 1.4×	38	1.1k
Clark Barrett United States	17	705 0.8×	580 0.7×	409 0.9×	161 0.7×	184 0.9×	76	1.1k
Guillaume Brat United States	13	533 0.6×	651 0.8×	978 2.2×	353 1.6×	261 1.2×	46	1.5k
Ofer Strichman Israel	16	415 0.5×	486 0.6×	468 1.0×	198 0.9×	144 0.7×	59	850
Doron Peled United States	22	656 0.8×	1.0k 1.3×	646 1.4×	124 0.6×	287 1.3×	84	1.4k
Natarajan Shankar United States	20	732 0.8×	768 1.0×	379 0.8×	160 0.7×	217 1.0×	53	1.3k
Marjan Sirjani Iran	17	456 0.5×	434 0.6×	281 0.6×	253 1.2×	306 1.4×	102	940
John Derrick United Kingdom	18	628 0.7×	480 0.6×	535 1.2×	396 1.8×	361 1.7×	106	1.2k

Countries citing papers authored by Cesare Tinelli

Since Specialization

Citations

This map shows the geographic impact of Cesare Tinelli's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Cesare Tinelli with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Cesare Tinelli more than expected).

Fields of papers citing papers by Cesare Tinelli

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Cesare Tinelli. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Cesare Tinelli. The network helps show where Cesare Tinelli may publish in the future.

Co-authorship network of co-authors of Cesare Tinelli

This figure shows the co-authorship network connecting the top 25 collaborators of Cesare Tinelli. A scholar is included among the top collaborators of Cesare Tinelli based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Cesare Tinelli. Cesare Tinelli is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Tinelli, Cesare, et al.. (2024). A Comprehensive, Automated Security Analysis of the Uptane Automotive Over-the-Air Update Framework. 594–612.

2.

Abate, Alessandro, Haniel Barbosa, Clark Barrett, et al.. (2023). Synthesising Programs with Non-trivial Constants. Journal of Automated Reasoning. 67(2). 19–19.

3.

Sheng, Ying, Yoni Zohar, Christophe Ringeissen, et al.. (2023). Combining Stable Infiniteness and (Strong) Politeness. Journal of Automated Reasoning. 67(4).

4.

Sheng, Ying, Andres Nötzli, Andrew G. Reynolds, et al.. (2023). Reasoning About Vectors: Satisfiability Modulo a Theory of Sequences. Journal of Automated Reasoning. 67(3). 2 indexed citations

5.

Moitra, Abha, et al.. (2021). VERDICT: A Language and Framework for Engineering Cyber Resilient and Safe System. Systems. 9(1). 18–18. 9 indexed citations

6.

Sattler, Ulrike, et al.. (2019). Description Logic, Theory Combination, and All That: Essays Dedicated to Franz Baader on the Occasion of His 60th Birthday. arXiv (Cornell University). 4 indexed citations

7.

Bansal, Kshitij, Clark Barrett, Andrew Reynolds, & Cesare Tinelli. (2018). Reasoning with Finite Sets and Cardinality Constraints in SMT. SHILAP Revista de lepidopterología. 3 indexed citations

8.

Reynolds, Andrew, Viktor Kunčak, Cesare Tinelli, Clark Barrett, & Morgan Deters. (2017). Refutation-based synthesis in SMT. Formal Methods in System Design. 55(2). 73–102. 12 indexed citations

9.

Liang, Tianyi, Andrew Reynolds, Nestan Tsiskaridze, et al.. (2016). An efficient SMT solver for string constraints. Formal Methods in System Design. 48(3). 206–234. 21 indexed citations

10.

Reynolds, Andrew, Cesare Tinelli, & Leonardo de Moura. (2014). Finding Conflicting Instances of Quantified Formulas in SMT. 195–202. 11 indexed citations

11.

King, Tim L., Clark Barrett, & Cesare Tinelli. (2014). Leveraging Linear and Mixed Integer Programming for SMT. 139–146. 4 indexed citations

12.

Fuchs, Alexander, Amit Kumar Goel, Jim Grundy, Sava Krstić, & Cesare Tinelli. (2012). Ground interpolation for the theory of equality. Logical Methods in Computer Science. Volume 8, Issue 1. 4 indexed citations

13.

Stump, Aaron, Geoff Sutcliffe, & Cesare Tinelli. (2012). Introducing StarExec: a Cross-Community Infrastructure for Logic Solving.. Compare A Journal of Comparative and International Education. 2. 1 indexed citations

14.

Baumgartner, Peter, et al.. (2011). Model Evolution with equality — Revised and implemented. Journal of Symbolic Computation. 47(9). 1011–1045. 12 indexed citations

15.

Barrett, Clark, et al.. (2007). An Abstract Decision Procedure for a Theory of Inductive Data Types. 3(1-2). 21–46. 15 indexed citations

16.

Baader, Franz, Silvio Ghilardi, & Cesare Tinelli. (2006). A new combination procedure for the word problem that generalizes fusion decidability results in modal logics. Information and Computation. 204(10). 1413–1452. 11 indexed citations

17.

Beckert, Bernhard, Tony Hoare, Reiner Hähnle, et al.. (2006). Intelligent Systems and Formal Methods in Software Engineering. IEEE Intelligent Systems. 21(6). 71–81. 19 indexed citations

18.

Baader, Franz & Cesare Tinelli. (2002). Deciding the Word Problem in the Union of Equational Theories. Information and Computation. 178(2). 346–390. 10 indexed citations

19.

Tinelli, Cesare & Christophe Ringeissen. (2002). Unions of non-disjoint theories and combinations of satisfiability procedures. Theoretical Computer Science. 290(1). 291–353. 28 indexed citations

20.

Tinelli, Cesare, et al.. (1998). Constraint Logic Programming over Unions of Constraint Theories.. 1998. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact