Souper: A Synthesizing Superoptimizer · HackerPapers discussions

Souper: A Synthesizing Superoptimizer — mentioned by viraptor

Mon, 21 Jul 2025 13:22:59 GMT

You're missing forest for the trees and lacking information to discuss this really. Check out this paper and similar ones if you want to learn about this area: https://arxiv.org/pdf/1711.04422

Paper and discussion history. A mention is not an endorsement.

Souper: A Synthesizing Superoptimizer — mentioned by muke101

Fri, 24 Jan 2025 13:50:06 GMT

If you're going to rewrite LLVM, you should avoid just trying to 'do it again but less bloated', because that'll end up where LLVM is now once you've added enough features and optimisation to be competitive. Rewriting LLVM gives you the opportunity to rethink some of its main problems. Of those I think two big ones include Tablegen and peephole optimisations. The backend code for LLVM is awful, and tablegen only partially addresses the problem. Most LLVM code for defining instruction opcodes amounts to multiple huge switch statements that stuff every opcode into them, its disgusting. This…

Paper and discussion history. A mention is not an endorsement.

Souper: A Synthesizing Superoptimizer — mentioned by judofyr

Thu, 04 Feb 2021 08:51:29 GMT

But it has some kind of direct replacement mode, why aren't there benchmarks for that? Crickets... That's not fair. They've published a paper which has lots of details: https://arxiv.org/pdf/1711.04422.pdf > Performance of the SPEC benchmarks was also unevenly affected by Souper: five become faster and seven become slower. None of the differences was very large.

Paper and discussion history. A mention is not an endorsement.

Souper: A Synthesizing Superoptimizer — mentioned by rahimiali

Thu, 04 Feb 2021 03:50:58 GMT

I'm not sure if I'm interpreting the paper [0] correctly, but both the abstract and the quote below from the Experiments section sound like they're not going to aim for faster code, but for a meta goal (that I admit I don't understand) instead? "The goal is to give compiler developers actionable advice about missing optimizations. To do this, someone uses sclang to extract Souper left-hand sides from programs of interest. Since Souper finds many more optimizations than developers could reasonably implement, the crux is ranking them in such a way that desirable optimizations are found early in…

Paper and discussion history. A mention is not an endorsement.

Souper: A Synthesizing Superoptimizer — mentioned by CalChris

Sun, 31 Jan 2021 01:32:16 GMT

I think you meant John Regehr and his souper friends at the University of Utah. https://arxiv.org/abs/1711.04422

Paper and discussion history. A mention is not an endorsement.

Souper: A Synthesizing Superoptimizer — mentioned by chrisaycock

Wed, 13 Feb 2019 20:52:36 GMT

Program synthesis [1] can be used for a variety of applications, including superoptimizers [2] and programming by example [3]. [1] https://dl.acm.org/citation.cfm?id=3208071 [2] https://arxiv.org/abs/1711.04422 [3] https://www.microsoft.com/en-us/research/wp-content/uploads/...

Paper and discussion history. A mention is not an endorsement.

Souper: A Synthesizing Superoptimizer — mentioned by tom_mellior

Sun, 24 Dec 2017 13:10:59 GMT

Yes, if you use Z3 as part of a proof assistant like Isabelle/HOL or F-Star. No, if you use Z3 as part of some other system that does not have its own primitive notion of proofs and proof checking. Many tools are like this: Dafny is one, I think, as is Why3, and the Alive system for checking the correctness of LLVM peephole optimizations. They simply trust Z3. It's also used in lots of other things that are not "verifiers" as such. For example, to find new compiler optimizations by superoptimization: https://arxiv.org/abs/1711.04422 (And sure enough, if you search the paper for "Z3", the…

Paper and discussion history. A mention is not an endorsement.

Souper: A Synthesizing Superoptimizer — HN submission

Wed, 15 Nov 2017 18:58:05 GMT

Souper: A Synthesizing Superoptimizer

73 points; 7 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Souper: A Synthesizing Superoptimizer — HN submission

Wed, 15 Nov 2017 10:37:08 GMT

Souper: A Synthesizing Superoptimizer

3 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.