Author image not provided
 Veselin Raychev

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article23.75
Citation Count380
Publication count16
Publication years2010-2018
Available for download14
Average downloads per article479.57
Downloads (cumulative)6,714
Downloads (12 Months)1,643
Downloads (6 Weeks)162
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


16 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 16 of 16
Sort by:

1 published by ACM
June 2018 PLDI 2018: Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 12,   Downloads (12 Months): 125,   Downloads (Overall): 125

Full text available: PDFPDF
Creating and maintaining an up-to-date set of security rules that match misuses of crypto APIs is challenging, as crypto APIs constantly evolve over time with new cryptographic primitives and settings, making existing ones obsolete. To address this challenge, we present a new approach to extract security fixes from thousands of ...
Keywords: Learning, Misuse of Cryptography, Security
Also published in:
December 2018  ACM SIGPLAN Notices - PLDI '18: Volume 53 Issue 4, April 2018

2 published by ACM
January 2018 CCS '18: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 37,   Downloads (12 Months): 169,   Downloads (Overall): 169

Full text available: PDFPDF
We present a novel approach for predicting debug information in stripped binaries. Using machine learning, we first train probabilistic models on thousands of non-stripped binaries and then use these models to predict properties of meaningful elements in unseen stripped binaries. Our focus is on recovering symbol names, types and locations, ...
Keywords: binary code, debug information, machine learning, security

3 published by ACM
October 2016 CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security
Publisher: ACM
Bibliometrics:
Citation Count: 17
Downloads (6 Weeks): 16,   Downloads (12 Months): 202,   Downloads (Overall): 800

Full text available: PDFPDF
This work presents a new approach for deobfuscating Android APKs based on probabilistic learning of large code bases (termed "Big Code"). The key idea is to learn a probabilistic model over thousands of non-obfuscated Android applications and to use this probabilistic model to deobfuscate new, unseen Android APKs. The concrete ...
Keywords: malware inspection, program deobfuscation, reverse engineering

4 published by ACM
October 2016 OOPSLA 2016: Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications
Publisher: ACM
Bibliometrics:
Citation Count: 10
Downloads (6 Weeks): 9,   Downloads (12 Months): 117,   Downloads (Overall): 354

Full text available: PDFPDF
In this paper we introduce a new approach for learning precise and general probabilistic models of code based on decision tree learning. Our approach directly benefits an emerging class of statistical programming tools which leverage probabilistic models of code learned over large codebases (e.g., GitHub) to make predictions about new ...
Keywords: Code Completion, Decision Trees, Probabilistic Models of Code
Also published in:
December 2016  ACM SIGPLAN Notices - OOPSLA '16: Volume 51 Issue 10, October 2016

5
June 2016 ICML'16: Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48
Publisher: JMLR.org
Bibliometrics:
Citation Count: 0

We introduce a new generative model for code called probabilistic higher order grammar (PHOG). PHOG generalizes probabilistic context free grammars (PCFGs) by allowing conditioning of a production rule beyond the parent non-terminal, thus capturing rich contexts relevant to programs. Even though PHOG is more powerful than a PCFG, it can ...

6 published by ACM
January 2016 POPL '16: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Publisher: ACM
Bibliometrics:
Citation Count: 20
Downloads (6 Weeks): 8,   Downloads (12 Months): 84,   Downloads (Overall): 463

Full text available: PDFPDF
We present a new approach for learning programs from noisy datasets. Our approach is based on two new concepts: a regularized program generator which produces a candidate program based on a small sample of the entire dataset while avoiding overfitting, and a dataset sampler which carefully samples the dataset by ...
Keywords: Anomaly Detection, Big Code, Noisy Data, Program Synthesis, Regularization, Statistical Code Completion
Also published in:
April 2016  ACM SIGPLAN Notices - POPL '16: Volume 51 Issue 1, January 2016

7 published by ACM
October 2015 OOPSLA 2015: Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications
Publisher: ACM
Bibliometrics:
Citation Count: 15
Downloads (6 Weeks): 4,   Downloads (12 Months): 34,   Downloads (Overall): 247

Full text available: PDFPDF
Modern event-driven applications, such as, web pages and mobile apps, rely on asynchrony to ensure smooth end-user experience. Unfortunately, even though these applications are executed by a single event-loop thread, they can still exhibit nondeterministic behaviors depending on the execution order of interfering asynchronous events. As in classic shared-memory concurrency, ...
Keywords: Model checking, data races, event-driven applications, partial order reduction, web applications
Also published in:
December 2015  ACM SIGPLAN Notices - OOPSLA '15: Volume 50 Issue 10, October 2015

8 published by ACM
October 2015 OOPSLA 2015: Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications
Publisher: ACM
Bibliometrics:
Citation Count: 26
Downloads (6 Weeks): 2,   Downloads (12 Months): 64,   Downloads (Overall): 260

Full text available: PDFPDF
We present a complete end-to-end dynamic analysis system for finding data races in mobile Android applications. The capabilities of our system significantly exceed the state of the art: our system can analyze real-world application interactions in minutes rather than hours, finds errors inherently beyond the reach of existing approaches, while ...
Keywords: Android, Data Races, Happens-before, Non-determinism
Also published in:
December 2015  ACM SIGPLAN Notices - OOPSLA '15: Volume 50 Issue 10, October 2015

9 published by ACM
October 2015 SOSP '15: Proceedings of the 25th Symposium on Operating Systems Principles
Publisher: ACM
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 10,   Downloads (12 Months): 68,   Downloads (Overall): 882

Full text available: PDFPDF
User-defined aggregations (UDAs) are integral to large-scale data-processing systems, such as MapReduce and Hadoop, because they let programmers express application-specific aggregation logic. System-supported associative aggregations, such as counting or finding the maximum, are data-parallel and thus these systems optimize their execution, leading in many cases to orders-of-magnitude performance improvements. These ...

10 published by ACM
January 2015 POPL '15: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Publisher: ACM
Bibliometrics:
Citation Count: 66
Downloads (6 Weeks): 35,   Downloads (12 Months): 283,   Downloads (Overall): 1,012

Full text available: PDFPDF
We present a new approach for predicting program properties from massive codebases (aka "Big Code"). Our approach first learns a probabilistic model from existing data and then uses this model to predict properties of new, unseen programs. The key idea of our work is to transform the input program into ...
Keywords: big code, closure compiler, conditional random fields, javascript, names, program properties, structured prediction, types
Also published in:
May 2015  ACM SIGPLAN Notices - POPL '15: Volume 50 Issue 1, January 2015

11 published by ACM
October 2014 Onward! 2014: Proceedings of the 2014 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming & Software
Publisher: ACM
Bibliometrics:
Citation Count: 21
Downloads (6 Weeks): 5,   Downloads (12 Months): 57,   Downloads (Overall): 226

Full text available: PDFPDF
Phrase-based statistical machine translation approaches have been highly successful in translating between natural languages and are heavily used by commercial systems (e.g. Google Translate). The main objective of this work is to investigate the applicability of these approaches for translating between programming languages . Towards that, we investigated several variants ...
Keywords: programming language translation, statistical machine translation

12 published by ACM
June 2014 PLDI '14: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher: ACM
Bibliometrics:
Citation Count: 13
Downloads (6 Weeks): 2,   Downloads (12 Months): 14,   Downloads (Overall): 228

Full text available: PDFPDF
This paper introduces the concept of a commutativity race. A commutativity race occurs in a given execution when two library method invocations can happen concurrently yet they do not commute. Commutativity races are an elegant concept enabling reasoning about concurrent interaction at the library interface. We present a dynamic commutativity ...
Also published in:
June 2014  ACM SIGPLAN Notices - PLDI '14: Volume 49 Issue 6, June 2014

13 published by ACM
June 2014 PLDI '14: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher: ACM
Bibliometrics:
Citation Count: 93
Downloads (6 Weeks): 18,   Downloads (12 Months): 313,   Downloads (Overall): 1,098

Full text available: PDFPDF
We address the problem of synthesizing code completions for programs using APIs. Given a program with holes, we synthesize completions for holes with the most likely sequences of method calls. Our main idea is to reduce the problem of code completion to a natural-language processing problem of predicting probabilities of ...
Also published in:
June 2014  ACM SIGPLAN Notices - PLDI '14: Volume 49 Issue 6, June 2014

14 published by ACM
October 2013 OOPSLA '13: Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
Publisher: ACM
Bibliometrics:
Citation Count: 47
Downloads (6 Weeks): 4,   Downloads (12 Months): 59,   Downloads (Overall): 413

Full text available: PDFPDF
Like shared-memory multi-threaded programs, event-driven programs such as client-side web applications are susceptible to data races that are hard to reproduce and debug. Race detection for such programs is hampered by their pervasive use of ad hoc synchronization, which can lead to a prohibitive number of false positives. Race detection ...
Keywords: asynchrony, concurrency, nondeterminism, race detection, web
Also published in:
November 2013  ACM SIGPLAN Notices - OOPSLA '13: Volume 48 Issue 10, October 2013

15 published by ACM
October 2013 OOPSLA '13: Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
Publisher: ACM
Bibliometrics:
Citation Count: 10
Downloads (6 Weeks): 2,   Downloads (12 Months): 51,   Downloads (Overall): 361

Full text available: PDFPDF
Refactoring has become an integral part of modern software development, with wide support in popular integrated development environments (IDEs). Modern IDEs provide a fixed set of supported refactorings, listed in a refactoring menu. But with IDEs supporting more and more refactorings, it is becoming increasingly difficult for programmers to discover ...
Keywords: refactoring, synthesis
Also published in:
November 2013  ACM SIGPLAN Notices - OOPSLA '13: Volume 48 Issue 10, October 2013

16
September 2010 ESA'10: Proceedings of the 18th annual European conference on Algorithms: Part I
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 16

We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic features like: traffic days, walking between stations, queries between geographic locations instead of a source and a target station, ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us