Skip to main content
SpringerLink
Log in

Verification of Pushdown Systems Using Omega Algebra with Domain

  • Conference paper
Relational Methods in Computer Science (RelMiCS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3929))

Included in the following conference series:

Abstract

We present a framework for the verification of pushdown systems. These systems can model the interprocedural control flow of computer programs. The framework is based on an extension of Kleene algebra called omega algebra with domain. This allows to formulate behavioural properties that refer to both actions and states.

This research was supported by NSERC (Natural Sciences and Engineering Research Council of Canada).

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.

Similar content being viewed by others

References

  1. Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on infinite structures. In: Handbook of Process Algebra, pp. 545–623. Elsevier, Amsterdam (2001)

    Chapter  Google Scholar 

  2. Cohen, E.: Separation and reduction. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837, pp. 45–59. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, London (1971)

    MATH  Google Scholar 

  4. Desharnais, J., Möller, B., Struth, G.: Kleene algebra with domain. ACM Transactions on Computational Logic (to appear); Preliminary version: Report No. 2003-07, Universität Augsburg, Institut für Informatik (2003)

    Google Scholar 

  5. Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation 110, 366–390 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kozen, D.: Kleene algebra with tests. ACM Transactions on Programming Languages and Systems (TOPLAS) 19, 427–443 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kozen, D., Smith, F.: Kleene algebra with tests: Completeness and decidability. In: van Dalen, D., Bezem, M. (eds.) CSL 1996. LNCS, vol. 1258, pp. 244–259. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  8. Mathieu, V.: Vérification des systèmes à pile au moyen des algèbres de Kleene. Forthcoming Master’s thesis, Université Laval, Québec, Canada (2006)

    Google Scholar 

  9. Schwoon, S.: Model-Checking Pushdown Systems. Ph.D. thesis, Technische Universität München (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d’informatique et de génie logiciel, Université Laval, Québec, QC, G1K 7P4, Canada

    Vincent Mathieu & Jules Desharnais

Authors
  1. Vincent Mathieu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jules Desharnais
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Statistics and Computer Science, St. Francis Xavier University, Antigonish, NS, Canada

    Wendy MacCaull

  2. Department of Computer Science, Brock University, L2S 3A1, St. Catharines, Ontario, Canada

    Michael Winter

  3. Computer Science Department, Brock University, L2S 3A1, St. Catharines, Ontario, Canada

    Ivo Düntsch

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mathieu, V., Desharnais, J. (2006). Verification of Pushdown Systems Using Omega Algebra with Domain. In: MacCaull, W., Winter, M., Düntsch, I. (eds) Relational Methods in Computer Science. RelMiCS 2005. Lecture Notes in Computer Science, vol 3929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11734673_15

Download citation

  • DOI: https://doi.org/10.1007/11734673_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33339-5

  • Online ISBN: 978-3-540-33340-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation