BibSLEIGH — Martin_T

Travelled to:

1 × China
1 × France
1 × Germany
1 × Ireland
1 × South Korea
1 × Spain
16 × USA
2 × India
3 × Canada
3 × United Kingdom

Collaborated with:

E.Yahav V.Raychev P.Bielik T.Gehr G.Singh M.Püschel D.F.Bacon D.Dimitrov G.Yorsh A.M.Dan M.Sridharan B.Bichsel Y.Meshman P.Tsankov O.Shacham L.Vanbever M.M.Michael P.Cheng D.Grove S.Misailovic L.Brutschy P.M.0001 R.Raman V.Sarkar A.El-Hassany J.Ou O.Hilliges A.Krause S.Karaivanov D.Drachsler M.Kuperstein V.A.Saraswat M.Arnold Marc Fischer A.Aiken N.G.Bronson M.Sagiv E.Koskinen M.Schäfer B.Petrov J.Dolby E.Aftandilian S.Z.Guyer A.Raman N.Rinetzky Patrick Lam 0001 T.Hoefler Andreas Krause 0001 Rumen Paletov Victor Chibotaru Jan Eberhardt Samuel Steffen C.S.Jensen A.Møller F.Liu N.Nedev N.Prisadnikov J.Zhao S.C.0001 J.Jeannin Jeremie Miserez Marco Cusumano-Towner V.K.Mansinghka H.Attiya R.Guerraoui D.Hendler P.Kuznetsov Pascal Wiesmann G.Golan-Gueta

Talks about:

program (11) concurr (10) model (8) synthesi (7) abstract (7) analysi (6) memori (6) detect (6) infer (6) probabilist (5)

Person: Martin T. Vechev

DBLP: Vechev:Martin_T=

Facilitated 2 volumes:

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2018

2016

2017

2018

2016

2018

2016

2017

2018

2019

Wrote 59 papers:

CAV-2015-GehrDV #commutative #learning #specification: Learning Commutativity Specifications (TG, DD, MTV), pp. 307–323.
CHI-2015-OuVH #data type #development #interactive: An Interactive System for Data Structure Development (JO, MTV, OH), pp. 3053–3062.
OOPSLA-2015-BielikRV #android #concurrent #detection #scalability: Scalable race detection for Android applications (PB, VR, MTV), pp. 332–348.
OOPSLA-2015-JensenMRDV #model checking: Stateless model checking of event-driven applications (CSJ, AM, VR, DD, MTV), pp. 57–73.
PLDI-2015-SinghPV #performance #program analysis: Making numerical program analysis fast (GS, MP, MTV), pp. 303–313.
POPL-2015-RaychevVK #predict: Predicting Program Properties from “Big Code” (VR, MTV, AK), pp. 111–124.
VMCAI-2015-DanMVY #abstraction #effectiveness #memory management #modelling #verification: Effective Abstractions for Verification under Relaxed Memory Models (AMD, YM, MTV, EY), pp. 449–466.
ISSTA-2014-ShachamYGABSV #independence #verification: Verifying atomicity via data independence (OS, EY, GGG, AA, NGB, MS, MTV), pp. 26–36.
Onward-2014-KaraivanovRV #programming language #statistics: Phrase-Based Statistical Translation of Programming Languages (SK, VR, MTV), pp. 173–184.
PLDI-2014-DimitrovRVK #commutative #concurrent #detection: Commutativity race detection (DD, VR, MTV, EK), p. 33.
PLDI-2014-RaychevVY #code completion #modelling #statistics: Code completion with statistical language models (VR, MTV, EY), p. 44.
PPoPP-2014-DrachslerVY #concurrent #logic: Practical concurrent binary search trees via logical ordering (DD, MTV, EY), pp. 343–356.
SAS-2014-MeshmanDVY #memory management #refinement #synthesis: Synthesis of Memory Fences via Refinement Propagation (YM, AMD, MTV, EY), pp. 237–252.
OOPSLA-2013-RaychevSSV #refactoring #synthesis: Refactoring with synthesis (VR, MS, MS, MTV), pp. 339–354.
OOPSLA-2013-RaychevVS #concurrent #detection #effectiveness #source code: Effective race detection for event-driven programs (VR, MTV, MS), pp. 151–166.
SAS-2013-DanMVY #abstraction #memory management #modelling: Predicate Abstraction for Relaxed Memory Models (AMD, YM, MTV, EY), pp. 84–104.
SAS-2013-RaychevVY #automation #concurrent #synthesis: Automatic Synthesis of Deterministic Concurrency (VR, MTV, EY), pp. 283–303.
PLDI-2012-LiuNPVY #memory management #modelling #synthesis: Dynamic synthesis for relaxed memory models (FL, NN, NP, MTV, EY), pp. 429–440.
PLDI-2012-PetrovVSD #concurrent #detection #web: Race detection for web applications (BP, MTV, MS, JD), pp. 251–262.
PLDI-2012-RamanZSVY #concurrent #detection #parallel #precise #scalability: Scalable and precise dynamic datarace detection for structured parallelism (RR, JZ, VS, MTV, EY), pp. 531–542.
OOPSLA-2011-AftandilianGVY: Asynchronous assertions (EA, SZG, MTV, EY), pp. 275–288.
OOPSLA-2011-RamanYVY #named: Sprint: speculative prefetching of remote data (AR, GY, MTV, EY), pp. 259–274.
OOPSLA-2011-ShachamBASVY #concurrent #testing: Testing atomicity of composed concurrent operations (OS, NGB, AA, MS, MTV, EY), pp. 51–64.
PLDI-2011-KupersteinVY #abstraction #memory management #modelling: Partial-coherence abstractions for relaxed memory models (MK, MTV, EY), pp. 187–198.
POPL-2011-AttiyaGHKMV #algorithm #concurrent #order: Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated (HA, RG, DH, PK, MMM, MTV), pp. 487–498.
ISMM-2010-VechevYY #named #parallel: PHALANX: parallel checking of expressive heap assertions (MTV, EY, GY), pp. 41–50.
POPL-2010-VechevYY #synthesis: Abstraction-guided synthesis of synchronization (MTV, EY, GY), pp. 327–338.
SAS-2010-VechevYRS #automation #parallel #source code #verification: Automatic Verification of Determinism for Structured Parallel Programs (MTV, EY, RR, VS), pp. 455–471.
PLDI-2009-ShachamVY #adaptation #named: Chameleon: adaptive selection of collections (OS, MTV, EY), pp. 408–418.
PPoPP-2009-MichaelVS: Idempotent work stealing (MMM, MTV, VAS), pp. 45–54.
TACAS-2009-VechevYY: Inferring Synchronization under Limited Observability (MTV, EY, GY), pp. 139–154.
OOPSLA-2008-ArnoldVY #detection #fault #named #performance #runtime: QVM: an efficient runtime for detecting defects in deployed systems (MA, MTV, EY), pp. 143–162.
PLDI-2008-VechevY #concurrent #fine-grained: Deriving linearizable fine-grained concurrent objects (MTV, EY), pp. 125–135.
PLDI-2007-VechevYBR #automation #concurrent #named: CGCExplorer: a semi-automated search procedure for provably correct concurrent collectors (MTV, EY, DFB, NR), pp. 456–467.
PLDI-2006-VechevYB #algorithm #concurrent #garbage collection: Correctness-preserving derivation of concurrent garbage collection algorithms (MTV, EY, DFB), pp. 341–353.
ECOOP-2005-VechevBCG #concurrent #evaluation: Derivation and Evaluation of Concurrent Collectors (MTV, DFB, PC, DG), pp. 577–601.
LCTES-2005-BaconCGV #garbage collection #named #realtime: Syncopation: generational real-time garbage collection in the metronome (DFB, PC, DG, MTV), pp. 183–192.
ISMM-2004-VechevB #concurrent #garbage collection: Write barrier elision for concurrent garbage collectors (MTV, DFB), pp. 13–24.
ESOP-2018-BichselGV #fine-grained #probability #semantics #source code: Fine-Grained Semantics for Probabilistic Programs (BB, TG, MTV), pp. 145–185.
CAV-2016-GehrMV #named #probability #source code: PSI: Exact Symbolic Inference for Probabilistic Programs (TG, SM, MTV), pp. 62–83.
CAV-2017-BielikRV #learning: Learning a Static Analyzer from Data (PB, VR, MTV), pp. 233–253.
CAV-2017-DanS0JV #analysis: Finding Fix Locations for CFL-Reachability Analyses via Minimum Cuts (AMD, MS, SC0, JBJ, MTV), pp. 521–541.
CAV-2017-El-HassanyTVV #synthesis: Network-Wide Configuration Synthesis (AEH, PT, LV, MTV), pp. 261–281.
CAV-2018-SinghPV #learning #performance #program analysis: Fast Numerical Program Analysis with Reinforcement Learning (GS, MP, MTV), pp. 211–229.
OOPSLA-2016-DanLHV #analysis #memory management #modelling #programming: Modeling and analysis of remote memory access programming (AMD, PL0, TH, MTV), pp. 129–144.
OOPSLA-2016-RaychevBV #probability: Probabilistic model for code with decision trees (VR, PB, MTV), pp. 731–747.
OOPSLA-2018-BielikFV #android #layout #relational #robust #synthesis: Robust relational layout synthesis from examples for Android (PB, MF, MTV), p. 29.
PLDI-2016-El-HassanyMBVV #analysis #concurrent #named #network: SDNRacer: concurrency analysis for software-defined networks (AEH, JM, PB, LV, MTV), pp. 402–415.
POPL-2016-RaychevBVK #learning #semistructured data #source code: Learning programs from noisy data (VR, PB, MTV, AK0), pp. 761–774.
POPL-2017-BrutschyD0V #analysis #consistency: Serializability for eventual consistency: criterion, analysis, and applications (LB, DD, PM0, MTV), pp. 458–472.
POPL-2017-SinghPV #abstract domain #performance: Fast polyhedra abstract domain (GS, MP, MTV), pp. 46–59.
PLDI-2018-BrutschyD0V #analysis #consistency: Static serializability analysis for causal consistency (LB, DD, PM0, MTV), pp. 90–104.
PLDI-2018-Cusumano-Towner18a #incremental #probability #source code: Incremental inference for probabilistic programs (MCT, BB, TG, MTV, VKM), pp. 571–585.
PLDI-2018-GehrMTVWV #named #network #probability: Bayonet: probabilistic inference for networks (TG, SM, PT, LV, PW, MTV), pp. 586–602.
PLDI-2018-PaletovTRV #api: Inferring crypto API rules from code changes (RP, PT, VR, MTV), pp. 450–464.
POPL-2018-SinghPV #abstract domain: A practical construction for decomposing numerical abstract domains (GS, MP, MTV), p. 28.
PLDI-2019-ChibotaruBRV #scalability #specification: Scalable taint specification inference with big code (VC, BB, VR, MTV), pp. 760–774.
PLDI-2019-EberhardtSRV #alias #api #learning #specification: Unsupervised learning of API aliasing specifications (JE, SS, VR, MTV), pp. 745–759.
POPL-2019-SinghGPV #abstract domain #network: An abstract domain for certifying neural networks (GS, TG, MP, MTV), p. 30.