Skip to main content
SpringerLink
Log in

Kronecker Algebra for Static Analysis of Ada Programs with Protected Objects

  • Conference paper
Book cover Reliable Software Technologies – Ada-Europe 2014 (Ada-Europe 2014)

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

Included in the following conference series:

Abstract

Kronecker algebra has proven useful in analyzing multithreaded programs when semaphores are the only synchronization primitives. In contrast, Ada uses higher level synchronization primitives, namely protected objects. In this paper we show how Kronecker algebra can be generalized to statically analyze Ada multi-tasking programs that employ protected objects for synchronization issues.

This project has been supported by the National Research Foundation of Korea (NRF) funded by the Korean government (MEST) under grant number 2012K2A1A9054713, and by the Austrian Science Fund (FWF) project I 1035N23.

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. The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley Longman Publishing Co., Inc., Boston (2002)

    Google Scholar 

  2. Barnes, J.: Programming in Ada 2005. Addison Wesley (2006)

    Google Scholar 

  3. Bellman, R.: Introduction to Matrix Analysis. Classics in Applied Mathematics, 2nd edn. Society for Industrial and Applied Mathematics (1997)

    Google Scholar 

  4. Brukardt, R.L. (ed.): Ada 2012 Annotated Reference Manual (2012)

    Google Scholar 

  5. Buchholz, P., Kemper, P.: Efficient Computation and Representation of Large Reachability Sets for Composed Automata. Discrete Event Dyn. Systems 12(3), 265–286 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Burgstaller, B., Scholz, B., Blieberger, J.: A symbolic analysis framework for static analysis of imperative programming languages. Journal of Systems and Software 85(6), 1418–1439 (2012)

    Article  Google Scholar 

  7. Davio, M.: Kronecker Products and Shuffle Algebra. IEEE Trans. Computers 30(2), 116–125 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  8. Fechete, R., Kienesberger, G., Blieberger, J.: A framework for CFG-based static program analysis of Ada programs. In: Kordon, F., Vardanega, T. (eds.) Ada-Europe 2008. LNCS, vol. 5026, pp. 130–143. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Graham, A.: Kronecker Products and Matrix Calculus with Applications. Ellis Horwood Ltd., New York (1981)

    MATH  Google Scholar 

  10. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. Springer (1986)

    Google Scholar 

  11. Küster, G.: On the Hurwitz Product of Formal Power Series and Automata. Theor. Comput. Sci. 83(2), 261–273 (1991)

    Article  MATH  Google Scholar 

  12. Lengauer, T., Tarjan, R.E.: A fast algorithm for finding dominators in a flow graph. ACM Transactions on Programming Languages and Systems 1(1), 121–141 (1979)

    Article  MATH  Google Scholar 

  13. Miranda, J.: A Detailed Description of the GNU Ada Run Time (2002), http://www.iuma.ulpgc.es/users/jmiranda/gnat-rts/

  14. Mittermayr, R., Blieberger, J.: Shared Memory Concurrent System Verification using Kronecker Algebra. Technical Report 183/1-155, Automation Systems Group, TU Vienna (September 2011), http://arxiv.org/abs/1109.5522

  15. Mittermayr, R., Blieberger, J.: Timing Analysis of Concurrent Programs. In: Vardanega, T. (ed.) 12th International Workshop on Worst-Case Execution Time Analysis, Dagstuhl, Germany. OpenAccess Series in Informatics (OASIcs), vol. 23, pp. 59–68. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik (2012)

    Google Scholar 

  16. Plateau, B.: On the Stochastic Structure of Parallelism and Synchronization Models for Distributed Algorithms. ACM SIGMETRICS 13, 147–154 (1985)

    Article  Google Scholar 

  17. Rozenberg, G.: Handbook of Graph Grammars and Computing by Graph Transformation: Volume I. Foundations. World Scientific Publishing Co., Inc. (1997)

    Google Scholar 

  18. Taft, S.T., Duff, R.A., Brukardt, R.L., Plödereder, E., Leroy, P.: Ada 2005 Reference Manual. LNCS, vol. 4348. Springer, Heidelberg (2006)

    Google Scholar 

  19. Tarjan, R.E.: A Unified Approach to Path Problems. J. ACM 28(3), 577–593 (1981)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Yonsei University, Korea

    Bernd Burgstaller

  2. Vienna University of Technology, Austria

    Johann Blieberger

Authors
  1. Bernd Burgstaller
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Johann Blieberger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Paris-Est, Marne-la-Vallée, France

    Laurent George

  2. Department of Mathematics, University of Padua, via Trieste, 63, 35121, Padua, Italy

    Tullio Vardanega

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Burgstaller, B., Blieberger, J. (2014). Kronecker Algebra for Static Analysis of Ada Programs with Protected Objects. In: George, L., Vardanega, T. (eds) Reliable Software Technologies – Ada-Europe 2014. Ada-Europe 2014. Lecture Notes in Computer Science, vol 8454. Springer, Cham. https://doi.org/10.1007/978-3-319-08311-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08311-7_4

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08310-0

  • Online ISBN: 978-3-319-08311-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation