Mechanisation of PDA and Grammar Equivalence for Context-Free Languages

Select |




Print


Barthwal, Aditi; Norrish, Michael

Barthwal, Aditi; Norrish, Michael


2010-07-07


Conference Material


17th Workshop on Logic, Language, Information and Computation


Brasília, Brazil


125-135


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.


Springer


language theory, interactive theorem proving


http://wollic.org/wollic2010/


nicta:3847


Barthwal, Aditi; Norrish, Michael. Mechanisation of PDA and Grammar Equivalence for Context-Free Languages. In: Anuj Dawar Editor, editor/s. 17th Workshop on Logic, Language, Information and Computation; Brasília, Brazil. Springer; 2010-07-07. 125-135.



Loading citation data...

Citation counts
(Requires subscription to view)