DocumentCode
1504108
Title
Towards complexity metrics for Ada tasking
Author
Shatz, Sol M.
Author_Institution
Dept. of Elect. Eng. & Comput. Sci., Illinois Univ., Chicago, IL, USA
Volume
14
Issue
8
fYear
1988
fDate
8/1/1988 12:00:00 AM
Firstpage
1122
Lastpage
1127
Abstract
Using Ada as a representative distributed programming language, the author discusses some ideas on complexity metrics that focus on Ada tasking and rendezvous. Concurrently active rendezvous are claimed to be an important aspect of communication complexity. A Petri net graph model of Ada rendezvous is used to introduce a rendezvous graph, an abstraction that can be useful in viewing and computing effective communication complexity
Keywords
Ada; computational complexity; directed graphs; distributed processing; software engineering; Ada rendezvous; Ada tasking; Petri net graph model; communication complexity; complexity metrics; concurrently active rendezvous; rendezvous graph; representative distributed programming language; software complexity; software engineering; Complexity theory; Distributed computing; Guidelines; Petri nets; Programming; Software design; Software maintenance; Software measurement; Software metrics; Software testing;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/32.7623
Filename
7623
Link To Document