As a part of our weekly lab meetings, we shall meet each week to discuss interesting and relevant papers in program analysis research (perhaps with a security orientation).
Each week, you should to both read the selected paper and think about critiquing it. You might consider strengths and weaknesses of the technique, strengths and weaknesses of the presentation style, future directions for the work, or anything else that interested you about the paper. You don't need to write anything, but make sure you've thought about it in advance. Some other examples and thoughts on critiques may be found here.
If you have trouble selecting a paper, you might look through the proceedings of Security and Privacy, USENIX Security, ISSTA, ICSE, PLDI, FSE, ICST, ASPLOS, ICSM, ASE, ISMM, ICPC, POPL, and many more.
To suggest a paper, please email me a link by the previous meeting date.
Time: 2:00pm Fridays
Location: Usually T9408, check schedule
Date | Location | Leader | Paper |
---|---|---|---|
May 18 | TASC 9408 | Nick |
Manuel Rigger, Roland Schatz, René Mayrhofer, Matthias Grimmer, Hanspeter Mössenböck Sulong, and Thanks For All the Bugs: Finding Errors in C Programs by Abstracting from the Native Execution Model ASPLOS 2018 |
May 25 | TASC 9408 | Shadi |
Ivica Nikolic, Aashish Kolluri, Ilya Sergey, Prateek Saxena, Aquinas Hobor Finding The Greedy, Prodigal, and Suicidal Contracts at Scale N/A |
June 1 | TASC 9408 | Golnaz |
Chengnian Sun, Yuanbo Li, Qirun Zhang, Tianxiao Gu, Zhendong Su Perses: Syntax-Guided Program Reduction ICSE 2018 |
June 8 | TASC 9408 | Shreeasish |
Mathias V. Pedersen, Aslan Askarov From Trash to Treasure: Timing-Sensitive Garbage Collection S&P 2017 |
June 15 | TASC 9408 | all |
Woosuk Lee, Kihong Heo, Rajeev Alur, Mayur Naik Accelerating Search-Based Program Synthesis using Learned Probabilistic Models PLDI 2018 |
June 22 | TASC 9408 | all |
Zhaogui Xu, Shiqing Ma, Xiangyu Zhang, Shuofei Zhu, Baowen Xu Debugging with Intelligence via Probabilistic Inference ICSE 2018 |
June 29 | TASC 9408 | all |
Uri Alon, Meital Zilberstein, Omer Levy, Eran Yahav A General Path-Based Representation for Predicting Program Properties PLDI 2018 https://github.com/urialon/PigeonJS |
July 20 | TASC 9408 | all |
Sumit Gulwani, Krishna Mehra, Trishul Chilimbi SPEED: Precise and Efficient Static Estimation of Program Computational Complexity POPL 2009 |
July 27 | TASC 9408 | Shreeasish |
Ravichandhran Madhavan, Raghavan Komondoor Null Dereference Verification via Over-approximated Weakest Pre-conditions Analysis OOPSLA 2011 https://sourceforge.net/projects/npedetector/ |
August 3 | TASC 9408 | Shadi |
Florentin Guth, Valentin Wüstholz, Maria Christakis, Peter Müller Specification Mining for Smart Contracts with Automatic Abstraction Tuning |
August 10 | TASC 9408 | Nick |
Nuno P. Lopes, David Menendez, Santosh Nagarakatte, John Regehr Provably Correct Peephole Optimizations with Alive PLDI 2015 https://github.com/rutgers-apl/alive-nj |
August 17 | TASC 9408 | Shreeasish |
William R. Harris, Somesh Jha, Thomas Reps, Jonathan Anderson, Robert N. M. Watson Declarative, Temporal, and Practical Programming with Capabilities S&P 2013 |
August 31 | TASC 9408 | Shadi |
Patrice Godefroid Micro Execution ICSE 2014 |