| 21 |
Grammatical Processing Using the Mechanisms of Physical Inference
|
|
|
|
In: DTIC (2004)
|
|
BASE
|
|
Show details
|
|
|
| 22 |
Robustness Versus Fidelity in Natural Language Understanding
|
|
|
|
In: DTIC (2004)
|
|
BASE
|
|
Show details
|
|
|
| 23 |
HITIQA: A Data Driven Approach to Interactive Analytical Question Answering
|
|
|
|
In: DTIC (2004)
|
|
BASE
|
|
Show details
|
|
|
| 24 |
From Unstructured to Structured Information in Military Intelligence - Some Steps to Improve Information Fusion
|
|
|
|
In: DTIC (2004)
|
|
BASE
|
|
Show details
|
|
|
| 25 |
Ontological Approach to Military Knowledge Modeling and Management
|
|
|
|
In: DTIC AND NTIS (2004)
|
|
BASE
|
|
Show details
|
|
|
| 26 |
Spatial Language for Human-Robot Dialogs
|
|
|
|
In: DTIC AND NTIS (2003)
|
|
BASE
|
|
Show details
|
|
|
| 27 |
HITIQA: An Interactive Question Answering System. A Preliminary Report
|
|
|
|
In: DTIC (2003)
|
|
BASE
|
|
Show details
|
|
|
| 28 |
Dialogue Management for an Automated Multilingual Call Center
|
|
|
|
In: DTIC (2003)
|
|
BASE
|
|
Show details
|
|
|
| 29 |
A Syntactic Approach to Foundational Proof-Carrying Code
|
|
|
|
In: DTIC AND NTIS (2002)
|
|
Abstract:
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language-specific typing rules; they certify safety but only if there is no bug in the typing rules. In Foundational Proof-Carrying Code (FPCC), on the other hand, proofs are constructed and veri ed using strictly the foundations of mathematical logic, with no type-specific axioms. FPCC is more flexible and secure because it is not tied to any particular type system and it has a smaller trusted base. Foundational proofs, however, are much harder to construct. Previous reports on FPCC all required building sophisticated semantic models for types. Furthermore, none of them can be easily extended to support mutable fields and higher-order polymorphism. In this article, we present a syntactic approach to FPCC that avoids all of these difficulties. Under our new scheme, the foundational proof for a typed machine program simply consists of the typing derivation plus the formalized syntactic soundness proof for the underlying type system. The former can be readily obtained from a type-checker while the latter is known to be much easier to construct than the semantic soundness proofs. We give a translation from a typed assembly language into FPCC and demonstrate the advantages of our new system via an implementation in the Coq proof assistant. ; Presented at the Annual IEEE Symposium (17th) on Logic in Computer Science (LICS'02), Jul 2002. Pub. in IEEE Symposium v17 n39 p1-44, 17 Jul 2002.
|
|
Keyword:
*COMPUTER PROGRAMS; *SYSTEMS MANAGEMENT; ASSEMBLY LANGUAGES; Computer Systems Management and Standards; FPCC(FOUNDATIONAL PROOF-CARRYING CODE); MATHEMATICAL LOGIC; MATHEMATICAL MODELS; SEMANTICS; SYMPOSIA; SYNTACTIC SOUNDNESS PROOF; SYNTAX; Theoretical Mathematics; TYPED ASSEMBLY LANGUAGE
|
|
URL: http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA436619
http://www.dtic.mil/docs/citations/ADA436619
|
|
BASE
|
|
Hide details
|
|
|
| 30 |
Proceedings of the Twenty-Fourth Annual Conference of the Cognitive Science Society
|
|
|
|
In: DTIC AND NTIS (2002)
|
|
BASE
|
|
Show details
|
|
|
| 31 |
Automatic Predicate Argument Analysis of the Penn TreeBank
|
|
|
|
In: DTIC (2001)
|
|
BASE
|
|
Show details
|
|
|
| 33 |
Towards an ML-style Polymorphic Type System for C
|
|
|
|
In: DTIC (1996)
|
|
BASE
|
|
Show details
|
|
|
| 34 |
Rewriting Logic and its Applications First International Workshop, Asilomar Conference Center, Pacific Grove, California, 3-6 September 1996. Volume 4 Electronic Notes in Theoretical Computer Science.
|
|
|
|
In: DTIC AND NTIS (1996)
|
|
BASE
|
|
Show details
|
|
|
| 35 |
BBN: Description of the PLUM System as Used for MUC-6
|
|
|
|
In: DTIC (1995)
|
|
BASE
|
|
Show details
|
|
|
| 36 |
UMass/Hughes: Description of the Circus System Used for MUC-5
|
|
|
|
In: DTIC (1993)
|
|
BASE
|
|
Show details
|
|
|
| 37 |
BBN: Description of the PLUM System as Used for MUC-5
|
|
|
|
In: DTIC (1993)
|
|
BASE
|
|
Show details
|
|
|
| 38 |
Document Filtering Using Semantic Information from a Machine Readable Dictionary
|
|
|
|
In: DTIC (1993)
|
|
BASE
|
|
Show details
|
|
|
| 39 |
BBN's PLUM Probabilistic Language Understanding System
|
|
|
|
In: DTIC (1993)
|
|
BASE
|
|
Show details
|
|
|
| 40 |
New Results on the Compatibility of the Standard Conditional Likelihood Approach with Product Space Conditional Event Algebra
|
|
|
|
In: DTIC AND NTIS (1992)
|
|
BASE
|
|
Show details
|
|
|
|
|
