Aaron Stump

2.5k total citations · 1 hit paper
53 papers, 802 citations indexed

About

Aaron Stump is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Hardware and Architecture. According to data from OpenAlex, Aaron Stump has authored 53 papers receiving a total of 802 indexed citations (citations by other indexed papers that have themselves been cited), including 51 papers in Artificial Intelligence, 39 papers in Computational Theory and Mathematics and 6 papers in Hardware and Architecture. Recurrent topics in Aaron Stump's work include Logic, programming, and type systems (51 papers), Formal Methods in Verification (32 papers) and Logic, Reasoning, and Knowledge (24 papers). Aaron Stump is often cited by papers focused on Logic, programming, and type systems (51 papers), Formal Methods in Verification (32 papers) and Logic, Reasoning, and Knowledge (24 papers). Aaron Stump collaborates with scholars based in United States, Spain and Switzerland. Aaron Stump's co-authors include Clark Barrett, Cesare Tinelli, Andrew W. Appel, Morgan Deters, David L. Dill, Jeremy Levitt, Edwin M. Westbrook, Leonardo de Moura, Albert Oliveras and Dinghao Wu and has published in prestigious journals such as SHILAP Revista de lepidopterología, Information Processing Letters and Compare A Journal of Comparative and International Education.

In The Last Decade

Aaron Stump

47 papers receiving 714 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
Aaron Stump United States	14	596	512	257	124	105	53	802
Reiner Hähnle Germany	15	642 1.1×	431 0.8×	222 0.9×	168 1.4×	158 1.5×	85	843
Michel Bidoit France	13	495 0.8×	535 1.0×	280 1.1×	147 1.2×	141 1.3×	37	855
Robert F. Stärk Switzerland	9	450 0.8×	290 0.6×	152 0.6×	148 1.2×	156 1.5×	31	659
François Laroussinie France	11	326 0.5×	482 0.9×	260 1.0×	85 0.7×	115 1.1×	27	701
Michael Codish Israel	15	600 1.0×	474 0.9×	183 0.7×	71 0.6×	193 1.8×	65	752
Ofer Strichman Israel	16	415 0.7×	486 0.9×	468 1.8×	198 1.6×	144 1.4×	59	850
He Jifeng United Kingdom	15	524 0.9×	429 0.8×	207 0.8×	201 1.6×	138 1.3×	42	766
Béatrice Bérard France	11	256 0.4×	521 1.0×	246 1.0×	90 0.7×	172 1.6×	31	760
Arie Gurfinkel United States	15	404 0.7×	425 0.8×	330 1.3×	187 1.5×	114 1.1×	62	714
Elvira Albert Spain	15	431 0.7×	315 0.6×	164 0.6×	187 1.5×	167 1.6×	72	640

Countries citing papers authored by Aaron Stump

Since Specialization

Citations

This map shows the geographic impact of Aaron Stump'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 Aaron Stump with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Aaron Stump more than expected).

Fields of papers citing papers by Aaron Stump

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Aaron Stump. 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 Aaron Stump. The network helps show where Aaron Stump may publish in the future.

Co-authorship network of co-authors of Aaron Stump

This figure shows the co-authorship network connecting the top 25 collaborators of Aaron Stump. A scholar is included among the top collaborators of Aaron Stump 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 Aaron Stump. Aaron Stump 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.

Stump, Aaron, et al.. (2020). Strong functional pearl: Harper’s regular-expression matcher in Cedille. Proceedings of the ACM on Programming Languages. 4(ICFP). 1–25.

2.

Stump, Aaron. (2018). From realizability to induction via dependent intersection. Annals of Pure and Applied Logic. 169(7). 637–655. 4 indexed citations

3.

Stump, Aaron, Vilhelm Sjöberg, & Stephanie Weirich. (2018). Termination Casts: A Flexible Approach to Termination with General Recursion. EPiC series in computing. 5. 84–66. 1 indexed citations

4.

Stump, Aaron, et al.. (2017). Dualized Simple Type Theory. Logical Methods in Computer Science. Volume 12, Issue 3.

5.

Stump, Aaron, et al.. (2016). Efficiency of lambda-encodings in total type theory. Journal of Functional Programming. 26. 5 indexed citations

6.

Stump, Aaron. (2014). The recursive polarized dual calculus. 3–14. 1 indexed citations

7.

Stump, Aaron, et al.. (2013). Equational reasoning about programs with general recursion and call-by-value semantics. 19–19. 2 indexed citations

8.

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

9.

Stump, Aaron, et al.. (2012). SMT proof checking using a logical framework. Formal Methods in System Design. 42(1). 91–118. 17 indexed citations

10.

Carette, Jacques & Aaron Stump. (2012). Towards typing for small-step direct reflection. 93–96. 1 indexed citations

11.

Stump, Aaron, et al.. (2011). A REWRITING VIEW OF SIMPLE TYPING. 1 indexed citations

12.

Reynolds, Andrew, et al.. (2010). Comparing proof systems for linear real arithmetic LFSC. 3 indexed citations

13.

Barrett, Clark, Aaron Stump, & Cesare Tinelli. (2010). The SMT-LIB Standard Version 2.0. 335 indexed citations breakdown →

14.

Stump, Aaron, et al.. (2009). Verified programming in Guru. 49–58. 24 indexed citations

15.

Stump, Aaron. (2008). Directly reflective meta-programming. 1 indexed citations

16.

Stump, Aaron, et al.. (2005). From Rogue to MicroRogue. Electronic Notes in Theoretical Computer Science. 117. 69–87. 2 indexed citations

17.

Westbrook, Edwin M., et al.. (2005). A language-based approach to functionally correct imperative programming. Open Scholarship Institutional Repository (Washington University in St. Louis). 268–279. 28 indexed citations

18.

Dill, David L. & Aaron Stump. (2002). Checking validities and proofs with CVC and flea. 100(7). 972–6. 3 indexed citations

19.

Stump, Aaron, Clark Barrett, & David L. Dill. (2002). Producing Proofs from an Arithmetic Decision Procedure in Elliptical LF. Electronic Notes in Theoretical Computer Science. 70(2). 29–41. 2 indexed citations

20.

Stump, Aaron, Clark Barrett, David L. Dill, & Jeremy Levitt. (2002). A decision procedure for an extensional theory of arrays. 29–37. 55 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