Specifying and automatically generating Ada tasks in Prolog

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Specifying and automatically generating Ada tasks in Prolog

Full text

Pdf (819 KB)

Source

ACM Annual Computer Science Conference archive
Proceedings of the 1990 ACM annual conference on Cooperation table of contents

Washington, D.C., United States

Pages: 121 - 127

Year of Publication: 1990

ISBN:0-89791-348-5

Authors

John Van Tassel	Computing Laboratory, University of Cambridge, Cambridge CB2 3QG, England
David Hemmendinger	Department of Electrical Engineering and Computer Science, Union College, Schenectady, NY

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions 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/100348.100367 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	Sten Andler, Predicate path expressions, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.226-236, January 29-31, 1979, San Antonio, Texas [doi>10.1145/567752.567774]
	2	H. Baxfinger, "Formal specification techniques in parallel and distributed systems", in Proc. of the Third Joint Ada Europe/Adatec Conference, ed. J. Teller, 1984, pp. 281-294.
	3	Alan Burns, Concurrent programming in Ada, Cambridge University Press, New York, NY, 1985
	4	Roy H. Campbell , A. Nico Habermann, The specification of process synchronization by path expressions, Operating Systems, Proceedings of an International Symposium, p.89-102, April 23-25, 1974
	5	L. Flon , A. N. Habermann, Towards the construction of verifiable software systems, Proceedings of the 1976 conference on Data : Abstraction, definition and structure, p.141-148, March 22-24, 1976, Salt Lake City, Utah, United States
	6	Narain Gehani, ADA: Concurrent Programming, Prentice-Hall, Inc., Upper Saddle River, NJ, 1984
	7	S. L Goldsack and T. Moreton, "Ada package specifications: path expressions and monitors", IEE Proceedings, vol 129, no. 2, pp. 49-54.
	8	A.N. Habermann, "Path expressions", Dept. of Computer Science, Carnegie Mellon Univ, Pittsburg, Pa, 1975.
	9	David Hemmendinger, Specifying Ada Server Tasks with Executable Formal Grammars, IEEE Transactions on Software Engineering, v.16 n.7, p.741-754, July 1990 [doi>10.1109/32.56100]
	10	C. A. R. Hoare, Monitors: an operating system structuring concept, Communications of the ACM, v.17 n.10, p.549-557, Oct. 1974 [doi>10.1145/355620.361161]
	11	Jean D. Ichbiah , Bernd Krieg-Brueckner , Brian A. Wichmann , John G. P. Barnes , Olivier Roubine , Jean-Claude Heliard, Rationale for the design of the Ada programming language, ACM SIGPLAN Notices, v.14 n.6b, p.1-261, June 1979 [doi>10.1145/956653.956654]
	12	Richard B. Kieburtz , Abraham Silberschatz, Access-Right Expressions, ACM Transactions on Programming Languages and Systems (TOPLAS), v.5 n.1, p.78-96, Jan. 1983 [doi>10.1145/357195.357201]
	13	P.E. Lauer and R. H. Campbell, "Formal semantics of a class of high level primitives for coordinating concurrent processes, Acta lnformatica, vol. 5, pp. 297- 332, 1975.
	14	P.E. Lauer, P. R. Torrigiani, M. W Shields, "COSY a system specification language based on paths and processes", Acta lnformatica, vol 9, pp. 109-158, 1979.
	15	A. Schiper , R. Simon, Traps using the COUNT attribute in the readers-writers problem, ACM SIGAda Ada Letters, v.IX n.5, p.123-128, July/Aug. 1989 [doi>10.1145/71340.71349]
	16	M. W. Shields, Adequate Path Expressions, Proceedings of the International Sympoisum on Semantics of Concurrent Computation, p.249-265, July 02-04, 1979