D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 40 Citations 10,065 99 World Ranking 4512 National Ranking 2247

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Operating system
  • Algorithm

His primary areas of investigation include Theoretical computer science, Decidability, Programming language, Model checking and Distributed computing. His research in Theoretical computer science intersects with topics in Class, Active learning and Formal methods. His work deals with themes such as Deterministic context-free language, Recursion and Program specification, which intersect with Decidability.

His study in the field of Pushdown automaton and Concurrency also crosses realms of Weaving and Test harness. P. Madhusudan has included themes like Program analysis and Temporal logic in his Model checking study. His Predicate abstraction research includes themes of Linear temporal logic, Partial order reduction, Correctness, Linear logic and Unsatisfiable core.

His most cited work include:

  • A Temporal Logic of Nested Calls and Returns (3336 citations)
  • Visibly pushdown languages (475 citations)
  • Adding nesting structure to words (290 citations)

What are the main themes of his work throughout his whole career to date?

P. Madhusudan mainly focuses on Theoretical computer science, Decidability, Programming language, Automaton and Discrete mathematics. His Theoretical computer science study is mostly concerned with Model checking and Recursion. His study on Model checking also encompasses disciplines like

  • Monadic predicate calculus which connect with Monad and Second-order logic,
  • Linear temporal logic most often made with reference to Temporal logic.

His work on Undecidable problem is typically connected to Class as part of general Decidability study, connecting several disciplines of science. His study in the fields of Regular language under the domain of Automaton overlaps with other disciplines such as Equivalence. His Discrete mathematics research integrates issues from Nested word and Fragment.

He most often published in these fields:

  • Theoretical computer science (42.18%)
  • Decidability (36.73%)
  • Programming language (24.49%)

What were the highlights of his more recent work (between 2017-2020)?

  • Decidability (36.73%)
  • Theoretical computer science (42.18%)
  • Class (6.80%)

In recent papers he was focusing on the following fields of study:

His primary areas of study are Decidability, Theoretical computer science, Class, Undecidable problem and Programming language. Decidability is a subfield of Discrete mathematics that P. Madhusudan studies. His studies deal with areas such as Automated theorem proving and String as well as Discrete mathematics.

His work carried out in the field of Theoretical computer science brings together such families of science as Classifier, Fragment and Counterexample. P. Madhusudan interconnects Commutative property, Invariant, Algebra and Postcondition in the investigation of issues within Undecidable problem. His study in Programming language is interdisciplinary in nature, drawing from both Reachability and Shared memory.

Between 2017 and 2020, his most popular works were:

  • Horn-ICE learning for synthesizing invariants and contracts (23 citations)
  • Decidable verification of uninterpreted programs (7 citations)
  • Invariant Synthesis for Incomplete Verification Engines (6 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Operating system
  • Algorithm

His scientific interests lie mostly in Decidability, Undecidable problem, Theoretical computer science, Logic in computer science and Algebra. His research integrates issues of Heap, Programming language and Memory safety in his study of Decidability. His Undecidable problem research incorporates themes from Interpretation, Axiom, State and Loop invariant.

His Separation logic and Inductive synthesis investigations are all subjects of Theoretical computer science research. His Logic in computer science research is multidisciplinary, incorporating elements of Time complexity, Mathematical proof, Decision tree and Counterexample. In the field of Algebra, his study on Commutative property, Transitive relation and Modulo overlaps with subjects such as Coherence.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

A Temporal Logic of Nested Calls and Returns

Rajeev Alur;Kousha Etessami;P. Madhusudan.
tools and algorithms for construction and analysis of systems (2004)

3349 Citations

Visibly pushdown languages

Rajeev Alur;P. Madhusudan.
symposium on the theory of computing (2004)

617 Citations

Syntax-Guided Synthesis.

Rajeev Alur;Rastislav Bodík;Eric Dallal;Dana Fisman.
Dependable Software Systems Engineering (2015)

511 Citations

Synthesis of interface specifications for Java classes

Rajeev Alur;Pavol Černý;P. Madhusudan;Wonhong Nam.
symposium on principles of programming languages (2005)

383 Citations

Adding nesting structure to words

Rajeev Alur;P. Madhusudan.
Journal of the ACM (2009)

337 Citations

CANDID: Dynamic candidate evaluations for automatic prevention of SQL injection attacks

Prithvi Bisht;P. Madhusudan;V. N. Venkatakrishnan.
ACM Transactions on Information and System Security (2010)

202 Citations

Decision Problems for Timed Automata : A Survey

Rajeev Alur;P. Madhusudan.
formal methods (2004)

193 Citations

CANDID: preventing sql injection attacks using dynamic candidate evaluations

Sruthi Bandhakavi;Prithvi Bisht;P. Madhusudan;V. N. Venkatakrishnan.
computer and communications security (2007)

192 Citations

A Robust Class of Context-Sensitive Languages

S. La Torre;P. Madhusudan;G. Parlato.
logic in computer science (2007)

165 Citations

Symbolic compositional verification by learning assumptions

Rajeev Alur;P. Madhusudan;Wonhong Nam.
computer aided verification (2005)

154 Citations

Best Scientists Citing P. Madhusudan

Daniel Kroening

Daniel Kroening

Amazon (United States)

Publications: 55

Kim Guldstrand Larsen

Kim Guldstrand Larsen

Aalborg University

Publications: 52

Krishnendu Chatterjee

Krishnendu Chatterjee

Institute of Science and Technology Austria

Publications: 49

Joost-Pieter Katoen

Joost-Pieter Katoen

RWTH Aachen University

Publications: 46

Parosh Aziz Abdulla

Parosh Aziz Abdulla

Uppsala University

Publications: 44

Jun Sun

Jun Sun

Singapore Management University

Publications: 43

Bernhard Steffen

Bernhard Steffen

TU Dortmund University

Publications: 42

Patricia Bouyer

Patricia Bouyer

University of Paris-Saclay

Publications: 40

Thomas Reps

Thomas Reps

University of Wisconsin–Madison

Publications: 39

Rajeev Alur

Rajeev Alur

University of Pennsylvania

Publications: 39

Thomas A. Henzinger

Thomas A. Henzinger

Institute of Science and Technology Austria

Publications: 39

Yang Liu

Yang Liu

Nanyang Technological University

Publications: 36

Holger Hermanns

Holger Hermanns

Saarland University

Publications: 36

Andreas Podelski

Andreas Podelski

University of Freiburg

Publications: 35

Ahmed Bouajjani

Ahmed Bouajjani

Université Paris Cité

Publications: 32

Marta Kwiatkowska

Marta Kwiatkowska

University of Oxford

Publications: 32

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us
Something went wrong. Please try again later.