Skip to main content
SpringerLink
Log in

Mechanisation of PDA and Grammar Equivalence for Context-Free Languages

  • Conference paper
Logic, Language, Information and Computation (WoLLIC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6188))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barthwal, A., Norrish, M.: Verified, executable parsing. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 160–174. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  2. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  3. Nipkow, T.: Verified lexical analysis. In: Grundy, J., Newey, M. (eds.) TPHOLs 1998. LNCS, vol. 1479, pp. 1–15. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  4. Slind, K., Norrish, M.: A brief overview of HOL4. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 28–32. Springer, Heidelberg (2008); See also the HOL website at http://hol.sourceforge.net

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Australian National University,  

    Aditi Barthwal & Michael Norrish

  2. Canberra Research Lab., NICTA,  

    Michael Norrish

Authors
  1. Aditi Barthwal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Norrish
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Laboratory, University of Cambridge, J.J. Thomson Avenue, CB3 0FD, Cambridge, UK

    Anuj Dawar

  2. Centro de Informática, Universidade Federal de Pernambuco, Avenida Prof Luis Freire s/n, Cidade Universitária, 50740-540, Recife, PE, Brazil

    Ruy de Queiroz

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barthwal, A., Norrish, M. (2010). Mechanisation of PDA and Grammar Equivalence for Context-Free Languages. In: Dawar, A., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2010. Lecture Notes in Computer Science(), vol 6188. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13824-9_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13824-9_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13823-2

  • Online ISBN: 978-3-642-13824-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation