What is he best known for?
The fields of study he is best known for:
- Programming language
- Object-oriented programming
- Operating system
His scientific interests lie mostly in Programming language, Theoretical computer science, Object-oriented programming, Extended static checking and Programmer.
All of his Programming language and Java, Modular design, Java Modeling Language, Compiler and Spec# investigations are sub-components of the entire Programming language study.
His study looks at the intersection of Theoretical computer science and topics like Correctness with Satisfiability modulo theories and Documentation.
K. Rustan M. Leino regularly links together related areas like Software development in his Object-oriented programming studies.
To a larger extent, K. Rustan M. Leino studies Java annotation with the aim of understanding Extended static checking.
The study incorporates disciplines such as Software and State in addition to Programmer.
His most cited work include:
- Extended static checking for Java (1288 citations)
- An overview of JML tools and applications (657 citations)
- Dafny: an automatic program verifier for functional correctness (546 citations)
What are the main themes of his work throughout his whole career to date?
K. Rustan M. Leino mostly deals with Programming language, Theoretical computer science, Object-oriented programming, Software and Spec#.
Satisfiability modulo theories, Modular design, Automated theorem proving, Java and Correctness are the core of his Programming language study.
K. Rustan M. Leino works mostly in the field of Theoretical computer science, limiting it down to concerns involving Object and, occasionally, Class.
His work on Method as part of general Object-oriented programming research is often related to Invariant, thus linking different fields of science.
His research integrates issues of Software engineering and Programmer in his study of Software.
His Spec# research integrates issues from Program verifier, Compiler and Implementation.
He most often published in these fields:
- Programming language (75.18%)
- Theoretical computer science (31.21%)
- Object-oriented programming (17.73%)
What were the highlights of his more recent work (between 2011-2017)?
- Programming language (75.18%)
- Satisfiability modulo theories (12.77%)
- Software engineering (12.77%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Programming language, Satisfiability modulo theories, Software engineering, Software and Theoretical computer science.
His study in the fields of Correctness, Concurrency and Program verifier under the domain of Programming language overlaps with other disciplines such as Context and Simple.
His Software research incorporates themes from High-level programming language, Executable and Programmer.
The various areas that K. Rustan M. Leino examines in his Programmer study include Extended static checking, Java Modeling Language, Java annotation, strictfp and Java.
His research in the fields of Automated theorem proving overlaps with other disciplines such as Automation.
The concepts of his Software development study are interwoven with issues in Real time Java, Interactivity, Formal specification and Generics in Java.
Between 2011 and 2017, his most popular works were:
- This is Boogie 2 (129 citations)
- Behavioral interface specification languages (120 citations)
- Automating induction with an SMT solver (59 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Operating system
- Object-oriented programming
Programming language, Satisfiability modulo theories, Software engineering, Theoretical computer science and Theorem provers are his primary areas of study.
His research related to Correctness, Executable, Modular design, Concurrency and Separation logic might be considered part of Programming language.
His Satisfiability modulo theories research is multidisciplinary, incorporating perspectives in Rewriting, Recursion and Heuristic.
His Software engineering study combines topics in areas such as Functional programming, Compiler, Operational semantics, Dependency graph and Software.
His work in the fields of Theoretical computer science, such as Abstract interpretation, intersects with other areas such as Simple and Automation.
His study in Theorem provers is interdisciplinary in nature, drawing from both Spec# and Predicate abstraction.
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.
