What is she best known for?
The fields of study she is best known for:
- Programming language
- Operating system
- Algorithm
Her primary areas of study are Theoretical computer science, Algorithm, Model checking, Formal verification and Boolean satisfiability problem.
Aarti Gupta interconnects Correctness, And-inverter graph and Source code in the investigation of issues within Theoretical computer science.
Her Algorithm research is multidisciplinary, relying on both Buffer overflow, Program analysis, Set and Pruning.
Her study with Model checking involves better knowledge in Programming language.
Her Formal verification research includes themes of Formal methods, Verification, High-level verification and Intelligent verification.
Her research in Boolean satisfiability problem intersects with topics in #SAT and Heuristics.
Her most cited work include:
- A survey of recent advances in SAT-based formal verification (231 citations)
- System and method for modeling, abstraction, and analysis of software (203 citations)
- Formal hardware verification methods: a survey (166 citations)
What are the main themes of her work throughout her whole career to date?
The scientist’s investigation covers issues in Theoretical computer science, Model checking, Programming language, Algorithm and Formal verification.
Her studies deal with areas such as Graph, Scalability, Correctness and Set as well as Theoretical computer science.
Aarti Gupta has included themes like Computer hardware and Mathematical proof in her Correctness study.
Aarti Gupta has researched Model checking in several fields, including Abstract interpretation, Bounded function and Parallel computing.
Her Formal verification research incorporates themes from Computability, Formal methods and High-level verification.
Her work deals with themes such as #SAT, Propositional calculus, Heuristics and Conjunctive normal form, which intersect with Boolean satisfiability problem.
She most often published in these fields:
- Theoretical computer science (39.24%)
- Model checking (32.49%)
- Programming language (27.43%)
What were the highlights of her more recent work (between 2016-2021)?
- Programming language (27.43%)
- Reachability (6.75%)
- Theoretical computer science (39.24%)
In recent papers she was focusing on the following fields of study:
Aarti Gupta mainly investigates Programming language, Reachability, Theoretical computer science, Software and Model checking.
In general Programming language, her work in Correctness, Program synthesis, Construct and Consistency model is often linked to Abstraction linking many areas of study.
Her work in Reachability addresses subjects such as Routing protocol, which are connected to disciplines such as Isolation.
Her Theoretical computer science research integrates issues from Decision tree and Set.
Her Software study also includes
- Formal specification and Functional specification most often made with reference to Formal equivalence checking,
- System on a chip which intersects with area such as State,
- Microcode and related Access control, Concurrency, Software verification, Embedded system and Thread.
Her Model checking study combines topics in areas such as Information flow, Information security, Lemma and Software engineering.
Between 2016 and 2021, her most popular works were:
- A General Approach to Network Configuration Verification (74 citations)
- Control plane compression (24 citations)
- Quantified Invariants via Syntax-Guided Synthesis (17 citations)
In her most recent research, the most cited papers focused on:
- Programming language
- Operating system
- Algorithm
Her scientific interests lie mostly in Programming language, Theoretical computer science, Range, Syntax and Satisfiability modulo theories.
Her study connects Slicing and Programming language.
She studies Horn clause, a branch of Theoretical computer science.
The study incorporates disciplines such as Java, Symmetry, Exploit and Code in addition to Range.
While the research belongs to areas of Syntax, Aarti Gupta spends her time largely on the problem of Formal grammar, intersecting her research to questions surrounding Encoding, Class, Termination analysis, Refinement and Data modeling.
Her Satisfiability modulo theories research is multidisciplinary, incorporating elements of Gas meter prover, Predicate, Rule-based machine translation, Algebraic data type and Lemma.
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.
