NSF award 2551123 · University of Washington

Collaborative Research: SHF: Scaling E-graphs for Incremental Analysis and Optimization

Final report due

28 November 2030

in 1,502 days · The award ends on 31 July 2030.

GrantClerk is a private service. We are not NSF or any government agency.

Dates this award owes

NSF emails you about this too.

Decide about an extension2 Apr 2030in 1262 days
award ending 2030-07-31 · Research.gov
This one is ours, not NSF’s.
Extension request16 Jun 2030in 1337 days
award ending 2030-07-31 · Research.gov
PAPPG 24-1: “at least 45 days prior to the end date”
No-cost extension notice21 Jul 2030in 1372 days
award ending 2030-07-31 · Research.gov
PAPPG 24-1: “at least ten calendar days prior to the end date”
Final report due28 Nov 2030in 1502 days
award ending 2030-07-31 · Research.gov
PAPPG 24-1: “no later than 120-days following the end date of the award”
Project outcomes report due28 Nov 2030in 1502 days
award ending 2030-07-31 · Research.gov
PAPPG 24-1: “no later than 120 days following the end date”
Award is closed out28 Nov 2030in 1502 days
award ending 2030-07-31 · Research.gov
PAPPG 24-1: “financially closed out 120 days after their expiration date”

Annual report dates come from the budget period on your award notice. That date is not public, so it is not shown here.

How we got this date

NSF lists this award's end date as 31 July 2030.
NSF rules say the final report is due no later than 120 days after that.
So the final report is due by 28 November 2030.

Read the rule on Research.gov

Get a note before each report date

Add this award to your desk. We email you before each date and keep the dates in one place.

Renews each year until you cancel. Cancel any time from your account.

Already a member? Sign in

Award card

Award number: 2551123
Period of support: 1 Aug 2026 – 31 Jul 2030
Amount: $425,000
Awardee: University of Washington, Seattle, WA
Program: Software & Hardware Foundation
Directorate: CSE

Abstract

Equality saturation is a compiler optimization technique that compactly represents many equivalent versions of a program in a data structure called an e-graph. By keeping all known equivalent forms together, equality saturation avoids the "phase ordering" problem that has long limited traditional compilers, where applying one optimization can block another. The technique is now used to build state-of-the-art…

Is this right?

We copy this from the public NSF award record. Your award notice and NSF always win. If a date looks wrong, check Research.gov.