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.
