Proof-Carrying Model for Parsing Techniques

Citation:
El-Zawawy, M. A., "Proof-Carrying Model for Parsing Techniques", 14th International Conference On Computational Science and Its Applications - {ICCSA} 2014 - , Guimarães, Portugal, June 30 - July 3, 2014, Proceedings, Part {V}, vol. 8583: Lecture Notes in Computer Science, Springer, pp. 1–14, 2014.

Abstract:

This paper presents new approaches to common parsing algorithms. The new approach utilizes the concept of inference rule. Therefore the new approach is simple, yet powerful enough to overcome the performance of traditional techniques. The new approach is basically composed of systems of inference rules.
Mathematical proofs of the equivalence between proposed systems and classical algorithms are outlined in the paper. The proposed technique provides a correctness verification (a derivation of inference rules) for each parsing process. These verifications are required in modern applications such as mobile computing. Results of experimental proving the efficiency of the proposed systems and their produced verifications are shown in the paper.

Notes:

n/a

Related External Link

PreviewAttachmentSize
Proof-Carrying Model for Parsing Techniques.pdf303.13 KB