• About communications
  • Current Issue
  • Digital Edition
  • Sample Issue
  • FAQs
  • Author Center
  • Author Guidelines
  • ACM Copyright Form
  • ACM Copyright Policy
  • ACM Author Rights
  • Submit a Video
  • Editor's Letters
  • Third-Party Material
  • Kudos Service
  • 2016 Editorial Calendar
  • Editorial Board
  • Editor's Letters
  • Editorial Staff
  • Contact Us
  • Mobile Apps
  • For Advertisers
  • Research Archive


    Latest Research Research Archive 2018FebruaryJanuary2017DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2016DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2015DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2014DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2013DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2012DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2011DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2010DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2009DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary2008DecemberNovemberOctoberSeptemberAugustJulyJuneMayAprilMarchFebruaryJanuary Refine your search:
    Archives

    The Research archive provides access to all Research articles published in past issues of Communications of the ACM.

    February 2018


    From Communications of the ACM

    Technical Perspective: Building Bug-Free Compilers

    What to do about buggy compilers? The authors of "Practical Verification of Peephole Optimizations with Alive" give us a compelling and practical answer.

    Steve Zdancewic | February 2018

    From Communications of the ACM

    Practical Verification of Peephole Optimizations with Alive

    Practical Verification of Peephole Optimizations with Alive

    We created Alive, a domain-specific language for writing correct peephole optimizations and for automatically either proving them correct or else generating counterexamples.

    Nuno P. Lopes, David Menendez, Santosh Nagarakatte, John Regehr | February 2018

    From Communications of the ACM

    Technical Perspective: Designing Algorithms and the Fairness Criteria They Should Satisfy

    "Which Is the Fairest (Rent Division) of Them All?" focuses on the problem of rent division, and stands out in the variety of techniques applied to arrive at a solution.

    Vincent Conitzer | February 2018

    From Communications of the ACM

    Which Is the Fairest (Rent Division) of Them All?

    Which Is the Fairest (Rent Division) of Them All?

    What is a fair way to assign rooms to several housemates, and divide the rent between them? We develop a general algorithmic framework that enables the computation of solutions in polynomial time that optimize a criterion of …

    Kobi Gal, Ariel D. Procaccia, Moshe Mash, Yair Zick | February 2018