| Title/Authors | Title | Research Artifacts
[?] A research
artifact is any by-product of a research project that is not
directly included in the published research paper. In Computer
Science research this is often source code and data sets, but
it could also be media, documentation, inputs to proof
assistants, shell-scripts to run experiments, etc.
|
Details |
|---|
|
Yusheng Weijiang, Shruthi Balakrishna, Jianqiao Liu, Milind Kulkarni |
Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Profile-guided meta-programming William J. Bowman, Swaha Miller, Vincent St-Amour, R. Kent Dybvig |
Profile-guided meta-programming Details |
Author Comments:
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
|
Helium: lifting high-performance stencil kernels from stripped x86 binaries to halide DSL code Charith Mendis, Jeffrey Bosboom, Kevin Wu, Shoaib Kamil, Jonathan Ragan-Kelley, Sylvain Paris, Qin Zhao, Saman P. Amarasinghe |
Helium: lifting high-performance stencil kernels from stripped x86 binaries to halide DSL code Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Diagnosing type errors with class Danfeng Zhang, Andrew C. Myers, Dimitrios Vytiniotis, Simon L. Peyton Jones |
Diagnosing type errors with class Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Static detection of asymptotic performance bugs in collection traversals Oswaldo Olivo, Isil Dillig, Calvin Lin |
Static detection of asymptotic performance bugs in collection traversals Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
DAG inlining: a decision procedure for reachability-modulo-theories in hierarchical programs Akash Lal, Shaz Qadeer |
DAG inlining: a decision procedure for reachability-modulo-theories in hierarchical programs Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Verifying read-copy-update in a logic for weak memory Joseph Tassarotti, Derek Dreyer, Viktor Vafeiadis |
Verifying read-copy-update in a logic for weak memory Details |
|
Author Comments:
The extended paper-and-pencil proofs of our results are available at: http://plv.mpi-sws.org/gps/rcu/. (This is not what is typically referred to as an "artifact".)
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
Defining the undefinedness of C Chris Hathhorn, Chucky Ellison, Grigore Rosu |
Defining the undefinedness of C Details |
Author Comments:
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
|
Stateless model checking concurrent programs with maximal causality reduction Jeff Huang |
Stateless model checking concurrent programs with maximal causality reduction Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Declarative programming over eventually consistent data stores K. C. Sivaramakrishnan, Gowtham Kaki, Suresh Jagannathan |
Declarative programming over eventually consistent data stores Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
The Push/Pull model of transactions Eric Koskinen, Matthew J. Parkinson |
The Push/Pull model of transactions Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Lightweight, flexible object-oriented generics Yizhou Zhang, Matthew C. Loring, Guido Salvaneschi, Barbara Liskov, Andrew C. Myers |
Lightweight, flexible object-oriented generics Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Automatic error elimination by horizontal code transfer across multiple applications Stelios Sidiroglou-Douskos, Eric Lahtinen, Fan Long, Martin Rinard |
Automatic error elimination by horizontal code transfer across multiple applications Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Synthesizing data structure transformations from input-output examples John K. Feser, Swarat Chaudhuri, Isil Dillig |
Synthesizing data structure transformations from input-output examples Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Verification of producer-consumer synchronization in GPU programs Rahul Sharma, Michael Bauer, Alex Aiken |
Verification of producer-consumer synchronization in GPU programs Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
Making numerical program analysis fast Gagandeep Singh, Markus Püschel, Martin T. Vechev |
Making numerical program analysis fast Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
Blame and coercion: together again for the first time Jeremy G. Siek, Peter Thiemann, Philip Wadler |
Blame and coercion: together again for the first time Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Efficient synthesis of probabilistic programs Aditya V. Nori, Sherjil Ozair, Sriram K. Rajamani, Deepak Vijaykeerthy |
Efficient synthesis of probabilistic programs Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Light: replay via tightly bounded recording Peng Liu, Xiangyu Zhang, Omer Tripp, Yunhui Zheng |
Light: replay via tightly bounded recording Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
KJS: a complete formal semantics of JavaScript Daejun Park, Andrei Stefanescu, Grigore Rosu |
KJS: a complete formal semantics of JavaScript Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
Relatively complete counterexamples for higher-order programs Phuc C. Nguyen, David Van Horn |
Relatively complete counterexamples for higher-order programs Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
Synthesizing parallel graph programs via automated planning Dimitrios Prountzos, Roman Manevich, Keshav Pingali |
Synthesizing parallel graph programs via automated planning Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Loop and data transformations for sparse matrix code Anand Venkat, Mary W. Hall, Michelle Strout |
Loop and data transformations for sparse matrix code Details |
Author Comments:
The work at University of Utah was partially supported by the National Science Foundation, through award CCF-1018881, and by the Scientific Discovery through Advanced Computing (SciDAC) program funded by U.S. Department of Energy, Office of Science, Advanced Scientific Computing Research under award number DE-FG02-11ER26053. The work at Colorado State University was supported by a Department of Energy Early Career Grant DE-SC0003956.
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
|
Type-and-example-directed program synthesis Peter-Michael Osera, Steve Zdancewic |
Type-and-example-directed program synthesis Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Preventing glitches and short circuits in high-level self-timed chip specifications Stephen Longfield Jr., Brittany Nkounkou, Rajit Manohar, Ross Tate |
Preventing glitches and short circuits in high-level self-timed chip specifications Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Synthesis of ranking functions using extremal counterexamples Laure Gonnord, David Monniaux, Gabriel Radanne |
Synthesis of ranking functions using extremal counterexamples Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Exploring and enforcing security guarantees via program dependence graphs Andrew Johnson, Lucas Waye, Scott Moore, Stephen Chong |
Exploring and enforcing security guarantees via program dependence graphs Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Efficient execution of recursive programs on commodity vector hardware Bin Ren, Youngjoon Jo, Sriram Krishnamoorthy, Kunal Agrawal, Milind Kulkarni |
Efficient execution of recursive programs on commodity vector hardware Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Verdi: a framework for implementing and formally verifying distributed systems James R. Wilcox, Doug Woos, Pavel Panchekha, Zachary Tatlock, Xi Wang, Michael D. Ernst, Thomas E. Anderson |
Verdi: a framework for implementing and formally verifying distributed systems Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
Relaxing safely: verified on-the-fly garbage collection for x86-TSO Peter Gammie, Antony L. Hosking, Kai Engelhardt |
Relaxing safely: verified on-the-fly garbage collection for x86-TSO Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
Monitoring refinement via symbolic reasoning Michael Emmi, Constantin Enea, Jad Hamza |
Monitoring refinement via symbolic reasoning Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Optimizing off-chip accesses in multicores Wei Ding, Xulong Tang, Mahmut T. Kandemir, Yuanrui Zhang, Emre Kultursay |
Optimizing off-chip accesses in multicores Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Interactive parser synthesis by example Alan Leung, John Sarracino, Sorin Lerner |
Interactive parser synthesis by example Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
A simpler, safer programming and execution model for intermittent systems Brandon Lucia, Benjamin Ransford |
A simpler, safer programming and execution model for intermittent systems Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Automatic induction proofs of data-structures in imperative programs Duc-Hiep Chu, Joxan Jaffar, Minh-Thai Trinh |
Automatic induction proofs of data-structures in imperative programs Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Ofri Ziv, Alex Aiken, Guy Golan-Gueta, G. Ramalingam, Mooly Sagiv |
Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Mechanized verification of fine-grained concurrent programs Ilya Sergey, Aleksandar Nanevski, Anindya Banerjee |
Mechanized verification of fine-grained concurrent programs Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Compositional certified resource bounds Quentin Carbonneaux, Jan Hoffmann, Zhong Shao |
Compositional certified resource bounds Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Termination and non-termination specification inference Ton Chanh Le, Shengchao Qin, Wei-Ngan Chin |
Termination and non-termination specification inference Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
Asynchronous programming, analysis and testing with state machines Pantazis Deligiannis, Alastair F. Donaldson, Jeroen Ketema, Akash Lal, Paul Thomson |
Asynchronous programming, analysis and testing with state machines Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
Efficient synthesis of network updates Jedidiah McClurg, Hossein Hojjat, Pavol Cerný, Nate Foster |
Efficient synthesis of network updates Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
FlashRelate: extracting relational data from semi-structured spreadsheets using examples Daniel W. Barowy, Sumit Gulwani, Ted Hart, Benjamin G. Zorn |
FlashRelate: extracting relational data from semi-structured spreadsheets using examples Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Zero-overhead metaprogramming: reflection and metaobject protocols fast and without compromises Stefan Marr, Chris Seaton, Stéphane Ducasse |
Zero-overhead metaprogramming: reflection and metaobject protocols fast and without compromises Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Dynamic partial order reduction for relaxed memory models Naling Zhang, Markus Kusano, Chao Wang |
Dynamic partial order reduction for relaxed memory models Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Verification of a cryptographic primitive: SHA-256 (abstract) Andrew W. Appel |
Verification of a cryptographic primitive: SHA-256 (abstract) Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Autotuning algorithmic choice for input sensitivity Yufei Ding, Jason Ansel, Kalyan Veeramachaneni, Xipeng Shen, Una-May O'Reilly, Saman P. Amarasinghe |
Autotuning algorithmic choice for input sensitivity Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
LaminarIR: compile-time queues for structured streams Yousun Ko, Bernd Burgstaller, Bernhard Scholz |
LaminarIR: compile-time queues for structured streams Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Malavika Samak, Murali Krishna Ramanathan, Suresh Jagannathan |
Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Synthesis of machine code from semantics Venkatesh Srinivasan, Thomas W. Reps |
Synthesis of machine code from semantics Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Peer-to-peer affine commitment using bitcoin Karl Crary, Michael J. Sullivan |
Peer-to-peer affine commitment using bitcoin Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Finding counterexamples from parsing conflicts Chinawat Isradisaikul, Andrew C. Myers |
Finding counterexamples from parsing conflicts Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Improving compiler scalability: optimizing large programs at small price Sanyam Mehta, Pen-Chung Yew |
Improving compiler scalability: optimizing large programs at small price Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Christopher Lidbury, Andrei Lascu, Nathan Chong, Alastair F. Donaldson |
Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
Automatically improving accuracy for floating point expressions Pavel Panchekha, Alex Sanchez-Stern, James R. Wilcox, Zachary Tatlock |
Automatically improving accuracy for floating point expressions Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Celebrating diversity: a mixture of experts approach for runtime mapping in dynamic environments Murali Krishna Emani, Michael F. P. O'Boyle |
Celebrating diversity: a mixture of experts approach for runtime mapping in dynamic environments Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Concurrency debugging with differential schedule projections Nuno Machado, Brandon Lucia, Luís E. T. Rodrigues |
Concurrency debugging with differential schedule projections Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
A formal C memory model supporting integer-pointer casts Jeehoon Kang, Chung-Kil Hur, William Mansky, Dmitri Garbuzov, Steve Zdancewic, Viktor Vafeiadis |
A formal C memory model supporting integer-pointer casts Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Provably correct peephole optimizations with alive Nuno P. Lopes, David Menendez, Santosh Nagarakatte, John Regehr |
Provably correct peephole optimizations with alive Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Maarten Faddegon, Olaf Chitil |
Details |
Artifacts for some papers are reviewed by an artifact evaluation, reproducibility,
or similarly named committee. This is one such paper that passed review.
Artifact evaluation badge awarded
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|