Automated Analysis of Concurrent Systems with the Constrained Expression Toolset

IEEE Transactions on Software Engineering

Volumn 17, Issue 11, 1991, Pages 1204-1222

  Avrunin, George S ^a   Corbetl, James C ^a   Wileden, Jack C ^a   Buy, Ugo A ^b   Dillon, Laura K ^c  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

^b University of 111ino ^*  (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

analysis tools; Concurrent systems. automated analysis; constrained expressions; event based model; experimental evaluation; formal methods; toolset performance

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES - ADA; COMPUTER SOFTWARE; MATHEMATICAL PROGRAMMING;

CONCURRENT SYSTEMS AUTOMATED ANALYSIS; CONSTRAINED EXPRESSION FORMALISM; CONSTRAINED EXPRESSION TOOLSET; INEQUALITY GENERATOR;

COMPUTER SYSTEMS, DIGITAL;

EID: 0026258660     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.106975     Document Type: Article

References (30)

1. G. M. Karam and R. J. Buhr, “Starvation and critical race analyzers for Ada,” IEEE Trans. Software Eng., vol. 16, pp. 829–843, Aug. 1990.
2. S. M. Shatz and W. K. Cheng, “A Petri net framework for automated static analysis of Ada tasking behavior,” J. Syst. Software, vol. 8, pp. 343–359, 1988.
3. R. N. Taylor, “A general-purpose algorithm for analyzing concurrent programs,” Commun. ACM, vol. 26, pp. 362–376, May 1983.
4. E. M. Clarke, E. A. Emerson, and A. P. Sistla, “Automatic verification of finite-state concurrent systems using temporal logic specifications,” ACM Trans. Programming Languages and Syst., vol. 8, pp. 244–263, Apr. 1986.
5. L. K. Dillon, “Verifying general safety properties of Ada tasking programs,” IEEE Trans. Software Eng., vol. 16, pp. 51–63, Jan. 1990.
6. D. Helmbold and D. Luckham, “Debugging Ada tasking programs,” IEEE Software, vol. 2, pp. 47–57, Mar. 1985.
7. D. S. Rosenblum and D. C. Luckham, “Testing the correctness of tasking supervisors with TSL specifications,” in Proc. ACM SIGSOFT ’89 3rd Symp. on Software Testing, Analysis and Verification, R. A. Kemmerer, Ed., pp. 187–196
8. Software Eng. Notes, vol. 14, no. 8, 1989.
9. J. C. Wileden, “Constrained expressions and the analysis of designs for dynamically-structured distributed systems,” in Proc. Int. Conf. on Parallel Process., Aug. 1982, pp. 340–344.
10. G. S. Avrunin, L. K. Dillon, J. C. Wileden, and W. E. Riddle, “Constrained expressions: adding analysis capabilities to design methods for concurrent software systems,” IEEE Trans. Software Eng., vol. SE-12, pp. 278–292, Feb. 1986.
11. L. K. Dillon, G. S. Avrunin, and J. C. Wileden, “Constrained expressions: toward broad applicability of analysis methods for distributed software systems,” ACM Trans. Program. Languages and Syst., vol. 10, pp. 374-402, July 1988.
12. G. S. Avrunin, L. K. Dillon, and J. C. Wileden, “Experiments with automated constrained expression analysis of concurrent software systems,” in Proc. ACM SIGSOFT ’89 3rd Symp. on Software Testing, Analysis and Verification, R. A. Kemmerer, Ed., pp. 124–130
13. Software Eng. Notes, vol. 14, no. 8, 1989
14. S. Katz and D. Peled, “An interleaving set temporal logic,” in Proc. 6th Ann. ACM Symp. on Principles of Distributed Comput. 1987, pp. 178–190.
15. L. A. Clarke, J. C. Wileden, and A. L. Wolf, “Nesting in Ada programs is for the birds,” in Proc. ACM-SIGPLAN Symp. on the Ada Program. Language, 1980, pp. 139–145
16. SIGPLAXNotices, vol. 15, no. 11, 1980
17. R. J. Dakin, “A tree search algorithm for mixed integer programming problems,” Computer J., vol. 8, pp. 250–255, 1965.
18. M. A. Saunders, “MINOS system manual,” Dept. Operations Res., Stanford Univ., Palo Alto, CA, Tech. Rep. SOL 77–31, 1977.
19. M. Young, R. N. Taylor, K. Forester, and D. Brodbeck, “Integrated concurrency analysis in a software development environment,” in Proc. ACM SIGSOFT ’89 3rd Symp. on Software Testing, Analysis and Verification, R. A. Kemmerer, Ed., pp. 200–209
20. Software Eng. Notes, vol. 14, no. 8.
21. S. Tu, S. M. Shatz, and T. Murata, “Theory and application of Petri net reduction for Ada-tasking deadlock analysis,” preprint, 1990.
22. K.-C. Tai, “A graphical notation for describing executions of concurrent Ada programs,” Ada Lett., vol. 6, pp. 94–103, Jan.-Feb. 1986.
23. G. Ricart and A. K. Agrawala, “An optimal algorithm for mutual exclusion in computer networks,” Commun. ACM, vol. 24, pp. 9–17, 1981.
24. L. Lamport, “A new solution of Dijkstra’s concurrent programming problem,” Commun. ACM, vol. 17, no. 8, pp. 453–455, 1974.
25. G. S. Avrunin and J. C. Wileden, “Describing and analyzing distributed software system designs,” ACM Trans. Program. Languages and Syst., vol. 7, pp. 380–403, July 1985.
26. R. N. Taylor, “Complexity of analyzing the synchronization structure of concurrent programs,” Acta Inform., vol. 19, pp. 57–84, 1983.
27. G. S. Avrunin, J. C. Corbett, L. K. Dillon, and J. C. Wileden, “Automated constrained expression analysis of real-time software,” Dept. Comput. and Inform. Sci., Univ. Massachusetts, Amherst, Tech. Rep. 90–117, Dec. 1990.
28. C. E. McDowell, “A practical algorithm for static analysis of parallel programs,” J. Parallel and Distributed Process., vol. 6, pp. 515–536, June 1989.
29. A. Valmari. “A stubborn attack on state explosion,” in Computer-Aided Verification ’90 (Series in Discrete Mathematics and Theoretical Computer Sci., vol. 3), E. M. Clarke and R. P. Kurshan, Eds. Providence, RI: Amer. Math. Soc., 1991, pp. 25-11.
30. T. Murata, B. Shenker, and S. M. Shatz, “Detection of Ada static deadlocks using Petri net invariants,” IEEE Trans. Software Eng., vol. 15, pp. 314–326, Mar. 1989.