News: Test-of-Time Award

Krishna Gummadi and Peter Druschel win ACM SIGCOMM test-of-time award

July 19, 2017

MPI-SWS researchers—faculty members Krishna Gummadi and Peter Druschel and former SWS doctoral students Alan Mislove and Massimiliano Marcon—have received the ACM SIGCOMM Test of Time Award for their IMC 2007 paper on "Measurement and Analysis of Online Social Networks." The work was done in collaboration with Bobby Bhattacharjee of the University of Maryland.

The award citation reads as follows: "This is one of the first papers that examine multiple online social networks at scale.

MPI-SWS researchers—faculty members Krishna Gummadi and Peter Druschel and former SWS doctoral students Alan Mislove and Massimiliano Marcon—have received the ACM SIGCOMM Test of Time Award for their IMC 2007 paper on "Measurement and Analysis of Online Social Networks." The work was done in collaboration with Bobby Bhattacharjee of the University of Maryland.

The award citation reads as follows: "This is one of the first papers that examine multiple online social networks at scale. By introducing novel measurement techniques, the paper has had an enduring influence on the analysis, modeling and design of modern social media and social networking services."

The ACM SIGCOMM Test of Time Award is a retrospective award. It recognizes papers published 10 to 12 years in the past in Computer Communication Review or any SIGCOMM sponsored or co-sponsored conference that is deemed to be an outstanding paper whose contents are still a vibrant and useful contribution today.
Read more

Rupak Majumdar wins Most Influential Paper Award

January 2, 2014

MPI-SWS faculty member Rupak Majumdar has been selected as the winner of this year's POPL (Principles of Programming Languages) Most Influential Paper Award. The ACM SIGPLAN Most Influential POPL Paper Award is a retrospective award—it is given each year to the paper deemed most influential from the POPL conference 10 years earlier.

Majumdar won the award for his 2004 paper, Abstractions From Proofs, which was coauthored with Thomas Henzinger, Ranjit Jhala, and Kenneth McMillan.

MPI-SWS faculty member Rupak Majumdar has been selected as the winner of this year's POPL (Principles of Programming Languages) Most Influential Paper Award. The ACM SIGPLAN Most Influential POPL Paper Award is a retrospective award—it is given each year to the paper deemed most influential from the POPL conference 10 years earlier.

Majumdar won the award for his 2004 paper, Abstractions From Proofs, which was coauthored with Thomas Henzinger, Ranjit Jhala, and Kenneth McMillan. The paper introduced a technique to automatically find program abstractions using logical interpolation and showed the effectiveness of the technique in software verification.

Read more

Rupak Majumdar wins PLDI most influential paper award

August 2, 2011

MPI-SWS faculty Rupak Majumdar has received the ACM SIGPLAN Most Influential PLDI (Programming Language Design and Implementation) Paper Award for 2011.

The ACM SIGPLAN Most Influential PLDI Paper Award is given each year for a paper that is ten years old and has been highly influential in the area of programming languages.

Rupak's 2001 paper, "Automatic Predicate Abstraction of C Programs," was coauthored with Thomas Ball, Todd Millstein, and Sriram Rajamani.

MPI-SWS faculty Rupak Majumdar has received the ACM SIGPLAN Most Influential PLDI (Programming Language Design and Implementation) Paper Award for 2011.

The ACM SIGPLAN Most Influential PLDI Paper Award is given each year for a paper that is ten years old and has been highly influential in the area of programming languages.

Rupak's 2001 paper, "Automatic Predicate Abstraction of C Programs," was coauthored with Thomas Ball, Todd Millstein, and Sriram Rajamani. The paper presented the predicate abstraction technology underlying the SLAM project. The technology is now part of Microsoft's Static Driver Verifier in the Windows Driver Development Kit. This is one of the earliest examples of automation of software verification on a large scale and the basis for numerous efforts to expand the domains that can be verified.

Read more

Paul Francis wins SIGCOMM test-of-time award

August 1, 2011

MPI-SWS faculty Paul Francis has received the ACM SIGCOMM Test of Time Award for 2011.

The ACM SIGCOMM Test of Time Award recognizes papers published 10 to 12 years in the past in Computer Communication Review or any SIGCOMM sponsored or co-sponsored conference that is deemed to be an outstanding paper whose contents are still a vibrant and useful contribution today.

Paul's 2001 paper, "A Scalable Content-Addressable Network," was coauthored with Mark Handley,

MPI-SWS faculty Paul Francis has received the ACM SIGCOMM Test of Time Award for 2011.

The ACM SIGCOMM Test of Time Award recognizes papers published 10 to 12 years in the past in Computer Communication Review or any SIGCOMM sponsored or co-sponsored conference that is deemed to be an outstanding paper whose contents are still a vibrant and useful contribution today.

Paul's 2001 paper, "A Scalable Content-Addressable Network," was coauthored with Mark Handley, Richard Karp, Sylvia Ratnasamy, and Scott Shenker. This paper is one of four highly influential papers that laid the foundation for P2P systems based on distributed hash tables (DHTs).

Read more