Karl Lieberherr
Research Interests
- Modularity in software development
- Test-driven development for relational queries using neural networks
- Socio-technical systems for problem solving in STEM areas involving competition and collaboration
Education
- PhD, ETH Zurich, Switzerland
- MS in mathematics, ETH Zurich, Switzerland
Biography
Karl Lieberherr joined the Khoury College of Computer Sciences in 1985. Prior to joining Northeastern, he was an assistant professor in the Electrical Engineering and Computer Science Department at Princeton University from 1979 to 1983.
Lieberherr’s research in programming languages and software engineering has led to advances in programming technology, such as his work on the Law of Demeter, which is widely used by programmers in object-oriented technology. The structure-shy programming approach that his Demeter research group introduced was inspired by the Law of Demeter and has been popular in several programming communities because of its clear benefit of eliminating boilerplate code.
His research in algorithms, primarily for satisfiability, has proposed a basic form of clause learning now widely used in refined form in SAT solvers. Novel approximation algorithms for maximum satisfiability is another of Lieberherr’s contributions.
His leadership positions in PL/SE include co-editor-in-chief of theory and practice of object systems, a member of AOSD’s steering committee, an organizing chair at AOSD 2003, PC chair at AOSD 2004, and keynote speaker at ICSE 2004.
Research Interests
- Modularity in software development
- Test-driven development for relational queries using neural networks
- Socio-technical systems for problem solving in STEM areas involving competition and collaboration
Education
- PhD, ETH Zurich, Switzerland
- MS in mathematics, ETH Zurich, Switzerland
Biography
Karl Lieberherr joined the Khoury College of Computer Sciences in 1985. Prior to joining Northeastern, he was an assistant professor in the Electrical Engineering and Computer Science Department at Princeton University from 1979 to 1983.
Lieberherr’s research in programming languages and software engineering has led to advances in programming technology, such as his work on the Law of Demeter, which is widely used by programmers in object-oriented technology. The structure-shy programming approach that his Demeter research group introduced was inspired by the Law of Demeter and has been popular in several programming communities because of its clear benefit of eliminating boilerplate code.
His research in algorithms, primarily for satisfiability, has proposed a basic form of clause learning now widely used in refined form in SAT solvers. Novel approximation algorithms for maximum satisfiability is another of Lieberherr’s contributions.
His leadership positions in PL/SE include co-editor-in-chief of theory and practice of object systems, a member of AOSD’s steering committee, an organizing chair at AOSD 2003, PC chair at AOSD 2004, and keynote speaker at ICSE 2004.