30.01.2014 Views

Annual Report 2010 - Fachgruppe Informatik an der RWTH Aachen ...

Annual Report 2010 - Fachgruppe Informatik an der RWTH Aachen ...

Annual Report 2010 - Fachgruppe Informatik an der RWTH Aachen ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Overview<br />

Our research group is concerned with several topics from the area of programming l<strong>an</strong>guages<br />

<strong>an</strong>d verification. In particular, we are interested in the application of formal methods in or<strong>der</strong><br />

to increase the reliability of programs:<br />

To guar<strong>an</strong>tee the correctness of software, testing is not sufficient, but a formal verification is<br />

required. Program verification is a highly relev<strong>an</strong>t aspect of software technology <strong>an</strong>d<br />

correctness issues are especially import<strong>an</strong>t for safety-critical <strong>an</strong>d distributed applications.<br />

However, in general, correctness proofs are very expensive <strong>an</strong>d time-consuming. Therefore,<br />

program verification should be automated as much as possible.<br />

Thus, a main topic of our research is the development of methods for mech<strong>an</strong>ized <strong>an</strong>alysis<br />

<strong>an</strong>d verification of algorithms <strong>an</strong>d systems. For that purpose, we use approaches from areas<br />

like term rewriting, automata theory, mathematical logic, computer algebra, <strong>an</strong>d artificial<br />

intelligence in or<strong>der</strong> to facilitate the task of correct software development.<br />

A central problem in the design of reliable software is the proof of termination. We have developed<br />

the “dependency pair” method, which extends the applicability of classical<br />

techniques for automated termination <strong>an</strong>alysis signific<strong>an</strong>tly.<br />

Moreover, we work on methods <strong>an</strong>d systems for proving partial correctness of programs.<br />

These techniques check if a program meets its specification provided that it terminates. In<br />

particular, we are interested in applying such techniques for several types of programming<br />

l<strong>an</strong>guages <strong>an</strong>d paradigms.<br />

Other import<strong>an</strong>t topics of our research are concerned with SAT solving, evaluation strategies,<br />

modularity aspects of programs, <strong>an</strong>d formal specification l<strong>an</strong>guages.<br />

In the winter term 2009/10, we held the lecture on Functional Programming, a seminar on<br />

Verification Techniques, <strong>an</strong>d a seminar on Satisfiability Checking (together with the group of<br />

Prof. Dr. E. Ábrahám). In the summer term <strong>2010</strong>, we gave the first-year course on Formal<br />

Systems, Automata, Processes, a seminar on Automated Termination Analysis, <strong>an</strong>d a<br />

proseminar on Adv<strong>an</strong>ced Programming Concepts in Java, Haskell, <strong>an</strong>d Prolog.<br />

In March <strong>an</strong>d April <strong>2010</strong>, two new Ph.D. students joined our group: Thomas Strö<strong>der</strong> <strong>an</strong>d<br />

Marc Brockschmidt. In November 2009, the Ph.D. thesis of Peter Schnei<strong>der</strong>-Kamp was<br />

awarded with the Friedrich-Wilhelm-Preis for outst<strong>an</strong>ding scientific contributions. He had<br />

completed his thesis in our group in December 2008 <strong>an</strong>d since J<strong>an</strong>uary 2009, he is assist<strong>an</strong>t<br />

professor at the University of Southern Denmark.<br />

105

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!