Safe and leakproof resource management using Ada83 limited types

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Safe and leakproof resource management using Ada83 limited types

Full text

Pdf (1.03 MB)

Source

ACM SIGAda Ada Letters archive
Volume XIII , Issue 5 (Sept./Oct. 1993) table of contents

Pages: 32 - 42

Year of Publication: 1993

ISSN:1094-3641

Author

Henry G. Baker

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 6, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/165354.165362 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Henry Ledgard, Reference Manual for the ADA Programming Language, Springer-Verlag New York, Inc., Secaucus, NJ, 1983
	2	Henry G. Baker, Jr., List processing in real time on a serial computer, Communications of the ACM, v.21 n.4, p.280-294, April 1978 [doi>10.1145/359460.359470]
	3	[Baker89] Baker, H. "The NIMBLE Project-Real-Time Common Lisp for Embedded Exprt System Applications". Proc. 1989 AIAA Computers in Aerospace Conf., Monterey, CA, 1989.
	4	Henry G. Baker, Structured programming with limited private types in Ada: nesting if for the soaring eagles, ACM SIGAda Ada Letters, v.XI n.5, p.79-90, July/August 1991 [doi>10.1145/122215.122219]
	5	Henry G. Baker, The treadmill: real-time garbage collection without motion sickness, ACM SIGPLAN Notices, v.27 n.3, p.66-70, March 1992 [doi>10.1145/130854.130862]
	6	Henry G. Baker, CONS should not CONS its arguments, or, a lazy alloc is a smart alloc, ACM SIGPLAN Notices, v.27 n.3, p.24-34, March 1992 [doi>10.1145/130854.130858]
	7	Henry G. Baker, Equal rights for functional objects or, the more things change, the more they are the same, ACM SIGPLAN OOPS Messenger, v.4 n.4, p.2-27, Oct. 1993 [doi>10.1145/165593.165596]
	8	Henry G. Baker, Lively linear Lisp: “look ma, no garbage!”, ACM SIGPLAN Notices, v.27 n.8, p.89-98, Aug. 1992 [doi>10.1145/142137.142162]
	9	Henry G. Baker, How to steal from a limited private account: why mode IN OUT parameters for limited types must be passed by reference, ACM SIGAda Ada Letters, v.XIII n.3, p.91-95, May/June 1993 [doi>10.1145/152647.152655]
	10	John Beidler, Relaxing the constraints on Ada's limited private types through functional expressions, ACM SIGAda Ada Letters, v.XII n.2, p.57-61, March/April 1992 [doi>10.1145/142003.142007]
	11	Gerry Fisher, Universal arithmetic packages, ACM SIGAda Ada Letters, v.III n.6, p.30-47, May-June 1984 [doi>10.1145/998388.998389]
	12	Douglas E. Harms , Bruce W. Weide, Copying and Swapping: Influences on the Design of Reusable Software Components, IEEE Transactions on Software Engineering, v.17 n.5, p.424-435, May 1991 [doi>10.1109/32.90445]
	13	Richard B. Kieburtz, Programming without pointer variables, Proceedings of the 1976 conference on Data : Abstraction, definition and structure, p.95-107, March 22-24, 1976, Salt Lake City, Utah, United States
	14	Ron Kownacki , S. Tucker Taft, Portable and efficient dynamic storage management in Ada, Proceedings of the 1987 annual ACM SIGAda international conference on Ada, p.190-198, December 1987, Boston, Massachusetts, United States [doi>10.1145/317500.317526]
	15	Henry Lieberman , Carl Hewitt, A real-time garbage collector based on the lifetimes of objects, Communications of the ACM, v.26 n.6, p.419-429, June 1983 [doi>10.1145/358141.358147]
	16	B. J. MacLennan, Values and objects in programming languages, ACM SIGPLAN Notices, v.17 n.12, December 1982 [doi>10.1145/988164.988172]
	17	Geoffrey O. Mendal, Storage reclamation models for Ada programs, Proceedings of the 1987 annual ACM SIGAda international conference on Ada, p.180-189, December 1987, Boston, Massachusetts, United States [doi>10.1145/317500.317525]
	18	Steven M. Rosen, Controlling dynamic objects in large Ada systems, ACM SIGAda Ada Letters, v.VII n.5, p.79-92, Sept./Oct. 1987 [doi>10.1145/36077.36083]
	19	[STEELMAN78] Dept. of Defense STEELMAN requirements for high order computer programming languages. June, 1978.
	20	[Taft91] Taft, S. Tucker, et al. Ada-9X Draft Mapping Document. Wright Lab., AFSC, Eglin AFB, FL, Feb. 1991.
	21	David Ungar, Generation Scavenging: A non-disruptive high performance storage reclamation algorithm, Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments, p.157-167, April 1984
	22	[vanWijngaarden77] van Wijngaarden, A., et al. "Revised Report on the Algorithmic Language Algol 68". ACM Sigplan Not. 12, 5 (May 1977), 1-70.
	23	[Yen90] Yen, Mike. "Using a Dynamic Memory Management Package to Facilitate Building Lisp-like Data Structures in Ada". Proc. AIDA-90, Nov, 1990, 85-93.

CITED BY 3

	Stephen Crawley , Michael Oudshoorn, Orthogonal persistence and Ada, Proceedings of the conference on TRI-Ada '94, p.298-308, November 06-11, 1994, Baltimore, Maryland, United States
	Magnus Kempe, Abstract data types are under full control with Ada 9X, Proceedings of the conference on TRI-Ada '94, p.141-152, November 06-11, 1994, Baltimore, Maryland, United States
	Henry G. Baker, Minimizing reference count updating with deferred and anchored pointers for functional data structures, ACM SIGPLAN Notices, v.29 n.9, p.38-43, Sept. 1994