Cited By
View all- Hemmendinger D(2019)Specifying Ada Server Tasks with Executable Formal GrammarsIEEE Transactions on Software Engineering10.1109/32.5610016:7(741-754)Online publication date: 2-Jan-2019
Specifying and automatically generating Ada tasks in Prolog
Pages 121 - 127
References
[1]
S. Andler, "Predicate path expressions", Sixth ACM Symposium on the Principles of Programming Languages, New York, pp. 226-236, 1979.
[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]
A. Bums, Concurrent Programming in Ada, Cambridge University Press, Cambridge, 1985.
[4]
R. H. Campbell and A. N. Habermarm, 'if'he specification of process synchronization by path expressions", Lecture Notes in Computer Science vol. 16, Springer Verlag, Heidelberg, pp. 89-102, 1974.
[5]
L. Flon and A. N. Habermann, 'Towards the construction of verifiable software systems", Proceedings of the ACM Conference on Data, SIGPLAN Notices, vol. 8, March, pp, 141-148, 1976,
[6]
N. Gehani, Ada: Concurrent Programming, Prentice- Hall, Englewood Cliffs, N. J., 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]
D. Hemmendinger, "Specifying Ada tasks with executable formal grammars", IEEE Transactions on Software Engineering, forthcoming.
[10]
C.A.R. Hoare, "Monitors: an operating system structuring concept", Comm. of the ACM, vol. 17, pp. 549- 557, 1974.
[11]
J.D. Ichbiah, et al., Rationale for the design of" the ADA programming language, A CM SIGPLAN Notices
[12]
R. B. Kieburtz and A. Silberschatz, "Access-fight expressions", ACM Trans. on Programming Languages and Systems, vol. 5, no. 1, pp. 78-96, 1983.
[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 and R. Simon, 'Traps using the COUNT attribute in the readers-writers problem", Ada Letters, vol 9, no. 5, pp. i23-128 (July/August, 1989).
[16]
M.W. Shields, "Adequate path expressions", Semantics of Concurrent Computations (Lecture Notes in Computer Science, vol. 70), Springer, New York, pp. 249- 265, 1980.
Index Terms
- Specifying and automatically generating Ada tasks in Prolog
Recommendations
Generating customized verifiers for automatically generated code
GPCE '08: Proceedings of the 7th international conference on Generative programming and component engineeringProgram verification using Hoare-style techniques requires many logical annotations. We have previously developed a generic annotation inference algorithm that weaves in all annotations required to certify safety properties for automatically generated ...
Generating integration test cases automatically
FSE '10: Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineeringIn this thesis, I investigate the problem of automatically generating test cases. In particular, I focus on the problem of automatic generation of integration test cases from unit test cases. I start from the observation that software is usually ...
Generating MC68000 code for Ada
SIGSMALL '83: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computersWe adapted the code generator of the Karlsruhe Ada compiler to produce symbolic MC68000 code. The essential part of the code generator - the code selection phase - is produced automatically by the Code Generator Synthesis System (CGSS) out of a formal ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1990 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 January 1990
Check for updates
Qualifiers
- Article
Conference
CSC90
Sponsor:
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 211Total Downloads
- Downloads (Last 12 months)14
- Downloads (Last 6 weeks)3
Reflects downloads up to 29 Nov 2024
Other Metrics
Citations
Cited By
View all- Hemmendinger D(2019)Specifying Ada Server Tasks with Executable Formal GrammarsIEEE Transactions on Software Engineering10.1109/32.5610016:7(741-754)Online publication date: 2-Jan-2019
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in