CC 2017 – Proceedings

Frontmatter

Concurrency and Parallelism

Partially Redundant Fence Elimination for x86, ARM, and Power Processors
Robin Morisset and Francesco Zappa Nardelli
(ENS, France; Inria, France)

@InProceedings{CC17p1, author = {Robin Morisset and Francesco Zappa Nardelli}, title = {Partially Redundant Fence Elimination for x86, ARM, and Power Processors}, booktitle = {Proc.\ CC}, publisher = {ACM}, pages = {1-0}, doi = {}, year = {2017}, } Article: cc17main-mainid13-p (type: Full Paper (11 pages)) doi:

Lightweight Data Race Detection for Production Runs
Swarnendu Biswas, Man Cao, Minjia Zhang, Michael D. Bond, and Benjamin P. Wood
(University of Texas at Austin, USA; Ohio State University, USA; Microsoft Research, USA; Wellesley College, USA)

@InProceedings{CC17p12, author = {Swarnendu Biswas and Man Cao and Minjia Zhang and Michael D. Bond and Benjamin P. Wood}, title = {Lightweight Data Race Detection for Production Runs}, booktitle = {Proc.\ CC}, publisher = {ACM}, pages = {12-11}, doi = {}, year = {2017}, } Article: cc17main-mainid49-p (type: Full Paper (11 pages)) doi:

Optimized Two-Level Parallelization for GPU Accelerators using the Polyhedral Model
Jun Shirako, Akihiro Hayashi, and Vivek Sarkar
(Rice University, USA)

@InProceedings{CC17p23, author = {Jun Shirako and Akihiro Hayashi and Vivek Sarkar}, title = {Optimized Two-Level Parallelization for GPU Accelerators using the Polyhedral Model}, booktitle = {Proc.\ CC}, publisher = {ACM}, pages = {23-22}, doi = {}, year = {2017}, } Article: cc17main-mainid56-p (type: Full Paper (11 pages)) doi:

Optimization Space Pruning without Regrets
Ulysse Beaugnon, Antoine Pouille, Marc Pouzet, Jacques Pienaar, and Albert Cohen
(ENS, France; Google, USA; Inria, France)

@InProceedings{CC17p35, author = {Ulysse Beaugnon and Antoine Pouille and Marc Pouzet and Jacques Pienaar and Albert Cohen}, title = {Optimization Space Pruning without Regrets}, booktitle = {Proc.\ CC}, publisher = {ACM}, pages = {35-34}, doi = {}, year = {2017}, } Article: cc17main-mainid27-p (type: Full Paper (11 pages)) doi:

Compilers

Compile-Time Function Memoization
Arjun Suresh, Erven Rohou, and André Seznec
(Ohio State University, USA; Inria, France)

@InProceedings{CC17p46, author = {Arjun Suresh and Erven Rohou and André Seznec}, title = {Compile-Time Function Memoization}, booktitle = {Proc.\ CC}, publisher = {ACM}, pages = {46-45}, doi = {}, year = {2017}, } Article: cc17main-mainid8-p (type: Full Paper (11 pages)) doi:

One Compiler: Deoptimization to Optimized Code
Christian Wimmer, Vojin Jovanovic, Erik Eckstein, and Thomas Würthinger
(Oracle Labs, USA; Oracle Labs, Switzerland; Oracle Labs, Austria)

@InProceedings{CC17p57, author = {Christian Wimmer and Vojin Jovanovic and Erik Eckstein and Thomas Würthinger}, title = {One Compiler: Deoptimization to Optimized Code}, booktitle = {Proc.\ CC}, publisher = {ACM}, pages = {57-56}, doi = {}, year = {2017}, } Article: cc17main-mainid16-p (type: Full Paper (11 pages)) doi:

Static Optimization in PHP 7
Nikita Popov, Biagio Cosenza, Ben Juurlink, and Dmitry Stogov
(TU Berlin, Germany; Zend Technologies, Russia)

@InProceedings{CC17p68, author = {Nikita Popov and Biagio Cosenza and Ben Juurlink and Dmitry Stogov}, title = {Static Optimization in PHP 7}, booktitle = {Proc.\ CC}, publisher = {ACM}, pages = {68-67}, doi = {}, year = {2017}, } Article: cc17main-mainid41-p (type: Full Paper (11 pages)) doi:

From Functional Programs to Pipelined Dataflow Circuits
Richard Townsend, Martha A. Kim, and Stephen A. Edwards
(Columbia University, USA)

@InProceedings{CC17p79, author = {Richard Townsend and Martha A. Kim and Stephen A. Edwards}, title = {From Functional Programs to Pipelined Dataflow Circuits}, booktitle = {Proc.\ CC}, publisher = {ACM}, pages = {79-78}, doi = {}, year = {2017}, } Article: cc17main-mainid35-p (type: Full Paper (11 pages)) doi:

Types

Granullar: Gradual Nullable Types for Java
Dan Brotherston, Werner Dietl, and Ondřej Lhoták
(University of Waterloo, Canada)

@InProceedings{CC17p90, author = {Dan Brotherston and Werner Dietl and Ondřej Lhoták}, title = {Granullar: Gradual Nullable Types for Java}, booktitle = {Proc.\ CC}, publisher = {ACM}, pages = {90-89}, doi = {}, year = {2017}, } Article: cc17main-mainid38-p (type: Full Paper (11 pages)) doi:

Let It Recover: Multiparty Protocol-Induced Recovery
Rumyana Neykova and Nobuko Yoshida
(Imperial College London, UK)

@InProceedings{CC17p101, author = {Rumyana Neykova and Nobuko Yoshida}, title = {Let It Recover: Multiparty Protocol-Induced Recovery}, booktitle = {Proc.\ CC}, publisher = {ACM}, pages = {101-100}, doi = {}, year = {2017}, } Article: cc17main-mainid19-p (type: Full Paper (11 pages)) doi:

Program Analysis

Data Structure-Aware Heap Partitioning
Nouraldin Jaber and Milind Kulkarni
(Purdue University, USA)

@InProceedings{CC17p112, author = {Nouraldin Jaber and Milind Kulkarni}, title = {Data Structure-Aware Heap Partitioning}, booktitle = {Proc.\ CC}, publisher = {ACM}, pages = {112-111}, doi = {}, year = {2017}, } Article: cc17main-mainid63-p (type: Full Paper (11 pages)) doi:

Dynamic Symbolic Execution for Polymorphism
Lian Li, Yi Lu, and Jingling Xue
(Oracle Labs, Australia; Institute of Computing Technology at Chinese Academy of Sciences, China; UNSW, Australia)

@InProceedings{CC17p123, author = {Lian Li and Yi Lu and Jingling Xue}, title = {Dynamic Symbolic Execution for Polymorphism}, booktitle = {Proc.\ CC}, publisher = {ACM}, pages = {123-122}, doi = {}, year = {2017}, } Article: cc17main-mainid7-p (type: Full Paper (11 pages)) doi:

rev.ng: A Unified Binary Analysis Framework to Recover CFGs and Function Boundaries
Alessandro Di Federico, Mathias Payer, and Giovanni Agosta
(Politecnico di Milano, Italy; Purdue University, USA)

@InProceedings{CC17p134, author = {Alessandro Di Federico and Mathias Payer and Giovanni Agosta}, title = {rev.ng: A Unified Binary Analysis Framework to Recover CFGs and Function Boundaries}, booktitle = {Proc.\ CC}, publisher = {ACM}, pages = {134-133}, doi = {}, year = {2017}, } Article: cc17main-mainid37-p (type: Full Paper (11 pages)) doi:

proc time: 0.02