Project Grant FA95502110007

This three-year, $349,999 project grant from the National Science Foundation's Computer and Information Science and Engineering program aims to develop new techniques for automated lemma synthesis in interactive theorem provers. Specifically, the University of California, Los Angeles will reduce the lemma synthesis problem to a form of data-driven program synthesis, generating input-output examples from the current proof state to ensure generated lemmas target the user's goal. The project will...

This three-year Project Grant from the National Science Foundation's Division of Computing and Communication Foundations, under the Computer and Information Science and Engineering program (CFDA 47.070), provides $613,086 to Appalachian State University to develop deep induction rules for advanced data types. Deep induction is a generalization of structural induction that allows inducting over all data present in complex data structures like generalized algebraic data types (GADTs) and inductive...

The National Science Foundation Division of Mathematical Sciences awarded a $195,001 Project Grant to the University of Notre Dame under the Mathematical and Physical Sciences federal grant program (CFDA 47.049). The three-year award will support research into model-theoretic tree properties and their applications in algebra and combinatorics. Specifically, the Principal Investigator will continue developing the theory of model-theoretic tree properties and pursue applications of these...

This National Science Foundation Project Grant of $250,000 supports research at the University of California, San Diego to develop automated techniques for lemma synthesis in interactive theorem provers. The goal is to reduce the manual proof effort required when using interactive theorem provers to prove correctness and security properties of software. The project will explore multiple formulations of reducing the lemma synthesis problem to data-driven program synthesis, where the objective...

This Project Grant award from the National Science Foundation (CFDA 47.049 - Mathematical and Physical Sciences) will support research in descriptive set theory and computability at the University of California, Berkeley. The $170,000 award, spanning August 2024 to July 2027, will fund work in several areas: Studying questions on amenability and hyperfiniteness using tools from Gromov's theory of asymptotic dimension, with applications to topological dynamics and operator algebras. Research on...

Regents of the University of California at Riverside will conduct collaborative research on scalable pluggable type inference under a $289,000 project grant from the National Science Foundation's Computer and Information Science and Engineering program (CFDA 47.070). The university will develop techniques for pluggable type inference to automate the insertion of type annotations, allowing for more widespread adoption of pluggable type checking and improving software reliability and...

This three-year National Science Foundation project grant of $418,380 supports research at the University of Wisconsin-Madison to develop a neurosymbolic framework for semantics-aware program synthesis. Funded under the NSF's Computer and Information Science and Engineering program (CFDA 47.070), the award period runs from August 1, 2022 to July 31, 2025. Specifically, the university researchers will couple large neural models trained on source code with symbolic methods from formal methods to...

This Project Grant from the National Science Foundation's Computer and Information Science and Engineering program under the CFDA number 47.070 provided $599,566 to Brown University from January 1, 2023 through December 31, 2025. The grant funds research to investigate and address common misconceptions about formal logics, which are widely used in computer science to precisely define system requirements and user intent. Specifically, the project aims to study misconceptions in linear temporal...

This $203,163 National Science Foundation project grant supports collaborative research on definability and computability over arithmetically significant fields. The President and Fellows of Harvard College, doing business as Harvard University, will consider several problems at the intersection of logic, number theory, algebraic geometry, model theory, computability theory, and valuation theory. Specifically, the principal investigators intend to study computability and definability in the...

The National Science Foundation (NSF) awarded a $300,000 Project Grant under the Computer and Information Science and Engineering (CFDA 47.070) program to the Illinois Institute of Technology (IIT) Sponsored Research and Programs Division. The grant aims to address the growing need for formal reasoning about the safety, security, and reliability of complex software systems when heterogeneous analysis methods are applied. The key products and services to be delivered through this 3-year award...