Award Abstract # 2242786
SHF:Small:Concurrency In Reversible Computations

NSF Org: CCF
Division of Computing and Communication Foundations
Recipient: AUGUSTA UNIVERSITY RESEARCH INSTITUTE, INC
Initial Amendment Date: February 15, 2023
Latest Amendment Date: February 15, 2023
Award Number: 2242786
Award Instrument: Standard Grant
Program Manager: Anindya Banerjee
abanerje@nsf.gov
 (703)292-7885
CCF
 Division of Computing and Communication Foundations
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: March 1, 2023
End Date: February 28, 2027 (Estimated)
Total Intended Award Amount: $582,562.00
Total Awarded Amount to Date: $582,562.00
Funds Obligated to Date: FY 2023 = $582,562.00
History of Investigator:
  • Clement Aubert (Principal Investigator)
    caubert@augusta.edu
Recipient Sponsored Research Office: AUGUSTA UNIVERSITY RESEARCH INSTITUTE, INC.
AUGUSTA UNIVERSITY 1120 15TH STREET
AUGUSTA
GA  US  30912-0001
(706)721-2592
Sponsor Congressional District: 12
Primary Place of Performance: AUGUSTA UNIVERSITY
1120 15TH ST STE
AUGUSTA
GA  US  30912-0004
Primary Place of Performance
Congressional District:
12
Unique Entity Identifier (UEI): N4WWJC8T2593
Parent UEI: N4WWJC8T2593
NSF Program(s): Software & Hardware Foundation
Primary Program Source: 01002324DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 7923, 7943
Program Element Code(s): 779800
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

Most computers today are designed to operate unidirectionally, but novel adiabatic, quantum, and biological computers require bidirectional, that is, forward and backward flow of computations, because such computations are reversible in nature. Such novel technologies have already started to revolutionize not only the very essence of computing, but also of communicating. The communication protocols they utilize are drastically different from the ones currently in use, and much more complex, since the protocols must account for the possibility that any participant may undo any computation. This project provides a complete and satisfactory set of definitions to specify reversible protocols, demonstrate their equivalence, and reason about independent events. The project's novelties are to propose direction-agnostic definitions whenever possible, treating backward and forward executions as equal, and to leverage reversibility to question choices inherited from forward-only formalisms. The project's impacts are in the development and adoption of reversible languages, that will allow the creation of energy-efficient systems and protocols; but also improve security and reliability thanks to built-in forensic capabilities.

This project concurrently refines the definition of independence for reversible systems; implements a specification language for reversible systems; enriches current definitions of contextual equivalences; and strives to take inspiration from different fields to strike "the right" set of operators to represent reversible communications. The project's advances include a greater homogeneity between the different representations of reversible protocols, a better insight into the principled development of reversible languages, and a better integration between the formalism used to specify protocols and its application to reasoning about modern reversible systems.

This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

Aubert, Clément "The correctness of concurrencies in (reversible) concurrent calculi" Journal of Logical and Algebraic Methods in Programming , v.136 , 2024 https://doi.org/10.1016/j.jlamp.2023.100924 Citation Details

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page