Specifying Ada tasking using patterns of behavior

TLS-1 is a language for specifying sequences of tasking events occurring in the execution of concurrent Ada programs. Such specifications are intended primarily for testing and debugging of Ada tasking programs. They can also be applied in the design of programs. TSL-1 specifications are included in Ada programs as formal comments. They express constraints to be satisfied by the sequences of actual tasking events. An overview is presented of TSL-1 as an annotation and specification language. The features of the language are described informally, using the alternating-bit protocol as an example. The main goal is to show how to express the patterns of desirable and undesirable behavior as well as the circumstances under which the patterns must or must not happen.<<ETX>>

[1]  D. Helmbold,et al.  Runtime detection and description of deadness errors in Ada tasking , 1985, ALET.

[2]  Keith A. Bartlett,et al.  A note on reliable full-duplex transmission over half-duplex links , 1969, Commun. ACM.

[3]  Juris Hartmanis,et al.  The Programming Language Ada Reference Manual American National Standards Institute, Inc. ANSI/MIL-STD-1815A-1983 , 1983, Lecture Notes in Computer Science.

[4]  D. Stott Parker,et al.  Saving traces for Ada debugging , 1985 .

[5]  Roy H. Campbell,et al.  The specification of process synchronization by path expressions , 1974, Symposium on Operating Systems.

[6]  Ole-Johan Dahl,et al.  Time Swquences as a Tool for Describing Program Behaviour , 1979, Abstract Software Specifications.

[7]  P. M. Melliar-Smith,et al.  From State Machines to Temporal Logic: Specification Methods for Protocol Standards , 1982, The Analysis of Concurrent Systems.

[8]  C. Hewitt.  Planner: a language for manipulating models and proving theorems in a robot" ijcai-69 , 1970 .

[9]  C. A. R. Hoare,et al.  An axiomatic basis for computer programming , 1969, CACM.

[10]  Gilles Kahn,et al.  Coroutines and Networks of Parallel Processes , 1977, IFIP Congress.

[11]  Krzysztof R. Apt,et al.  Ten Years of Hoare's Logic: A Survey—Part I , 1981, TOPL.

[12]  Brent Hailpern.  Verifying Concurrent Processes Using Temporal Logic , 1982, Lecture Notes in Computer Science.

[13]  David C. Luckham,et al.  Task Sequencing Language for Specifying Distributed Ada Systems , 1987, PARLE.

[14]  Zohar Manna,et al.  The Modal Logic of Programs , 1979, ICALP.