Extensions of Logics Used in Computer Science and Their     Decision Procedures
{'Code': '05010100', '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}
Extensions of logics currently used in computer science are being               investigated.  Under particular consideration are extensions of temporal        and dynamic logic which appear to be quite natural and to have                  considerable expressive power.  A new model of alternating automata             working on trees is being used that allows very simple and efficient            decision procedures.  In basic cases, proofs of decidability of the             intended logics are being given that are simpler than the standard              proofs for the unextended logics.  Extensions of these methods are being        attempted to questions involving protocols where knowledge should be            taken into account for communicating systems.  Also under consideration         are some extremely strong dynamic logics with infinitary run quantifiers        in which essentially any fairness condition can be expressed.                                                                                                   The PIs propose to use tools they have developed in recent innovative           work in formal language theory to investigate logics used in computer           science.  The theory program can properly devote funds toward the               development and use of such methods in theoretical computer science.            The proposed work ties together in a positive way the theory traditions         of the U.S. and France.
[{'FirstName': 'David', 'LastName': 'Muller', 'PI_MID_INIT': 'E', 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'David E Muller', 'EmailAddress': None, 'PI_PHON': None, 'NSF_ID': '000460486', 'StartDate': '07/15/1987', 'EndDate': None, 'RoleCode': 'Co-Principal Investigator'}, {'FirstName': 'Paul', 'LastName': 'Schupp', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Paul Schupp', 'EmailAddress': 'schupp@math.uiuc.edu', 'PI_PHON': '2173331610', 'NSF_ID': '000283136', 'StartDate': '07/15/1987', 'EndDate': None, 'RoleCode': 'Principal Investigator'}]
{'Name': 'University of Illinois at Urbana-Champaign', 'CityName': 'URBANA', 'ZipCode': '618013620', 'PhoneNumber': '2173332187', 'StreetAddress': '506 S WRIGHT ST', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Illinois', 'StateCode': 'IL', 'CONGRESSDISTRICT': '13', 'CONGRESS_DISTRICT_ORG': 'IL13', 'ORG_UEI_NUM': 'Y8CWNJRCNN91', 'ORG_LGL_BUS_NAME': 'UNIVERSITY OF ILLINOIS', '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': '2860', 'Text': 'THEORY OF COMPUTING'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8703807.xml'}