Biography: Karl Lieberherr is a Professor in the College of Computer and Information Science since 1985. Prior to joining Northeastern, he was an assistant professor at the EECS Department at Princeton University (1979-1983). He got his PhD from ETH Zurich, Switzerland.
Karl Lieberherr’s research in PL/SE has led to advances in programming technology: the Law of Demeter is widely used by programmers who use object-oriented technology (search YouTube for “Law of Demeter”). The Adaptive Programming approach that was inspired by the Law of Demeter has been incorporated into XML technology (XPath) and Aspect-Oriented Technology. His research in Algorithms, primarily P-Optimal algorithms, has led to a new class of games, called side-choosing games (SCGs), which serve as a foundation for problem solving and peer-grading in STEM domains.
Karl Lieberherr’s leadership positions in PL/SE include co-Editor-in-Chief of Theory and Practice of Object Systems, Member Steering Committee of AOSD, Organizing Chair at AOSD 2003, PC chair at AOSD 2004 and keynote speaker at ICSE 2004.
Current Research Project: Study of Side-Choosing Games (SCGs). Those are two player win-lose games with opposite roles and the first move is to choose one of the roles. The remaining moves are to support the chosen role or playing devil’s advocate. We study techniques for finding winning strategies for SCGs (1) Using SMT solvers, either dynamically or statically, (2) Using specification reductions, (3) Using algorithm design techniques for special kinds of SCGs, (4) Using General Game-Playing Algorithms based on the recent success of DeepMind/AlphaGo by Google. We also study the safe aggregation of the outcome of many SCGs using techniques of Social Choice theory.
Research interests: How to help programmers produce better programs faster.