Hana Chockler

2.0k total citations · 1 hit paper
45 papers, 810 citations indexed

About

Hana Chockler is a scholar working on Computational Theory and Mathematics, Software and Artificial Intelligence. According to data from OpenAlex, Hana Chockler has authored 45 papers receiving a total of 810 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 19 papers in Software and 16 papers in Artificial Intelligence. Recurrent topics in Hana Chockler's work include Formal Methods in Verification (21 papers), Software Testing and Debugging Techniques (18 papers) and Software Reliability and Analysis Research (16 papers). Hana Chockler is often cited by papers focused on Formal Methods in Verification (21 papers), Software Testing and Debugging Techniques (18 papers) and Software Reliability and Analysis Research (16 papers). Hana Chockler collaborates with scholars based in Israel, United States and United Kingdom. Hana Chockler's co-authors include Joseph Y. Halpern, Alexander Ivrii, Gadi Aleksandrowicz, Orna Kupferman, Ofer Strichman, Moshe Y. Vardi, Dan Gutfreund, Arie Matsliah, Gregory Chockler and Ilan Beer and has published in prestigious journals such as IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Theoretical Computer Science and Lecture notes in computer science.

In The Last Decade

Hana Chockler

42 papers receiving 775 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.

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence

2014 298 citations Gadi Aleksandrowicz, Hana Chockler et al. profile →

Peers

Hana Chockler

AI

CTM

SOFTW

IS

CNC

Alan W. Biermann United States

Julie Sussman United States

Marc Denecker Belgium

Brett Stevens Canada

Shi Feng China

Dean Allemang United States

Eugene Santos United States

John Aycock Canada

Hahn-Ming Lee Taiwan

Bill MacCartney United States

Alan W. Biermann United States

Hana Chockler

1.1k ×2.6

AI

288 ×1.3

CTM

265 ×1.7

SOFTW

385 ×2.5

IS

188 ×1.8

CNC

Citations per year, relative to Hana Chockler Hana Chockler (= 1×) peers Alan W. Biermann

Countries citing papers authored by Hana Chockler

Since Specialization

Citations

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

Fields of papers citing papers by Hana Chockler

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Hana Chockler

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

Chockler, Hana & Joseph Y. Halpern. (2024). Explaining Image Classifiers. 264–272. 1 indexed citations

2.

Brennan, Paul, et al.. (2023). Challenges in Explaining Brain Tumor Detection. 1–8. 3 indexed citations

3.

Chockler, Hana, et al.. (2023). Quantifying Harm. UvA-DARE (University of Amsterdam). 363–371. 1 indexed citations

4.

Bloem, Roderick, et al.. (2022). Specifiable robustness in reactive synthesis. Formal Methods in System Design. 60(2). 259–276. 3 indexed citations

5.

Chockler, Hana & Joseph Y. Halpern. (2022). On Testing for Discrimination Using Causal Models. Proceedings of the AAAI Conference on Artificial Intelligence. 36(5). 5548–5555.

6.

Sun, Youcheng, Hana Chockler, Xiaowei Huang, & Daniel Kroening. (2019). Explaining Deep Neural Networks Using Spectrum-Based Fault Localization. arXiv (Cornell University). 2 indexed citations

7.

Fedyukovich, Grigory, et al.. (2018). Function Summarization Modulo Theories. EPiC series in computing. 57. 56–35. 3 indexed citations

8.

Chockler, Hana & Georg Weißenbacher. (2018). Computer Aided Verification. Lecture notes in computer science. 2 indexed citations

9.

Alrajeh, Dalal, Hana Chockler, & Joseph Y. Halpern. (2018). Combining Experts’ Causal Judgments. Proceedings of the AAAI Conference on Artificial Intelligence. 32(1). 1 indexed citations

10.

Aleksandrowicz, Gadi, Hana Chockler, Joseph Y. Halpern, & Alexander Ivrii. (2017). The Computational Complexity of Structure-Based Causality. Journal of Artificial Intelligence Research. 58. 431–451. 9 indexed citations

11.

Chockler, Hana & Sitvanit Ruah. (2012). Verification of software changes with ExpliSAT. 31–35. 1 indexed citations

12.

Chockler, Hana, Daniel Kroening, & Mitra Purandare. (2012). Computing Mutation Coverage in Interpolation-Based Model Checking. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 31(5). 765–778. 2 indexed citations

13.

Chockler, Hana, et al.. (2011). Incremental formal verification of hardware. 135–143. 31 indexed citations

14.

Beer, Ilan, et al.. (2011). Explaining counterexamples using causality. Formal Methods in System Design. 40(1). 20–40. 41 indexed citations

15.

Chockler, Hana, Arie Gurfinkel, & Ofer Strichman. (2008). Beyond Vacuity: Towards the Strongest Passing Formula. Research Portal (King's College London). 137. 1–8. 5 indexed citations

16.

Chockler, Hana & Ofer Strichman. (2007). Easier and More Informative Vacuity Checks. 189–198. 17 indexed citations

17.

Chockler, Hana, Eitan Farchi, Benny Godlin, & S P Novikov. (2007). Cross-Entropy Based Testing. 101–108. 7 indexed citations

18.

Chockler, Hana, Orna Kupferman, & Moshe Y. Vardi. (2006). Coverage metrics for temporal logic model checking*. Formal Methods in System Design. 28(3). 189–212. 19 indexed citations

19.

Chockler, Hana & Orna Kupferman. (2004). ω-Regular languages are testable with a constant number of queries. Theoretical Computer Science. 329(1-3). 71–92. 6 indexed citations

20.

Chockler, Hana & Uri Zwick. (2001). Which formulae shrink under random restrictions. Symposium on Discrete Algorithms. 702–708. 1 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