William A. Josephson
- 1.Apt, K. and Kozen, D. Limits For Automatic Verification of Finite-State Concurrent Systems. Information Processing Letters 22, 1986, 307-309. Google Scholar
Digital Library
- 2.Buhr, R.J.A., Karam, G.M., and Woodside, C.M. An Overview and Example Application of CAEDE: A New Design Environment for Ada. International Ada Conference. 1985. Google ScholarDigital Library
- 3.Burns, A., Lister, A., and Wellings, A. A Review of Ada Tasking. Lecture Notes In Computer Science, Springer Verlag, 1987. Google ScholarDigital Library
- 4.Clarke, L., Wileden, J.C., Taylor, R.N., Young, M., and Osterweil, L.J. ARCADIA: A software development environment research project. Proc. IEEE Second Int. Conf. Ada Applications and Environments, Miami Beach, FL, 1986.Google Scholar
- 5.Cunha, P.R.F. and Maibaum, T.S.E. A Synchronization Calculus For Message Oriented Programming. ProcL Int. Conf. on Distributed Systems, 1981, 433-445.Google Scholar
- 6.GTE Government Systems. Software Requirements Analysis for the Strategic Communications Simulator. Pro~ect 89CS867. GTE Government Systems, Strateaic Systems Division, 1989.Google Scholar
- 7.Harel, D., Lachover, H., Naamad, A., Pnueli, A., Politi, M., Sherman, R., and Shtul-Trauring, A. STATEMATE: A Working Environment for the Development of Complex Reactive Systems. Proc. of the 10th IEEE Int. Conf. on Software Enaineerlna, New York, 1988. Google ScholarDigital Library
- 8.Holzmann, G. J. An Improved Protocol Reachability Analysis Technique. So~ftware - Practice and Experience, Volume 18 (2), 137-161. Google ScholarDigital Library
- 9.Milner, R. A Calculus of Communicating Systems. Lecture Notes in Computer Science, New York, 1980. Google ScholarDigital Library
- 10.Stavely, A.M. Modeling and Projection in Software Development. The Journal of Systems and SofLtware, Volume 3, 1983, 137-146.Google ScholarDigital Library
- 11.Taylor, R.N. A General-Purpose Algorithm for Analyzing Concurrent Programs . Communications of the ACM, Volume 26, Number 5, May 1983, 362 - 376. Google ScholarDigital Library
- 12.Taylor, R.N. Complexity of Analyzing the Synchronization Structure of Concurrent Programs. Acta Informatica. 1983, 57 - 84.Google Scholar
Index Terms
- Analysis tools for Ada concurrency designs
Recommendations
Modelling remote concurrency with Ada: case study of symmetric non-deterministic rendezvous
Ada-Europe'07: Proceedings of the 12th international conference on Reliable software technologiesWhen developing concurrent software, a proper engineering practice is to choose a good level of abstraction for expressing concurrency control. Ideally, this level should provide platform-independent abstractions but, as the platform concurrency ...
A concurrency analysis tool suite for Ada programs: rationale, design, and preliminary experience
Cats (Concurrency Analysis Tool Suite) is designed to satisfy several criteria: it must analyze implementation-level Ada source code and check user-specified conditions associated with program source code; it must be modularized in a fashion that ...
Semantics-based concurrency control: beyond commutativity
The concurrency of transactions executing on atomic data types can be enhanced through the use of semantic information about operations defined on these types. Hitherto, commutativity of operations has been exploited to provide enchanced concurrency ...
Comments