Skip to main content
SpringerLink
Log in
Book cover

NASA Formal Methods Symposium

NFM 2015: NASA Formal Methods pp 422–428Cite as

A Tool for Intersecting Context-Free Grammars and Its Applications

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9058))

Abstract

This paper describes a tool for intersecting context-free grammars. Since this problem is undecidable the tool follows a refinement-based approach and implements a novel refinement which is complete for regularly separable grammars. We show its effectiveness for safety verification of recursive multi-threaded programs.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bouajjani, A., Esparza, J., Touili, T.: A generic approach to the static analysis of concurrent programs with procedures. In: POPL, pp. 62–73 (2003)

    Google Scholar 

  2. Chaki, S., Clarke, E., Kidd, N., Reps, T., Touili, T.: Verifying concurrent message-passing c programs with recursive calls. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 334–349. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Esparza, J., Rossmanith, P., Schwoon, S.: A uniform framework for problems on context-free grammars. Bulletin of the EATCS 72, 169–177 (2000)

    MATH  MathSciNet  Google Scholar 

  4. Gange, G., Navas, J.A., Stuckey, P.J., Søndergaard, H., Schachte, P.: Unbounded model-checking with interpolation for regular language constraints. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 277–291. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  5. Gange, G., Navas, J.A., Stuckey, P.J., Søndergaard, H., Schachte, P.: A complete refinement procedure for regular separability of context-free languages (2014). http://people.eng.unimelb.edu.au/gkgange/pubs/cfg_preprint.pdf

  6. Hooimeijer, P., Weimer, W.: StrSolve: Solving string constraints lazily. ASE 19(4), 531–559 (2012)

    Google Scholar 

  7. Long, Z., Calin, G., Majumdar, R., Meyer, R.: Language-theoretic abstraction refinement. In: de Lara, J., Zisman, A. (eds.) FASE 2012. LNCS, vol. 7212, pp. 362–376. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  8. Nederhof, M.-J.: Regular approximation of CFLs: a grammatical view. In: Advances in Probabilistic and Other Parsing Technologies, vol. 16, pp. 221–241 (2000)

    Google Scholar 

  9. Qadeer, S., Wu, D.: KISS: keep it simple and sequential. In: PLDI, pp. 14–24 (2004)

    Google Scholar 

  10. Suwimonteerabuth, D., Schwoon, S., Esparza, J.: jMoped: a java bytecode checker based on moped. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 541–545. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Veanes, M., de Halleux, P., Tillmann, N.: Rex: symbolic regular expression explorer. In: ICSTVV, pp. 498–507 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Melbourne, Melbourne, VIC, 3010, Australia

    Graeme Gange, Peter Schachte, Harald Søndergaard & Peter J. Stuckey

  2. NASA Ames Research Center, Moffett Field, CA, 94035, USA

    Jorge A. Navas

Authors
  1. Graeme Gange
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jorge A. Navas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peter Schachte
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Harald Søndergaard
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Peter J. Stuckey
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jorge A. Navas .

Editor information

Editors and Affiliations

  1. Jet Propulsion Laboratory, Pasadena, California, USA

    Klaus Havelund

  2. Jet Propulsion Laboratory, Pasadena, California, USA

    Gerard Holzmann

  3. Jet Propulsion Laboratory, Pasadena, California, USA

    Rajeev Joshi

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Gange, G., Navas, J.A., Schachte, P., Søndergaard, H., Stuckey, P.J. (2015). A Tool for Intersecting Context-Free Grammars and Its Applications. In: Havelund, K., Holzmann, G., Joshi, R. (eds) NASA Formal Methods. NFM 2015. Lecture Notes in Computer Science(), vol 9058. Springer, Cham. https://doi.org/10.1007/978-3-319-17524-9_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-17524-9_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-17523-2

  • Online ISBN: 978-3-319-17524-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation