Task sequencing language for specifying distributed Ada systems TSL-1

  • D. C. Luckham
  • D. P. Helmbold
  • D. L. Bryan
  • M. A. Haberler
Conference paper

DOI: 10.1007/3-540-17945-3_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 259)
Cite this paper as:
Luckham D.C., Helmbold D.P., Bryan D.L., Haberler M.A. (1987) Task sequencing language for specifying distributed Ada systems TSL-1. In: de Bakker J.W., Nijman A.J., Treleaven P.C. (eds) PARLE Parallel Architectures and Languages Europe. PARLE 1987. Lecture Notes in Computer Science, vol 259. Springer, Berlin, Heidelberg

Abstract

TSL-1 is a language for specifying sequences of tasking events occuring in the execution of distributed Ada1 programs. TSL-1 specifications are included in an Ada program as formal comments. They express constraints to be satisfied by the sequences of actual tasking events that can occur. An Ada program is consistent with its TSL-1 specifications if its runtime behavior satisfies them. This paper presents an overview of TSL-1. The features of the language are described informally, and examples illustrating the use of TSL-1, both for debugging and for specification of tasking programs, are given. Some important constructs, as well as topics related to uncertainty of observation of distributed programs, are dealt with in other papers. In the future, constructs for defining abstract units will be added to TSL-1, forming a new language TSL-2 for the specification of distributed systems prior to their implementation in any programming language.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1987

Authors and Affiliations

  • D. C. Luckham
    • 1
  • D. P. Helmbold
    • 1
  • D. L. Bryan
    • 1
  • M. A. Haberler
    • 1
  1. 1.Program Analysis and Verification Group Computer Systems LaboratoryStanford UniversityStanford

Personalised recommendations