Yannis Smaragdakis spends much of his time researching Java, Programming language, Static analysis, Algorithm and Program analysis. His work on Software engineering expands to the thematically related Java. His work in Mixin, Data structure, Object-oriented programming, White-box testing and Manual testing are all subfields of Programming language research.
As a part of the same scientific family, Yannis Smaragdakis mostly works in the field of Object-oriented programming, focusing on Implementation and, on occasion, Scalability. His Static analysis research includes themes of Automated theorem proving, Component, Pointer and Static program analysis. While the research belongs to areas of Algorithm, Yannis Smaragdakis spends his time largely on the problem of Extended static checking, intersecting his research to questions surrounding False positive paradox, Usability and Data mining.
Programming language, Java, Static analysis, Theoretical computer science and Object-oriented programming are his primary areas of study. His Java course of study focuses on Heap and Set. His Static analysis research is multidisciplinary, incorporating elements of Program analysis, Soundness, Code, Algorithm and Speedup.
The concepts of his Program analysis study are interwoven with issues in False positive paradox and Scalability. His research integrates issues of Time complexity, Inference and Static program analysis in his study of Theoretical computer science. His work on Mixin as part of general Object-oriented programming research is frequently linked to Engineering drawing, thereby connecting diverse disciplines of science.
Yannis Smaragdakis focuses on Static analysis, Java, Programming language, Artifact and Scalability. His work deals with themes such as Heap, Computer engineering, Code, Benchmark and Speedup, which intersect with Static analysis. His Java research is multidisciplinary, incorporating perspectives in Feature, Machine code and Code generation.
In his works, Yannis Smaragdakis undertakes multidisciplinary study on Programming language and Mathematical proof. His Scalability research integrates issues from Program analysis and Decompiler. In his study, Algorithm is strongly linked to Pointer analysis, which falls under the umbrella field of Artificial intelligence.
His scientific interests lie mostly in Static analysis, Exploit, Scalability, Heap and Java. His Static analysis study is related to the wider topic of Programming language. His studies deal with areas such as Theoretical computer science and Smart contract as well as Exploit.
His Scalability research incorporates elements of Program analysis and Parallel computing. The Heap study combines topics in areas such as Reflection and String analysis. His Java research includes elements of Logical rules, Code generation and Pointer analysis.
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.
JCrasher: an automatic robustness tester for Java
Christoph Csallner;Yannis Smaragdakis.
Software - Practice and Experience (2004)
Mixin layers: an object-oriented implementation technique for refinements and collaboration-based designs
Yannis Smaragdakis;Don Batory.
ACM Transactions on Software Engineering and Methodology (2002)
Implementing layered designs with mixin layers
Y. Smaragdakis;D. Batory.
Lecture Notes in Computer Science (1998)
Strictly declarative specification of sophisticated points-to analyses
Martin Bravenboer;Yannis Smaragdakis.
conference on object-oriented programming systems, languages, and applications (2009)
Check 'n' crash: combining static checking and testing
Christoph Csallner;Yannis Smaragdakis.
international conference on software engineering (2005)
Pick your contexts well: understanding object-sensitivity
Yannis Smaragdakis;Martin Bravenboer;Ondrej Lhoták.
symposium on principles of programming languages (2011)
J-Orchestra: Automatic Java application partitioning
Eli Tilevich;Yannis Smaragdakis.
Lecture Notes in Computer Science (2002)
JTS: tools for implementing domain-specific languages
D. Batory;B. Lofaso;Y. Smaragdakis.
international conference on software reuse (1998)
DSD-Crasher: A hybrid analysis tool for bug finding
Christoph Csallner;Yannis Smaragdakis;Tao Xie.
ACM Transactions on Software Engineering and Methodology (2008)
DySy: dynamic symbolic execution for invariant inference
Christoph Csallner;Nikolai Tillmann;Yannis Smaragdakis.
international conference on software engineering (2008)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
The University of Texas at Austin
Aarhus University
Clemson University
University of Massachusetts Amherst
Carnegie Mellon University
IBM (United States)
Delft University of Technology
University of California, Riverside
Northeastern University
Georgia Institute of Technology
Instituto Superior Técnico
University of Saskatchewan
Kanazawa University
The University of Texas at El Paso
University of Washington
US Forest Service
Central Queensland University
University of East Anglia
University of Reading
Universidade Federal de Minas Gerais
University Hospital Bonn
The University of Texas at Austin
University of Alberta
University of Cambridge
University of Oregon
Prevencasa