Symbolic data flow analysis for detecting dead locks in ada tasking programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1845, Issue , 2000, Pages 225-237

  Blieberger, Johann ^a   Burgstaller, Bernd ^a   Scholz, Bernhard ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

DATA FLOW ANALYSIS; DATA TRANSFER; FORMAL METHODS; LOCKS (FASTENERS);

ADA PROGRAMS; CONCURRENT SOFTWARE; DEAD LOCK; DEADLOCK FREENESS; DETECTING DEADLOCKS; HARDWARE ENVIRONMENT; SYMBOLIC DATA FLOWS; SYMBOLIC EVALUATION;

ADA (PROGRAMMING LANGUAGE);

EID: 84956993041     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722060_21     Document Type: Conference Paper

References (20)

1. J. Blieberger, Data-flow frameworks for worst-case execution time analysis, Real- Time Systems (2000), (to appear).
2. J. Blieberger and B. Burgstaller, Symbolic reaching definitions analysis of Ada programs, Proceedings of Ada-Europe’98 (Uppsala, Sweden), pp. 238–250.
3. J. Blieberger, B. Burgstaller, and B. Scholz, Interprocedural Symbolic Evaluation of Ada Programs with Aliases, Ada-Europe’99 International Conference on Reliable Software Technologies (Santander, Spain), pp. 136–145.
4. J. Blieberger, T. Fahringer, and B. Scholz, Symbolic cache analysis for real-time systems, Real-Time Systems, Special Issue onWorst-Case Execution Time Analysis (2000), (to appear)
5. E. Bruneton and J.-F. Pradat-Peyre, Automatic verification of concurrent Ada programs, Ada-Europe’99 International Conference on Reliable Software Technologies (Santander, Spain), pp. 146–157
6. T. E. Cheatham, G. H. Holloway, and J. A. Townley, Symbolic evaluation and the analysis of programs, IEEE Trans. on Software Engineering 5 (1979), no. 4, 403–417
7. J. C. Corbett, Evaluating deadlock detection methods for concurrent software, IEEE Transactions on Software Engineering 22 (1996), no. 3, 161–180.
8. L. K. Dillon, Using symbolic execution for verification of Ada tasking programs, ACM Transactions on Programming Languages and Systems 12 (1990), no. 4, 643–669.
9. E. Duesterwald, Static concurrency analysis in the presence of procedures, Tech. Report #91-6, Department of Computer Science, University of Pittsburgh, 1991.
10. E. Duesterwald and M. L. Soffa, Concurrency analysis in the presence of procedures using a data-flow framework, Proceedings of the 4th Symp. on Testing, Analysis and Verification (TAV4), pp. 36–48.
11. S. Duri, U. Buy, R. Devarapalli, and S. M. Shatz, Application and experimental evaluation of state space reduction methods for deadlock analysis in Ada, ACM Trans. on Software Engineering and Methodology 3 (1994), no. 4, 161–180.
12. T. Fahringer and B. Scholz, Symbolic Evaluation for Parallelizing Compilers, Proc. of the ACM International Conference on Supercomputing.
13. D. Long and L. A. Clarke, Data flow analysis of concurrent systems that use the rendezvous model of synchronization, Proceedings of the ACM Symp. on Testing, Analysis, and Verification, pp. 21–35.
14. S. P. Masticola, Static detection of deadlocks in polynomial time, Ph.D. thesis, Graduate School—New Brunswick, Rutgers, The State University of New Jersey, 1993.
15. S. P. Masticola and B. G. Ryder, Static infinite wait anomaly detection in polynomial time, Proceedings of the 1990 International Conference on Parallel Processing, pp. II78–II87.
16. B. G. Ryder and M. C. Paull, Elimination algorithms for data flow analysis, ACM Computing Surveys 18 (1986), no. 3, 277–315.
17. B. Scholz, J. Blieberger, and T. Fahringer, Symbolic Pointer Analysis for Detecting Memory Leaks, ACM SIGPLAN Workshop on ”Partial Evaluation and Semantics- Based Program Manipulation” (PEPM’00) (Boston).
18. E. Stoltz, H. Srinivasan, J. Hook, and M. Wolfe, Static single assignment form for explicitly parallel programs: Theory and practice, Tech. report, Dept. of Computer Science and Engineering, Oregon Graduate Institute of Science and Technology, Portland, Oregon, 1994. 235
19. R. N. Taylor, A general-purpose algorithm for analyzing concurrent programs, Communications of the ACM 26 (1983), no. 5, 362–376.
20. M. Young and R. N. Taylor, Combining static concurrency analysis with symbolic execution, IEEE Trans. on Software Engineering 14 (1988), no. 10, 1499–1511.