Mechanisation of PDA and grammar equivalence for context-free languages

Authors:
Aditi Barthwal;Michael Norrish
Affiliations:
Australian National University;Canberra Research Lab., NICTA and Australian National University
Venue:
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Year:
2010

Citing 3
Cited 1

Verified Lexical Analysis

Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
A Brief Overview of HOL4

TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Verified, Executable Parsing

ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009

A formalisation of the normal forms of context-free grammars in HOL4

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a formalisation of the theory of pushdown automata (PDAs) using the HOL4 theorem prover. It illustrates how provers such as HOL can be used for mechanising complicated proofs, but also how intensive such a process can turn out to be. The proofs blow up in size in way difficult to predict from examining original textbook presentations. Even a meticulous text proof has "intuitive" leaps that need to be identified and formalised.