Author image not provided
 Martin T Vechev

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article15.18
Citation Count1,199
Publication count79
Publication years2004-2019
Available for download65
Average downloads per article416.72
Downloads (cumulative)27,087
Downloads (12 Months)9,119
Downloads (6 Weeks)667
SEARCH
ROLE
Arrow RightAuthor only
· Other only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


79 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 79
Result page: 1 2 3 4

Sort by:

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

Full text available: PDFPDF
Real world applications make heavy use of powerful libraries and frameworks, posing a significant challenge for static analysis as the library implementation may be very complex or unavailable. Thus, obtaining specifications that summarize the behaviors of the library is important as it enables static analyzers to precisely track the effects ...
Keywords: big code, pointer analysis, specification, unsupervised machine learning

2 published by ACM
June 2019 PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 9,   Downloads (12 Months): 50,   Downloads (Overall): 50

Full text available: PDFPDF
We present a new scalable, semi-supervised method for inferring taint analysis specifications by learning from a large dataset of programs. Taint specifications capture the role of library APIs (source, sink, sanitizer) and are a critical ingredient of any taint analyzer that aims to detect security violations based on information flow. ...
Keywords: Big Code, Specification Inference, Taint Analysis

3 published by ACM
February 2019 Communications of the ACM: Volume 62 Issue 3, March 2019
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 247,   Downloads (12 Months): 4,034,   Downloads (Overall): 4,034

Full text available: HtmlHtml  PDFPDF
We present a new approach for predicting program properties from large codebases (aka "Big Code"). Our approach learns a probabilistic model from "Big Code" and uses this model to predict properties of new, unseen programs. The key idea of our work is to transform the program into a representation that ...

4 published by ACM
January 2019 Proceedings of the ACM on Programming Languages: Volume 3 Issue POPL, January 2019
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 40,   Downloads (12 Months): 547,   Downloads (Overall): 547

Full text available: PDFPDF
We present a novel method for scalable and precise certification of deep neural networks. The key technical insight behind our approach is a new abstract domain which combines floating point polyhedra with intervals and is equipped with abstract transformers specifically tailored to the setting of neural networks. Concretely, we introduce ...
Keywords: Abstract Interpretation, Adversarial attacks, Deep Learning

5
December 2018 NIPS'18: Proceedings of the 32nd International Conference on Neural Information Processing Systems
Publisher: Curran Associates Inc.
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2,   Downloads (12 Months): 2,   Downloads (Overall): 2

Full text available: PDFPDF
We present a new approach for learning to solve SMT formulas. We phrase the challenge of solving SMT formulas as a tree search problem where at each step a transformation is applied to the input formula until the formula is solved. Our approach works in two phases: first, given a ...

6
December 2018 NIPS'18: Proceedings of the 32nd International Conference on Neural Information Processing Systems
Publisher: Curran Associates Inc.
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 2,   Downloads (Overall): 2

Full text available: PDFPDF
We present a new method and system, called DeepZ , for certifying neural network robustness based on abstract interpretation. Compared to state-of-the-art automated verifiers for neural networks, DeepZ: (i) handles ReLU, Tanh and Sigmoid activation functions, (ii) supports feedforward and convolutional architectures, (iii) is significantly more scalable and precise, and ...

7 published by ACM
October 2018 Proceedings of the ACM on Programming Languages: Volume 2 Issue OOPSLA, November 2018
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 27,   Downloads (12 Months): 277,   Downloads (Overall): 277

Full text available: PDFPDF
We present a novel approach for synthesizing robust relational layouts from examples. Given an application design consisting of a set of views and their location on the screen, we synthesize a relational layout that when rendered, places the components at that same location. We present an end-to-end system, called InferUI, ...
Keywords: Probabilistic models, Program synthesis, Programming by example, Relational layouts, User interface design, User interface errors

8 published by ACM
September 2018 ACM Transactions on Parallel Computing (TOPC) - Special Issue on SPAA 2015: Volume 4 Issue 4, September 2018
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 5,   Downloads (12 Months): 46,   Downloads (Overall): 46

Full text available: PDFPDF
Dynamic race detection is a program analysis technique for detecting errors caused by undesired interleavings of concurrent tasks. A primary challenge when designing efficient race detection algorithms is to achieve manageable space requirements. State-of-the-art algorithms for unstructured parallelism require Θ ( n ) space per monitored memory location, where n ...
Keywords: Race conditions, lowest common ancestors, parallel language constructs, race detection, structured parallelism, two-dimensional lattices

9
August 2018 SEC'18: Proceedings of the 27th USENIX Conference on Security Symposium
Publisher: USENIX Association
Bibliometrics:
Citation Count: 0

Simple path tracing tools such as traceroute allow malicious users to infer network topologies remotely and use that knowledge to craft advanced denial-of-service (DoS) attacks such as Link-Flooding Attacks (LFAs). Yet, despite the risk, most network operators still allow path tracing as it is an essential network debugging tool. In ...

10 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: 1
Downloads (6 Weeks): 7,   Downloads (12 Months): 100,   Downloads (Overall): 165

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

11 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: 1
Downloads (6 Weeks): 8,   Downloads (12 Months): 93,   Downloads (Overall): 140

Full text available: PDFPDF
Many distributed databases provide only weak consistency guarantees to reduce synchronization overhead and remain available under network partitions. However, this leads to behaviors not possible under stronger guarantees. Such behaviors can easily defy programmer intuition and lead to errors that are notoriously hard to detect. In this paper, we propose ...
Keywords: causal consistency, serializability, static analysis
Also published in:
December 2018  ACM SIGPLAN Notices - PLDI '18: Volume 53 Issue 4, April 2018

12 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: 1
Downloads (6 Weeks): 3,   Downloads (12 Months): 107,   Downloads (Overall): 151

Full text available: PDFPDF
Network operators often need to ensure that important probabilistic properties are met, such as that the probability of network congestion is below a certain threshold. Ensuring such properties is challenging and requires both a suitable language for probabilistic networks and an automated procedure for answering probabilistic inference queries. We present ...
Keywords: Computer Networks, Probabilistic Programming
Also published in:
December 2018  ACM SIGPLAN Notices - PLDI '18: Volume 53 Issue 4, April 2018

13 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: 2
Downloads (6 Weeks): 7,   Downloads (12 Months): 156,   Downloads (Overall): 217

Full text available: PDFPDF
We present a novel approach for approximate sampling in probabilistic programs based on incremental inference. The key idea is to adapt the samples for a program P into samples for a program Q , thereby avoiding the expensive sampling computation for program Q . To enable incremental inference in probabilistic ...
Keywords: Probabilistic programming, incremental computation, sequential Monte Carlo
Also published in:
December 2018  ACM SIGPLAN Notices - PLDI '18: Volume 53 Issue 4, April 2018

14
April 2018 NSDI'18: Proceedings of the 15th USENIX Conference on Networked Systems Design and Implementation
Publisher: USENIX Association
Bibliometrics:
Citation Count: 0

Today network operators spend a significant amount of time struggling to understand how their network forwards traffic. Even simple questions such as " How is my network handling Google traffic? " often require operators to manually bridge large semantic gaps between lowlevel forwarding rules distributed across many routers and the ...

15
April 2018 NSDI'18: Proceedings of the 15th USENIX Conference on Networked Systems Design and Implementation
Publisher: USENIX Association
Bibliometrics:
Citation Count: 0

Network operators often need to adapt the configuration of a network in order to comply with changing routing policies. Evolving existing configurations, however, is a complex task as local changes can have unforeseen global effects. Not surprisingly, this often leads to mistakes that result in network downtimes. We present NetComplete, ...

16 published by ACM
February 2018 PPoPP '18: Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 5,   Downloads (12 Months): 79,   Downloads (Overall): 169

Full text available: PDFPDF
Operations of concurrent objects often employ optimistic concurrency-control schemes that consist of a traversal followed by a validation step. The validation checks if concurrent mutations interfered with the traversal to determine if the operation should proceed or restart. A fundamental challenge is to discover a necessary and sufficient validation check ...
Keywords: concurrency, search trees
Also published in:
March 2018  ACM SIGPLAN Notices - PPoPP '18: Volume 53 Issue 1, January 2018

17 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): 15,   Downloads (12 Months): 310,   Downloads (Overall): 310

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

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

Full text available: PDFPDF
Permissionless blockchains allow the execution of arbitrary programs (called smart contracts), enabling mutually untrusted entities to interact without relying on trusted third parties. Despite their potential, repeated security concerns have shaken the trust in handling billions of USD by smart contracts. To address this problem, we present Securify, a security ...
Keywords: security analysis, smart contracts, stratified datalog, verification

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

Full text available: PDFPDF
We present DP-Finder, a novel approach and system that automatically derives lower bounds on the differential privacy enforced by algorithms. Lower bounds are practically useful as they can show tightness of existing upper bounds or even identify incorrect upper bounds. Computing a lower bound involves searching for a counterexample, defined ...
Keywords: differential privacy, lower bounds, optimization, sampling

20 published by ACM
December 2017 Proceedings of the ACM on Programming Languages: Volume 2 Issue POPL, January 2018
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 6,   Downloads (12 Months): 77,   Downloads (Overall): 155

Full text available: PDFPDF
Numerical abstract domains such as Polyhedra, Octahedron, Octagon, Interval, and others are an essential component of static program analysis. The choice of domain offers a performance/precision tradeoff ranging from cheap and imprecise (Interval) to expensive and precise (Polyhedra). Recently, significant speedups were achieved for Octagon and Polyhedra by manually decomposing ...
Keywords: Abstract Interpretation, Domain Decomposition, Numerical Domains, Performance Optimization



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