Sequential circuit verification using symbolic model checking
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Model checking
Verification and Validation of Rule-Based Expert Systems
Verification and Validation of Rule-Based Expert Systems
Characterization of Temporal Property Classes
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Automatic Abstraction Using Generalized Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Automatic Translation of Natural Language System Specifications
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
XTAG: a graphical workbench for developing tree-adjoining grammars
ANLC '92 Proceedings of the third conference on Applied natural language processing
EACL '83 Proceedings of the first conference on European chapter of the Association for Computational Linguistics
The design of a computer language for linguistic information
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
A simple reconstruction of GPSG
COLING '86 Proceedings of the 11th coference on Computational linguistics
A debug tool for practical grammar development
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
Error mining for wide-coverage grammar engineering
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Computational cognitive linguistics
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Hi-index | 0.00 |
Unification grammars are widely used for encoding human knowledge. For unification systems, one major difficulty is the debugging of rules. In this paper, the authors suggest a novel method based on model checking to theoretically verify a complex grammar system for a unification-based parser. We propose the modeling method of the grammar and, more importantly, the abstraction method to compress the state space. We apply partial Kripke structures to model the rules. We prove that the state space can be reduced by several orders of magnitude while still keeping the behaviors of a noncompressed one. Practical verification issues are discussed, including the restrictions on specifications, the properties to check, etc. The proposed method will contribute to the effective debugging and application of unification grammars.