P. Madhusudan

9.8k total citations
85 papers, 1.9k citations indexed

About

P. Madhusudan is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Software. According to data from OpenAlex, P. Madhusudan has authored 85 papers receiving a total of 1.9k indexed citations (citations by other indexed papers that have themselves been cited), including 60 papers in Artificial Intelligence, 46 papers in Computational Theory and Mathematics and 19 papers in Software. Recurrent topics in P. Madhusudan's work include Formal Methods in Verification (44 papers), Logic, programming, and type systems (35 papers) and Security and Verification in Computing (20 papers). P. Madhusudan is often cited by papers focused on Formal Methods in Verification (44 papers), Logic, programming, and type systems (35 papers) and Security and Verification in Computing (20 papers). P. Madhusudan collaborates with scholars based in United States, Italy and Germany. P. Madhusudan's co-authors include Rajeev Alur, Gennaro Parlato, Wonhong Nam, Pavol Černý, V. N. Venkatakrishnan, Prithvi Bisht, Xiaokang Qiu, Sruthi Bandhakavi, Azadeh Farzan and Francesco Sorrentino and has published in prestigious journals such as SHILAP Revista de lepidopterología, Communications of the ACM and Journal of the ACM.

In The Last Decade

P. Madhusudan

79 papers receiving 1.8k citations

Peers

P. Madhusudan

CTM

SOFTW

CNC

Flemming Nielson Denmark

Tevfik Bultan United States

Helmut Veith Austria

Koen Claessen Sweden

Michael I. Schwartzbach Denmark

Byron Cook United Kingdom

Andreas Podelski Germany

Işıl Dillig United States

Viktor Kunčak Switzerland

Ralf Lämmel Germany

Flemming Nielson Denmark

P. Madhusudan

1.8k ×1.5

1.2k ×1.4

CTM

785 ×1.1

629 ×0.9

SOFTW

758 ×1.9

CNC

Citations per year, relative to P. Madhusudan P. Madhusudan (= 1×) peers Flemming Nielson

Countries citing papers authored by P. Madhusudan

Since Specialization

Citations

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

Fields of papers citing papers by P. Madhusudan

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of P. Madhusudan

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

Madhusudan, P., et al.. (2025). Synthesizing DSLs for Few-Shot Learning. Proceedings of the ACM on Programming Languages. 9(OOPSLA2). 642–669.

Dinesh, S., P. Madhusudan, & Christopher W. Fletcher. (2024). ConjunCT: Learning Inductive Invariants to Prove Unbounded Instruction Safety Against Microarchitectural Timing Attacks. 3735–3753. 2 indexed citations

Murali, Adithya, et al.. (2023). A First-order Logic with Frames. ACM Transactions on Programming Languages and Systems. 45(2). 1–44.

Murali, Adithya, et al.. (2023). Complete First-Order Reasoning for Properties of Functional Programs. Proceedings of the ACM on Programming Languages. 7(OOPSLA2). 1063–1092.

Madhusudan, P., et al.. (2023). Languages with Decidable Learning: A Meta-theorem. Proceedings of the ACM on Programming Languages. 7(OOPSLA1). 143–171. 1 indexed citations

Madhusudan, P., et al.. (2023). Perception Contracts for Safety of ML-Enabled Systems. Proceedings of the ACM on Programming Languages. 7(OOPSLA2). 2196–2223. 4 indexed citations

Murali, Adithya, et al.. (2022). Synthesizing axiomatizations using logic learning. Proceedings of the ACM on Programming Languages. 6(OOPSLA2). 1697–1725. 2 indexed citations

Murali, Adithya, et al.. (2022). Model-guided synthesis of inductive lemmas for FOL with least fixpoints. Proceedings of the ACM on Programming Languages. 6(OOPSLA2). 1873–1902. 4 indexed citations

Madhusudan, P., et al.. (2022). Learning formulas in finite variable logics. Proceedings of the ACM on Programming Languages. 6(POPL). 1–28. 4 indexed citations

10.

Madhusudan, P., et al.. (2021). Synthesizing contracts correct modulo a test generator. Proceedings of the ACM on Programming Languages. 5(OOPSLA). 1–27. 7 indexed citations

11.

Madhusudan, P., et al.. (2013). Tools and Algorithms for the Construction and Analysis of Systems - TACAS 2013. Springer US. 51 indexed citations

12.

Madhusudan, P. & Sanjit A. Seshia. (2012). Computer Aided Verification 24th International Conference, CAV 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 4 indexed citations

13.

Bandhakavi, Sruthi, Samuel T. King, P. Madhusudan, & Marianne Winslett. (2010). VEX: vetting browser extensions for security vulnerabilities. USENIX Security Symposium. 22–22. 76 indexed citations

14.

Farzan, Azadeh & P. Madhusudan. (2007). Causal dataflow analysis for concurrent programs. Lecture notes in computer science. 102–116. 3 indexed citations

15.

Alur, Rajeev, Salvatore La Torre, & P. Madhusudan. (2005). Perturbed timed automata. Lecture notes in computer science. 3414. 70–85. 4 indexed citations

16.

Alur, Rajeev, Salvatore La Torre, & P. Madhusudan. (2005). Modular strategies for recursive game graphs. Theoretical Computer Science. 354(2). 230–249. 16 indexed citations

17.

Alur, Rajeev, et al.. (2004). Optimal reachability for weighted timed games. Lecture notes in computer science. 3142. 122–133. 5 indexed citations

18.

Löding, Christof, P. Madhusudan, & Olivier Serre. (2004). Visibly pushdown games. Lecture notes in computer science. 3328. 408–420. 6 indexed citations

19.

D’Souza, Deepak & P. Madhusudan. (2002). Timed control synthesis for external specifications. Lecture notes in computer science. 2285. 571–582. 2 indexed citations

20.

Madhusudan, P. & P. S. Thiagarajan. (2002). Branching time controllers for discrete event systems. Theoretical Computer Science. 274(1-2). 117–149. 25 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