Towards complexity metrics for Ada tasking
- 1 August 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 14 (8) , 1122-1127
- https://doi.org/10.1109/32.7623
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
This publication has 13 references indexed in Scilit:
- Detection of Ada static deadlocks using Petri net invariantsIEEE Transactions on Software Engineering, 1989
- A petri net framework for automated static analysis of Ada tasking behaviorJournal of Systems and Software, 1988
- Metrics for Ada packages: an initial studyCommunications of the ACM, 1986
- A graphical notation for describing executions of concurrent Ada programsACM SIGAda Ada Letters, 1986
- Modeling the Ada task system by Petri netsComputer Languages, 1985
- Applying software complexity metrics to program maintenanceComputer, 1982
- Software quality metrics based on interconnectivityJournal of Systems and Software, 1981
- A Measure of Control Flow Complexity in Program TextIEEE Transactions on Software Engineering, 1979
- A Complexity MeasureIEEE Transactions on Software Engineering, 1976
- Software unit profiles & Kiviat figuresACM SIGMETRICS Performance Evaluation Review, 1973