Re: AI for optimization?

Martin Ward <mwardgkc@gmail.com>
Sun, 25 May 2025 15:37:05 +0100

          From comp.compilers
Related articles
AI for optimization? anton@mips.complang.tuwien.ac.at (2025-05-24)
Re: AI for optimization? arnold@freefriends.org (2025-05-25)
Re: AI for optimization? mwardgkc@gmail.com (Martin Ward) (2025-05-25)
Re: AI for optimization? antispam@fricas.org (2025-05-25)
| List of all articles for this month |
From: Martin Ward <mwardgkc@gmail.com>
Newsgroups: comp.compilers
Date: Sun, 25 May 2025 15:37:05 +0100
Organization: Compilers Central
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="46687"; mail-complaints-to="abuse@iecc.com"
Keywords: optimize
Posted-Date: 25 May 2025 12:57:24 EDT

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

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.