Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Sorin Lerner
2010 – today
- 2012
[j4]Macneil Shonle, William G. Griswold, Sorin Lerner: A framework for the checking and refactoring of crosscutting concepts. ACM Trans. Softw. Eng. Methodol. 21(3): 15 (2012)- [c26]Stephen R. Foster, William G. Griswold, Sorin Lerner: WitchDoctor: IDE support for real-time auto-completion of refactorings. ICSE 2012: 222-232
- [c25]Alan Leung, Manish Gupta, Yuvraj Agarwal, Rajesh Gupta, Ranjit Jhala, Sorin Lerner: Verifying GPU kernels by test amplification. PLDI 2012: 383-394
- 2011
- [j3]Ross Tate, Michael Stepp, Zachary Tatlock, Sorin Lerner: Equality Saturation: A New Approach to Optimization. Logical Methods in Computer Science 7(1) (2011)
- [c24]Michael Stepp, Ross Tate, Sorin Lerner: Equality-Based Translation Validator for LLVM. CAV 2011: 737-742
- [c23]Macneil Shonle, William G. Griswold, Sorin Lerner: Using metaphors from natural discussion to improve the design of arcum. PLATEAU 2011: 39-44
- [c22]
- 2010
- [j2]Sudipta Kundu, Sorin Lerner, Rajesh K. Gupta: Translation Validation of High-Level Synthesis. IEEE Trans. on CAD of Integrated Circuits and Systems 29(4): 566-579 (2010)
- [c21]Dongseok Jang, Ranjit Jhala, Sorin Lerner, Hovav Shacham: An empirical study of privacy-violating information flows in JavaScript web applications. ACM Conference on Computer and Communications Security 2010: 270-283
- [c20]Diane Hu, Laurens van der Maaten, Youngmin Cho, Lawrence K. Saul, Sorin Lerner: Latent Variable Models for Predicting File Dependencies in Large-Scale Software Development. NIPS 2010: 865-873
- [c19]
- [c18]Ross Tate, Michael Stepp, Sorin Lerner: Generating compiler optimizations from proofs. POPL 2010: 389-402
- [e1]Sorin Lerner, Atanas Rountev (Eds.): Proceedings of the 9th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, PASTE'10, Toronto, Ontario, Canada, June 5-6, 2010. ACM 2010, ISBN 978-1-4503-0082-7
2000 – 2009
- 2009
- [c17]Ravi Chugh, Jeffrey A. Meister, Ranjit Jhala, Sorin Lerner: Staged information flow for javascript. PLDI 2009: 50-62
- [c16]Sudipta Kundu, Zachary Tatlock, Sorin Lerner: Proving optimizations correct using parameterized program equivalence. PLDI 2009: 327-337
- [c15]Ross Tate, Michael Stepp, Zachary Tatlock, Sorin Lerner: Equality saturation: a new approach to optimization. POPL 2009: 264-276
- 2008
- [c14]
- [c13]Zachary Tatlock, Chris Tucker, David Shuffelton, Ranjit Jhala, Sorin Lerner: Deep typechecking and refactoring. OOPSLA 2008: 37-52
- [c12]Macneil Shonle, William G. Griswold, Sorin Lerner: Addressing common crosscutting problems with Arcum. PASTE 2008: 64-69
- [c11]Ravi Chugh, Jan Wen Voung, Ranjit Jhala, Sorin Lerner: Dataflow analysis for concurrent programs using datarace detection. PLDI 2008: 316-326
- 2007
- [c10]Sudipta Kundu, Sorin Lerner, Rajesh Gupta: Automated refinement checking of concurrent systems. ICCAD 2007: 318-325
- [c9]Chris Tucker, David Shuffelton, Ranjit Jhala, Sorin Lerner: OPIUM: Optimal Package Install/Uninstall Manager. ICSE 2007: 178-188
- [c8]Erika Rice Scherpelz, Sorin Lerner, Craig Chambers: Automatic inference of optimizer flow functions from semantic meanings. PLDI 2007: 135-145
- [c7]Macneil Shonle, William G. Griswold, Sorin Lerner: Beyond refactoring: a framework for modular maintenance of crosscutting design idioms. ESEC/SIGSOFT FSE 2007: 175-184
- [c6]Jan Wen Voung, Ranjit Jhala, Sorin Lerner: RELAY: static race detection on millions of lines of code. ESEC/SIGSOFT FSE 2007: 205-214
- 2005
- [j1]Sorin Lerner, Todd D. Millstein, Craig Chambers: Cobalt: A Language for Writing Provably-Sound Compiler Optimizations. Electr. Notes Theor. Comput. Sci. 132(1): 5-17 (2005)
- [c5]Sorin Lerner, Todd D. Millstein, Erika Rice, Craig Chambers: Automated soundness proofs for dataflow analyses and transformations via local rules. POPL 2005: 364-377
- 2003
- [c4]Sorin Lerner, Todd D. Millstein, Craig Chambers: Automatically proving the correctness of compiler optimizations. PLDI 2003: 220-231
- 2002
- [c3]Manuvir Das, Sorin Lerner, Mark Seigle: ESP: Path-Sensitive Program Verification in Polynomial Time. PLDI 2002: 57-68
- [c2]Sorin Lerner, David Grove, Craig Chambers: Composing dataflow analyses and transformations. POPL 2002: 270-282
- [c1]Stephen Adams, Thomas Ball, Manuvir Das, Sorin Lerner, Sriram K. Rajamani, Mark Seigle, Westley Weimer: Speeding Up Dataflow Analysis Using Flow-Insensitive Pointer Analysis. SAS 2002: 230-246
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:24 CET by the dblp team