News Archive

2nd Kick-Off Meeting STRUCTURAL (October 21, 2011)

From October 26 — 28 the Computational Logic group hosts the
2nd kick-off meeting of the STRUCTURAL project.

Memorandum of Understanding (September 5, 2011)

Early September the University of Innsbruck and the Japan Advanced Institute of Science and Technology have signed a memorandum of understanding that eases international cooperation.

Open PostDoc Position (August 3, 2011)

The Computational Logic research group is looking for a postdoctoral researcher for a 6 year university position.

FWF “Erwin Schrödinger project” accepted (June 30, 2011)

Dr. Christian Sternagel receives an Erwin Schrödinger scholarship from the Austrian Academy of Sciences (FWF).

Homepage Layout (June 8, 2011)

The CL homepage comes with a new layout fitting the summer season.

E-Learning Project accepted (May 23, 2011)

Proving if two objects are equivalent (modulo some axioms) is the main aim of the new eLearning project led by Dr. Harald Zankl.

Christian Sternagel passed his final examination (December 17, 2010)

Today DI Christian Sternagel passed his rigorosum (cum laude) and will soon be officially honoured with his doctorate.

TWF project accepted (December 15, 2010)

The Tyrolean Science Fund (Tiroler Wissenschaftsfond) is funding the project “Solving Non-Linear Arithmetic” led by Dr. Harald Zankl. Solving constraints of non-linear arithmetic is inevitable for many applications in hard- and software verification.

The funding will mainly be used to support a master thesis at the Computational Logic group.

FWF “Joint Project” accepted (December 6, 2010)

In its last assembly on December 1, the FWF Board accepted the FWF joint project “Structural and Computational Proof Theory” between Austria and France. The Austrian part of the proposal was coordinated by Priv.-Doz. Dr. Georg Moser. The project is about bringing together different aspects and developments in structural proof theory, namely deep inference, the Curry-Howard isomorphism, term rewriting, and Hilbert’s epsilon-calculus.

Logic Puzzles at BeSt (October 29, 2010)

For the third time the BeSt exhibition informed interested visitors about local and national educational facilities, course offers and universities. In the booth held by the Institute of Computer Science logic puzzles provided by the Computational Logic Group allowed visitors to cast a glance at the fascinating world of logic hidden behind puzzle games.

Martin Korp passed his final examination (October 22, 2010)

Today DI Martin Korp passed his rigorosum (cum laude) and will soon be officially honoured with his doctorate.

Forschungspreise der Stiftung Südtiroler Sparkasse (September 15, 2010)

Georg Moser was awarded the „Forschungspreise der Stiftung Südtiroler Sparkasse“ to honour his habilitation thesis “Proof Theory at Work: Complexity Analysis of Term Rewrite Systems”.

Open PhD position (28 July, 2010)

The Computational Logic research group is looking for a talented PhD student for a 4 year university position.

Termination Competition 2010 (20 July, 2010)

The 6th international competition of termination tools is over. Three termination tools and one certifier, developed at our group, participated and all of them won in at least one of several categories.

SMT-COMP 2010 (19 July 2010)

SMT-COMP 2010 is over. MiniSmt participated in two categories which it dominated.

FWF project accepted (28 June 2010)

In its last assembly on June 28, the FWF board accepted Dr. René Thiemann's project proposal "Improving Certifiers for Termination Proofs." Termination is a fundamental property in computer science, since it is essential for verifying the correctness of programs. If a program is terminating, then it always yields a result. There are several automated tools to check for termination. Those tools, however, are horrendously complex pieces of software. Hence, they may contain errors and thus report wrong results. To counteract this problem, recent achievements in automatically certifying such proofs have been made.

FWF project accepted (1 March 2010)

In its last assembly on March 1 the FWF board accepted Univ.-Prof. Dr. Aart Middeldorp's project proposal "Confluence: Automation, Certification, Extensions". Confluence is a fundamental property in computer science. If an algorithm has the confluence property then computations have unique results.

Sarah Winkler receives Doc-fForte scholarship (26 February 2010)

For her PhD project in the area of automated reasoning, Sarah Winkler was awarded a three year doc-fForte grant by the Austrian Academy of Sciences.