Skip to main content

TS

Mechanisation of PDA and grammar equivalence for context-free languages

Authors

Aditi Barthwal and Michael Norrish

Australian National University

NICTA

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.

BibTeX Entry

  @inproceedings{Barthwal_Norrish_10,
    publisher        = {Springer},
    author           = {Barthwal, Aditi and Norrish, Michael},
    month            = jul,
    editor           = {{Anuj Dawar}},
    year             = {2010},
    keywords         = {language theory, interactive theorem proving},
    title            = {Mechanisation of {PDA} and Grammar Equivalence for Context-Free Languages},
    booktitle        = {17th Workshop on Logic, Language, Information and Computation },
    pages            = {125-135},
    address          = {Brasília, Brazil}
  }

Download

Served by Apache on Linux on seL4.