Related articles |
---|
symbolic simplification resources simina.branzei@gmail.com (2007-09-13) |
Re: symbolic simplification resources Ruslan@Shevchenko.Kiev.UA (rssh) (2007-09-13) |
Re: symbolic simplification resources martin@gkc.org.uk (Martin Ward) (2007-09-14) |
Re: symbolic simplification resources valeriocavadini@hotmail.com (Valerio Cavadini) (2007-09-16) |
From: | Martin Ward <martin@gkc.org.uk> |
Newsgroups: | comp.compilers |
Date: | Fri, 14 Sep 2007 09:40:27 +0100 |
Organization: | Compilers Central |
References: | 07-09-044 |
Keywords: | optimize |
Posted-Date: | 15 Sep 2007 15:12:41 EDT |
On Thursday 13 Sep 2007 15:11, simina.branzei@gmail.com wrote:
> I am trying to write a work report on symbolic simplification, and
> more implementation details of how this is generally done in a
> compiler.
Although it is mostly about program slicing, this paper describes
the expression/condition simplifier in the FermaT program
transformation system:
ConSUS: A Scalable Approach to Conditioned Slicing,
M. Daoudi, L. Ouarbya, J. Howroyd, S. Danicic, Mark Harman,
Chris Fox, M. P. Ward,
9th IEEE Working Conference on Reverse Engineering, 2002.
October 28 - November 1, 2002 Richmond, Virginia, USA
IEEE Computer Society
You can download it from here:
http://www.cse.dmu.ac.uk/~mward/martin/papers/
--
Martin
martin@gkc.org.uk http://www.cse.dmu.ac.uk/~mward/ Erdos number: 4
G.K.Chesterton web site: http://www.cse.dmu.ac.uk/~mward/gkc/
Return to the
comp.compilers page.
Search the
comp.compilers archives again.