Groups | Search | Server Info | Login | Register
Groups > comp.compilers > #3662
| From | Martin Ward <mwardgkc@gmail.com> |
|---|---|
| Newsgroups | comp.compilers |
| Subject | Re: AI for optimization? |
| Date | 2025-05-25 15:37 +0100 |
| Organization | Compilers Central |
| Message-ID | <25-05-019@comp.compilers> (permalink) |
On 24/05/2025 06:26, [anton@mips.complang.tuwien.ac.at](mailto:anton@mips.complang.tuwien.ac.at) wrote: > I expect that I am not the first one with this idea, and that there are > papers about it already, but I have not kept up with optimization literature, so I > am not aware of that. Maybe someone knows of such work? A recent paper (of which I am one of the authors) is not specifically directed at optimisation, but at program understanding. Since a smaller program is often a more efficient progam there is a lot of overlap. Also, the simplicity metric developed in the paper could be refined to an efficiency metric which aims to reduce the amount of code and also replaces less efficient constructs by more efficient but semantically equivalent constructs: "Climbing The Hill to Understand The Code" Doni Pracner, Martin Ward, Natasa Sukur and Zoran Budimac IEEE Access April 2024, Print ISSN: 2169-3536, Online ISSN: 2169-3536 doi:10.1109/ACCESS.2024.3389500 <http://www.gkc.org.uk/martin/papers/Climbing_The_Hill_to_Understand_The_Code.pdf> \-- Martin Dr Martin Ward | Email: [martin@gkc.org.uk](mailto:martin@gkc.org.uk) | <http://www.gkc.org.uk> G.K.Chesterton site: <http://www.gkc.org.uk/gkc> | Erdos number: 4
Back to comp.compilers | Previous | Next | Find similar
Re: AI for optimization? Martin Ward <mwardgkc@gmail.com> - 2025-05-25 15:37 +0100
csiph-web