41 citations · 57 across the 4 of their papers we have counts for
4 papers
Souper: A Synthesizing Superoptimizer
Raimondas Sasnauskas, Yang Chen, Peter Collingbourne +4
If we can automatically derive compiler optimizations, we might be able to sidestep some of the substantial engineering challenges involved in creating and maintaining a high-quali…
Implementing and Evaluating Candidate-Based Invariant Generation
Adam Betts, Nathan Chong, Pantazis Deligiannis +2
The discovery of inductive invariants lies at the heart of static program verification. Presently, many automatic solutions to inductive invariant generation are inflexible, only a…
Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
Jeroen Ketema, Jakob Grue Simonsen
We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are normalising f…
Infinitary Combinatory Reduction Systems: Confluence
Jeroen Ketema, Jakob Grue Simonsen
We study confluence in the setting of higher-order infinitary rewriting, in particular for infinitary Combinatory Reduction Systems (iCRSs). We prove that fully-extended, orthogona…