Related articles |
---|
How to verify that optimizations preserve semantics linuxkaffee_@_gmx.net (Stephan Ceram) (2010-05-11) |
Re: How to verify that optimizations preserve semantics bfranke@inf.ed.ac.uk (=?ISO-8859-1?Q?Bj=F6rn_Franke?=) (2010-05-12) |
Re: How to verify that optimizations preserve semantics monnier@iro.umontreal.ca (Stefan Monnier) (2010-05-12) |
Re: How to verify that optimizations preserve semantics jeremy.wright@microfocus.com (Jeremy Wright) (2010-05-13) |
Re: How to verify that optimizations preserve semantics tc@cs.bath.ac.uk (Tom Crick) (2010-05-13) |
Re: How to verify that optimizations preserve semantics walter@bytecraft.com (Walter Banks) (2010-05-14) |
Re: How to verify that optimizations preserve semantics cr88192@hotmail.com (BGB / cr88192) (2010-05-14) |
From: | Stephan Ceram <linuxkaffee_@_gmx.net> |
Newsgroups: | comp.compilers |
Date: | 11 May 2010 20:34:27 GMT |
Organization: | Compilers Central |
Keywords: | debug, optimize, question |
Posted-Date: | 12 May 2010 00:58:45 EDT |
Hi,
I was wondering how compiler optimisations can be verified,
i.e. whether they perform always valid code modifications? How is it
done in practice?
I assume that the only safe way would be to formulate the applied code
modifications as formal transformations that model every possible
situation that can ever occur. But on the other hand this seems to be
infeasible for most optimisations since they are too complex for
analytical models.
An alternative would be regression tests, but are such tests safe? I
mean you can never be sure that you did not miss a scenario that may
occur in practice.
Regards,
Stephen
Return to the
comp.compilers page.
Search the
comp.compilers archives again.