Research on Concurrency and Distributed Systems
{'Code': '05010400', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'name not available', 'PO_EMAI': None, 'PO_PHON': None}
Investigations will continue into mental tools for developing                   concurrent and distributed programs.  Some of that work is concerned            with the semantics and verification of concurrent and distributed               programs; other work, with identifying abstractions for fault-tolerant,         real-time, distributed systems.                                                                                                                                 A new approach that has been developed for verifying temporal                   properties of programs will be extended.  Previously, this approach             could not adequately handle properties specified by non-deterministic           Buchi automata.  This restriction will be relaxed.  Extension from a            posteriori verification to a program development methodology will also          be investigated.                                                                                                                                                An attempt will be made to narrow the gap between the theory and                practice of fault-tolerant distributed system design by using and               identifying helpful abstractions.  Using the state machine approach, a          prototype control program for a real-time process control and                   application will be constructed.  Optimization of fundamental protocols         for agreement and clock synchronization will be attempted based on              exploiting properties of the environment and application being                  controlled.  New, asynchronous, clock synchronization protocols will be         investigated.  Finally, techniques for programming using values                 obtained from approximately synchronized clocks will be studied.
{'FirstName': 'Fred', 'LastName': 'Schneider', 'PI_MID_INIT': 'B', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Fred B Schneider', 'EmailAddress': 'fbs@cs.cornell.edu', 'NSF_ID': '000153585', 'StartDate': '08/01/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'Cornell University', 'CityName': 'ITHACA', 'ZipCode': '148502820', 'PhoneNumber': '6072555014', 'StreetAddress': '341 PINE TREE RD', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'New York', 'StateCode': 'NY', 'CONGRESSDISTRICT': '19', 'CONGRESS_DISTRICT_ORG': 'NY19', 'ORG_UEI_NUM': 'G56PUALJ3KT5', 'ORG_LGL_BUS_NAME': 'CORNELL UNIVERSITY', 'ORG_PRNT_UEI_NUM': None}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '2875', 'Text': 'SYSTEM SOFTWARE'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8701103.xml'}