Skip to main content

High level interpretation of execution traces of Ada tasks

Interpretation de Haut Niveau des Traces d'Execution des Taches d'Ada

  • X — Tools For ADA
  • Conference paper
  • First Online:
ESEC '87 (ESEC 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 289))

Included in the following conference series:

  • 139 Accesses

Abstract

Ada's facilities for real-time programs and concurrency create new problems in program specification, design and debugging, rendering earlier development tools insufficient. The tool presented here is designed to aid the debugging of tasking activities. It first does a dynamic analysis of a program to produce a history of its execution without disturbing the real-time environment. It then does a static analysis to create an abstract representation of the program in the form of a concurrency state diagram. A comparison of the tasking activities of the history and diagram are then compared in order to find which control paths the execution could have followed. The results of this matching process are presented by a user-friendly graphics interface.

® Ada is a registered trademark of the U.S. Government (Ada Joint Program Office).

This work is partially funded by the European Communities under the ESPRIT program (Project DESCARTES Ref 937).

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. K.A. Bartlett, R.A. Scantleburry & P.T. Wilkinson: "A Note on Reliable Full-Duplex Transmission over Half-Duplex Links", Communications of the ACM, 12-5, May 1969.

    Google Scholar 

  2. A. Evans, G. Goos, W.A. Wulf & K.J. Butler: "DIANA: An Intermediate Language for Ada", Lecture Notes in Computer Science, Springer-Verlag, 1983.

    Google Scholar 

  3. S.M. German: "Monitoring for Deadlock and Blocking in Ada Tasking", IEEE Transactions on Software Engineering, Vol. SE-10, No. 6, November 1984, pp. 764–777.

    Google Scholar 

  4. D.P. Helmbold & D.C. Luckham: "Debugging Ada Tasking Programs", IEEE SOFTWARE, March 1985, pp. 47–57.

    Google Scholar 

  5. Military Standard Ada Programming Language, (ANSI/MIL-STD-1815A-1983), American National Standard Institute, January 1983.

    Google Scholar 

  6. L.J. Osterweil & R.N. Taylor: "Anomaly Detection in Concurrent Software by Static Data Flow Analysis", IEEE Transactions on Software Engineering, SE-6, No. 3, May 1980, pp. 265–277.

    Google Scholar 

  7. R.N. Taylor: "A General-Purpose Algorithm for Analyzing Concurrent Programs", Communications of the ACM, Vol. 26, No. 5, May 1983, pp. 362–376.

    Google Scholar 

  8. R.N. Taylor: "Analysis of Concurrent Software by Cooperative Application of Static and Dynamic Techniques", Software Validation; H.L. Hausen (ed.), Elsevier Science Publishers B.V. (North Holland), 1984, pp. 127–137.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Howard Nichols Dan Simpson

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caillet, JF., Bonnet, C., Raither, B. (1987). High level interpretation of execution traces of Ada tasks. In: Nichols, H., Simpson, D. (eds) ESEC '87. ESEC 1987. Lecture Notes in Computer Science, vol 289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022123

Download citation

  • DOI: https://doi.org/10.1007/BFb0022123

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18712-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics