article

Free access

The form of reusable Ada components for concurrent use

Author:

J. CarterAuthors Info & Claims

ACM SIGAda Ada Letters, Volume X, Issue 1

Pages 118 - 121

https://doi.org/10.1145/101139.101280

Published: 01 January 1990 Publication History

PDF eReader

Abstract

Abstract data types are often chosen to implement reusable Ada components for sequential use. Those who have attempted to expand from sequential to concurrent considerations have frequently continued to use abstract data types for their implementation. This approach is shown to violate software engineering principles. The use of abstract state machines for concurrent components is shown to resolve these problems.

References

[1]

1. Carter, J., "MMAIM: A Software Development Method for Ada; Part I - Description," Ada Letters, 1988 May/Jun.

Digital Library

Google Scholar

[2]

2. Carter, J., "MMAIM: A Software Development Method for Ada; Part II - Example," Ada Letters, 1988 Sep/Oct.

Digital Library

Google Scholar

[3]

3. Carter, J., "Reducing Software Development Costs with Ada," Proceedings of the Seventh Annual National Conference on Ada Technology, ANCOST, Inc., 1989.

Google Scholar

[4]

4. Genillard, C., N. Ebel, and A. Strohmeier, "Rationale for the Design of Reusable Abstract Data Types Implemented in Ada," Ada Letters, 1989 Mar/Apr.

Digital Library

Google Scholar

[5]

5. Booch, G., Software Components with Ada, Benjamin/Cummings, 1987.

Digital Library

Google Scholar

[6]

6. Cameron, J., "An Overview of JSD," IEEE Transactions on Software Engineering, 1986 Feb.

Digital Library

Google Scholar

[7]

7. Bate, G., The Official Handbook of Mascot, Version 3.1, Issue 1, Royal Signals and Radar Establishment, 1987.

Google Scholar

[8]

8. Booch, G., Software Engineering with Ada, Second Edition, Benjamin/Cummings, 1987.

Digital Library

Google Scholar

[9]

9. Buhr, R., System Design with Ada, Prentice-Hall, 1984.

Digital Library

Google Scholar

Cited By

View all

Behera CKumar P(2005)An improved algorithm for loop dead optimizationACM SIGPLAN Notices10.1145/1107541.110754540:11(18-28)Online publication date: 1-Nov-2005
https://dl.acm.org/doi/10.1145/1107541.1107545
Ramachandran M(2005)Software reuse guidelinesACM SIGSOFT Software Engineering Notes10.1145/1061874.106188930:3(1-8)Online publication date: 1-May-2005
https://dl.acm.org/doi/10.1145/1061874.1061889
Chiang C(2005)Implicit heterogeneous and parallel programmingACM SIGSOFT Software Engineering Notes10.1145/1061874.106188730:3(1-6)Online publication date: 1-May-2005
https://dl.acm.org/doi/10.1145/1061874.1061887
Show More Cited By

Index Terms

The form of reusable Ada components for concurrent use
1. Software and its engineering
  1. Software creation and management
    1. Designing software
    2. Software development techniques
      1. Reusability
  2. Software notations and tools
    1. General programming languages
      1. Language features
        Abstract data types
        Modules / packages

Recommendations

Reusable Concurrent Data Types
Proceedings of the 28th European Conference on ECOOP 2014 --- Object-Oriented Programming - Volume 8586

This paper contributes to address the fundamental challenge of building Concurrent Data Types CDT that are reusable and scalable at the same time. We do so by proposing the abstraction of Polymorphic Transactions PT: a new programming abstraction that ...
Concurrent transformation components using contention context sensors
ASE '14: Proceedings of the 29th ACM/IEEE International Conference on Automated Software Engineering

Sometimes components are conservatively implemented as thread-safe, while during the actual execution they are only accessed from one thread. In these scenarios, overly conservative assumptions lead to suboptimal performance.

The contribution of this ...
Ada 9X reusable components

The inclusion of concurrency in Ada leads to multiple reusable components which implement th e same abstraction. The proposed modifications of Ada 9X contain features which may eliminate th e need for more than one version of an abstraction. An example ...

Comments

Information & Contributors

Information

Published In

ACM SIGAda Ada Letters Volume X, Issue 1

Jan./Feb. 1990

77 pages

ISSN:1094-3641

DOI:10.1145/101139

Editor:
Geoff Mendal
Stanford Univ., Stanford, CA

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1990

Published in SIGADA Volume X, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
113
Total Downloads

Downloads (Last 12 months)10
Downloads (Last 6 weeks)4

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Behera CKumar P(2005)An improved algorithm for loop dead optimizationACM SIGPLAN Notices10.1145/1107541.110754540:11(18-28)Online publication date: 1-Nov-2005
https://dl.acm.org/doi/10.1145/1107541.1107545
Ramachandran M(2005)Software reuse guidelinesACM SIGSOFT Software Engineering Notes10.1145/1061874.106188930:3(1-8)Online publication date: 1-May-2005
https://dl.acm.org/doi/10.1145/1061874.1061889
Chiang C(2005)Implicit heterogeneous and parallel programmingACM SIGSOFT Software Engineering Notes10.1145/1061874.106188730:3(1-6)Online publication date: 1-May-2005
https://dl.acm.org/doi/10.1145/1061874.1061887
Crnkovic IReussner RSchmidt HSimons KStafford JWallnau K(2005)Report of the International Symposium on Component-Based Software EngineeringACM SIGSOFT Software Engineering Notes10.1145/1061874.106188430:3(1-9)Online publication date: 1-May-2005
https://dl.acm.org/doi/10.1145/1061874.1061884
Ramachandran M(2005)Software reuse guidelinesIRI -2005 IEEE International Conference on Information Reuse and Integration, Conf, 2005.10.1109/IRI-05.2005.1506485(270-275)Online publication date: 2005
https://doi.org/10.1109/IRI-05.2005.1506485
Budiu MVenkataramani GChelcea TGoldstein S(2004)Spatial computationACM SIGPLAN Notices10.1145/1037187.102439639:11(14-26)Online publication date: 7-Oct-2004
https://dl.acm.org/doi/10.1145/1037187.1024396
Hammond LCarlstrom BWong VHertzberg BChen MKozyrakis COlukotun K(2004)Programming with transactional coherence and consistency (TCC)ACM SIGPLAN Notices10.1145/1037187.102439539:11(1-13)Online publication date: 7-Oct-2004
https://dl.acm.org/doi/10.1145/1037187.1024395
Feng JSears A(2004)Using confidence scores to improve hands-free speech based navigation in continuous dictation systemsACM Transactions on Computer-Human Interaction10.1145/1035575.103557611:4(329-356)Online publication date: 1-Dec-2004
https://dl.acm.org/doi/10.1145/1035575.1035576
Carter JSandén B(1998)The Practical Use of Ada 95's Concurrency FeaturesIEEE Concurrency10.1109/4434.7364256:4(47-56)Online publication date: 1-Oct-1998
https://dl.acm.org/doi/10.1109/4434.736425
Adams ECarswell LKumar AMeyer JEllis AHall PMotil J(1996)Interactive multimedia pedagogiesACM SIGCUE Outlook10.1145/1013718.23764624:1-3(182-191)Online publication date: 1-Jan-1996
https://dl.acm.org/doi/10.1145/1013718.237646
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Reusable Concurrent Data Types

Concurrent transformation components using contention context sensors

Ada 9X reusable components

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations