His primary areas of investigation include Programming language, Java, Code, Correctness and Static analysis. His study in the fields of Concurrency and Programmer under the domain of Programming language overlaps with other disciplines such as Abstraction. Eran Yahav has researched Java in several fields, including Heap, Aliasing and Domain.
His research in Code intersects with topics in Theoretical computer science, Executable, Compiler, Similarity and Snippet. His work on Deterministic finite automaton is typically connected to Bounded function as part of general Theoretical computer science study, connecting several disciplines of science. In his research on the topic of Static analysis, Inference, Program specification, State and Abstraction model checking is strongly related with Abstract interpretation.
His primary areas of study are Programming language, Theoretical computer science, Java, Code and Static analysis. His research in Correctness, Heap, Abstract interpretation, Concurrency and Programmer are components of Programming language. His Concurrency study integrates concerns from other disciplines, such as Linearizability, Thread and Parallel computing.
His study in Theoretical computer science is interdisciplinary in nature, drawing from both Finite-state machine, Set and Language model. His studies in Java integrate themes in fields like Synchronization, Scalability, Aliasing and Alias analysis. The Code study combines topics in areas such as Abstract syntax tree, Artificial intelligence, Snippet and Source code.
Eran Yahav spends much of his time researching Code, Programming language, Artificial intelligence, Snippet and Abstract syntax tree. His Code research is multidisciplinary, relying on both Java, Scalability, Compiler and x86. His Programming language research focuses on Static analysis, Program synthesis, Source code, LOOP and Competitive programming.
His Static analysis research integrates issues from Executable, Optimizing compiler, Reverse engineering, Debugging and Assembly language. In the subject of general Artificial intelligence, his work in Adversarial system is often linked to Path and Minor, thereby combining diverse domains of study. His Snippet research is multidisciplinary, incorporating elements of Language model and Natural language processing.
Eran Yahav mostly deals with Code, Theoretical computer science, Snippet, Abstract syntax tree and Language model. His Code research incorporates elements of Java and Adversarial system, Artificial intelligence. His Theoretical computer science study incorporates themes from Formal language, Bottleneck and Conjecture.
His Snippet research is under the purview of Programming language. The study incorporates disciplines such as Set, Aggregate and Semantic property in addition to Abstract syntax tree. Eran Yahav combines subjects such as Counterexample, Conditional probability, Probabilistic logic and Finite-state machine, Algorithm with his study of Language model.
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.
Code completion with statistical language models
Veselin Raychev;Martin Vechev;Eran Yahav.
programming language design and implementation (2014)
Effective typestate verification in the presence of aliasing
Stephen J. Fink;Eran Yahav;Nurit Dor;G. Ramalingam.
ACM Transactions on Software Engineering and Methodology (2008)
code2vec: learning distributed representations of code
Uri Alon;Meital Zilberstein;Omer Levy;Eran Yahav.
Proceedings of the ACM on Programming Languages (2019)
Static Specification Mining Using Automata-Based Abstractions
S. Shoham;E. Yahav;S.J. Fink;M. Pistoia.
IEEE Transactions on Software Engineering (2008)
Abstraction-guided synthesis of synchronization
Martin T. Vechev;Eran Yahav;Greta Yorsh.
symposium on principles of programming languages (2010)
Verifying safety properties of concurrent Java programs using 3-valued logic
symposium on principles of programming languages (2001)
Automatic inference of memory fences
Michael Kuperstein;Martin Vechev;Eran Yahav.
formal methods in computer-aided design (2010)
QVM: an efficient runtime for detecting defects in deployed systems
Matthew Arnold;Martin Vechev;Eran Yahav.
conference on object-oriented programming systems, languages, and applications (2008)
Comparison under abstraction for verifying linearizability
Daphna Amit;Noam Rinetzky;Thomas Reps;Mooly Sagiv.
computer aided verification (2007)
Predicate abstraction and canonical abstraction for singly-linked lists
Roman Manevich;E. Yahav;G. Ramalingam;Mooly Sagiv.
verification, model checking and abstract interpretation (2005)
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: