A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Mechanisation of PDA and Grammar Equivalence for Context-Free Languages
[chapter]
2010
Lecture Notes in Computer Science
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.
doi:10.1007/978-3-642-13824-9_11
fatcat:dyxpnendozamvf7myuaunpig5u