Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

LuFG Informatik 2 Zeit: Mittwoch, 15.06.2011, 10.00 Uhr

Summary: LuFG Informatik 2
Zeit: Mittwoch, 15.06.2011, 10.00 Uhr
Ort: Raum 5052, Ahornstr. 55
Referent: Dr. Byron Cook, Microsoft Research,
Cambridge, UK
Titel: Proving that programs eventually do something
Software failures can be sorted into two groups: those that cause the software to do
something wrong (e.g. crashing), and those that result in the software not doing
something useful (e.g. hanging). In recent years automatic tools have been devel-
oped which use mathematical proof techniques to certify that software cannot crash.
But, based on Alan Turing's proof of the halting problem's undecidability, many have
considered the dream of automatically proving the absence of hangs to be impossi-
ble. While not refuting Turing's original result, recent research now makes this dream
a reality. This lecture will describe this recent work and its application to industrial
Bio: Dr. Byron Cook is a Principal Researcher at Microsoft Research in Cambridge,
UK as well as Professor of Computer Science at Queen Mary, University of London.


Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)


Collections: Computer Technologies and Information Sciences