Atlas home || Conferences | Abstracts | about Atlas
Host: Schloss Dagstuhl
Homepage: http://www.inferenzsysteme.informatik.tu-darmstadt.de/~giesl/WST99.html
Email: giesl@informatik.tu-darmstadt.de
Organizers: Adam Cichon (Nancy, France), Nachum Dershowitz (Urbana, USA), Jürgen Giesl (Darmstadt, Germany), Pierre Lescanne (Lyon, France), Ursula Martin (St. Andrews, Scotland), Hans Zantema (Utrecht, The Netherlands)
Deadline for abstracts: February 01, 1999
Description:
In general, termination or the halting of computer processes is undecidable. However, termination proofs play a fundamental role in many applications and the
challenges are both practical and theoretical. From a practical point of view, proving termination is a central problem in software development and formal methods
for termination analysis are essential for program verification. From a theoretical point of view, termination is closely connected to mathematical logic and ordinal
theory. Many results have been achieved on termination of rewriting, but it is encouraged that termination questions from other areas will be covered by the
workshop, too. Therefore, the topic of the workshop is how to prove termination of any kind of computation.
Mail Address:
Jürgen Giesl Dept. of Computer Science Darmstadt University of Technology Alexanderstr. 10 64283 Darmstadt Germany
Date received: January 09, 1999
© 2008 Atlas Conferences Inc.